# SOME DESCRIPTIVE TITLE.
# Copyright (C) pgRouting Contributors - Version v4.1
# This file is distributed under the same license as the pgRouting package.
# Celia Virginia Vergara Castillo <vicky@erosion.dev>, 2025.
# Daniel Nylander <daniel@danielnylander.se>, 2025, 2026.
msgid ""
msgstr "Project-Id-Version: pgRouting v4.1\nReport-Msgid-Bugs-To: \nPOT-Creation-Date: 2026-01-08 15:44+0000\nPO-Revision-Date: 2026-01-11 02:02+0000\nLast-Translator: Daniel Nylander <daniel@danielnylander.se>\nLanguage-Team: Swedish <https://weblate.osgeo.org/projects/pgrouting/pgrouting-develop/sv/>\nLanguage: sv\nMIME-Version: 1.0\nContent-Type: text/plain; charset=UTF-8\nContent-Transfer-Encoding: 8bit\nPlural-Forms: nplurals=2; plural=n != 1;\nX-Generator: Weblate 5.4.3\n"

msgid "BFS - Category"
msgstr "BFS - Kategori"

msgid ":doc:`pgr_kruskalBFS`"
msgstr ":doc:`pgr_kruskalBFS`"

msgid ":doc:`pgr_primBFS`"
msgstr ":doc:`pgr_primBFS`"

msgid "Traversal using breadth first search."
msgstr "Traversering med hjälp av första breda sökning."

msgid "It's implementation is only on **undirected** graph."
msgstr "Den är endast implementerad på en **ej riktad** graf."

msgid "Process is done only on edges with positive costs."
msgstr "Processen utförs endast på kanter med positiva kostnader."

msgid "When the graph is connected"
msgstr "När grafen är ansluten"

msgid "The resulting edges make up a tree"
msgstr "De resulterande kanterna bildar ett träd"

msgid "When the graph is not connected,"
msgstr "När grafen inte är ansluten,"

msgid "Finds a minimum spanning tree for each connected component."
msgstr "Hittar ett minsta spännträd för varje ansluten komponent."

msgid "The resulting edges make up a forest."
msgstr "De kanter som bildas utgör en skog."

msgid "Parameters"
msgstr "Parametrar"

msgid "Parameter"
msgstr "Parameter"

msgid "Type"
msgstr "Typ"

msgid "Description"
msgstr "Beskrivning"

msgid "`Edges SQL`_"
msgstr "`Kanter SQL`_"

msgid "``TEXT``"
msgstr "``TEXT``"

msgid "`Edges SQL`_ as described below."
msgstr "`Kanter SQL`_ enligt beskrivningen nedan."

msgid "**root vid**"
msgstr "**root vid**"

msgid "``BIGINT``"
msgstr "``BIGINT``"

msgid "Identifier of the root vertex of the tree."
msgstr "Identifierare för trädets rotvertex."

msgid "When value is :math:`0` then gets the spanning forest starting in aleatory nodes for each tree in the forest."
msgstr "När värdet är :math:`0` får du den spännvidd som börjar i aleatoriska noder för varje träd i skogen."

msgid "**root vids**"
msgstr "**root vids**"

msgid "``ARRAY`` [ **ANY-INTEGER** ]"
msgstr "``ARRAY`` [ **ANY-TAL** ]"

msgid "Array of identifiers of the root vertices."
msgstr "Array med identifierare för rotpunkterna."

msgid ":math:`0` values are ignored"
msgstr ":math:`0` värden ignoreras"

msgid "For optimization purposes, any duplicated value is ignored."
msgstr "För optimeringsändamål ignoreras alla duplicerade värden."

msgid "Where:"
msgstr "Var:"

msgid "ANY-INTEGER"
msgstr "ANY-TAL"

msgid "SMALLINT, INTEGER, BIGINT"
msgstr "SMALLINT, INTEGER, BIGINT"

msgid "ANY-NUMERIC"
msgstr "VALFRI NUMERISK"

msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT, NUMERIC"
msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT, NUMERIC"

msgid "BFS optional parameters"
msgstr "Valfria parametrar för BFS"

msgid "Default"
msgstr "Standard"

msgid "``max_depth``"
msgstr "``max_depth``"

msgid ":math:`9223372036854775807`"
msgstr ":math:`9223372036854775807`"

msgid "Upper limit of the depth of the tree."
msgstr "Övre gräns för trädets djup."

msgid "When negative throws an error."
msgstr "När negativ kastar ett fel."

msgid "Inner Queries"
msgstr "Inre frågor"

msgid "Edges SQL"
msgstr "Kanter SQL"

msgid "Column"
msgstr "Kolumn"

msgid "``id``"
msgstr "``id``"

msgid "**ANY-INTEGER**"
msgstr "**ANY-INTEGER**"

msgid "Identifier of the edge."
msgstr "Identifierare av kanten."

msgid "``source``"
msgstr "``source``"

msgid "Identifier of the first end point vertex of the edge."
msgstr "Identifierare för den första slutpunktsvertexen på kanten."

msgid "``target``"
msgstr "``target``"

msgid "Identifier of the second end point vertex of the edge."
msgstr "Identifierare för den andra slutpunktsvertexen på kanten."

msgid "``cost``"
msgstr "``cost``"

msgid "**ANY-NUMERICAL**"
msgstr "**ANY-NUMERICAL**"

msgid "Weight of the edge (``source``, ``target``)"
msgstr "Kantvikt (``källa``, ``mål``)"

msgid "``reverse_cost``"
msgstr "``reverse_cost``"

msgid "-1"
msgstr "-1"

msgid "Weight of the edge (``target``, ``source``)"
msgstr "Kantvikt (``mål``, ``källa``)"

msgid "When negative: edge (``target``, ``source``) does not exist, therefore it's not part of the graph."
msgstr "När negativ: kanten (``mål``, ``källa``) existerar inte, därför är den inte en del av grafen."

msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``"
msgstr "``SMALLINT``, ``INTEGER``, ``BIGINT``"

msgid "ANY-NUMERICAL"
msgstr "ANY-NUMERICAL"

msgid "``SMALLINT``, ``INTEGER``, ``BIGINT``, ``REAL``, ``FLOAT``"
msgstr "``SMALLINT``, ``INTEGER``, ``BIGINT``, ``REAL``, ``FLOAT``"

msgid "Result columns"
msgstr "Resultat kolumner"

msgid "Returns set of ``(seq, depth, start_vid, node, edge, cost, agg_cost)``"
msgstr "Returnerar uppsättning av ``(seq, depth, start_vid, node, edge, cost, agg_cost)``"

msgid "``seq``"
msgstr "``seq``"

msgid "Sequential value starting from :math:`1`."
msgstr "Sekventiellt värde med början från :math:`1`."

msgid "``depth``"
msgstr "``depth``"

msgid "Depth of the ``node``."
msgstr "Djupet på ``noden``."

msgid ":math:`0` when ``node`` = ``start_vid``."
msgstr ":math:`0` när``node`` = ``start_vid``."

msgid "``start_vid``"
msgstr "``start_vid``"

msgid "Identifier of the root vertex."
msgstr "Identifierare för rotvertexen."

msgid "``node``"
msgstr "``node``"

msgid "Identifier of ``node`` reached using ``edge``."
msgstr "Identifierare av ``nod`` som nås med hjälp av ``kant``."

msgid "``edge``"
msgstr "``edge``"

msgid "Identifier of the ``edge`` used to arrive to ``node``."
msgstr "Identifierare av den ``kant`` som används för att komma till ``nod``."

msgid ":math:`-1` when ``node`` = ``start_vid``."
msgstr ":math:`-1` när ``node`` = ``start_vid``."

msgid "``FLOAT``"
msgstr "``FLOAT``"

msgid "Cost to traverse ``edge``."
msgstr "Kostnad för att korsa ``kant``."

msgid "``agg_cost``"
msgstr "``agg_cost``"

msgid "Aggregate cost from ``start_vid`` to ``node``."
msgstr "Sammanlagd kostnad från ``start_vid`` till ``node``."

msgid "See Also"
msgstr "Se även"

msgid "`Boost: Prim's algorithm <https://www.boost.org/libs/graph/doc/prim_minimum_spanning_tree.html>`__"
msgstr "`Boost: Prims algoritm <https://www.boost.org/libs/graph/doc/prim_minimum_spanning_tree.html>`__"

msgid "`Boost: Kruskal's algorithm <https://www.boost.org/libs/graph/doc/kruskal_min_spanning_tree.html>`__"
msgstr "`Boost: Kruskals algoritm <https://www.boost.org/libs/graph/doc/kruskal_min_spanning_tree.html>`__"

msgid "`Wikipedia: Prim's algorithm <https://en.wikipedia.org/wiki/Prim%27s_algorithm>`__"
msgstr "`Wikipedia: Prims algoritm <https://en.wikipedia.org/wiki/Prim%27s_algorithm>`__"

msgid "`Wikipedia: Kruskal's algorithm <https://en.wikipedia.org/wiki/Kruskal's_algorithm>`__"
msgstr "`Wikipedia: Kruskals algoritm <https://en.wikipedia.org/wiki/Kruskal's_algorithm>`__"

msgid "Indices and tables"
msgstr "Index och tabeller"

msgid ":ref:`genindex`"
msgstr ":ref:`genindex`"

msgid ":ref:`search`"
msgstr ":ref:`search`"

msgid "DFS - Category"
msgstr "DFS - Kategori"

msgid "Traversal using Depth First Search."
msgstr "Traversering med hjälp av första sökning på djupet."

msgid ":doc:`pgr_kruskalDFS`"
msgstr ":doc:`pgr_kruskalDFS`"

msgid ":doc:`pgr_primDFS`"
msgstr ":doc:`pgr_primDFS`"

msgid "Proposed"
msgstr "Föreslagen"

msgid "Proposed functions for next mayor release."
msgstr "Föreslagna funktioner för nästa version av Mayor."

msgid "They are not officially in the current release."
msgstr "De finns inte officiellt med i den aktuella versionen."

msgid "Code has been reviewed therefore is not experimental."
msgstr "Koden har granskats och är därför inte experimentell."

msgid "Name, signature and functionality might not change."
msgstr "Namn, signatur och funktionalitet kanske inte ändras."

msgid "pgTap tests have being done. But might need more."
msgstr "pgTap-tester har gjorts. Men det kan behövas fler."

msgid "Documentation might need refinement."
msgstr "Dokumentationen kan behöva förbättras."

msgid ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph."
msgstr ":doc:`pgr_depthFirstSearch` - Depth first search traversal of the graph."

msgid "In general:"
msgstr "I allmänhet:"

msgid "K shortest paths - Category"
msgstr "K kortaste vägarna - Kategori"

msgid ":doc:`pgr_KSP` - Yen's algorithm based on pgr_dijkstra"
msgstr ":doc:`pgr_KSP` - Yen's algorithm based on pgr_dijkstra"

msgid ":doc:`pgr_withPointsKSP` - Yen's algorithm based on pgr_withPoints"
msgstr ":doc:`pgr_withPointsKSP` - Yen's algorithm based on pgr_withPoints"

msgid "TRSP - Family of functions"
msgstr "TRSP - Familj av funktioner"

msgid "When points are also given as input:"
msgstr "När punkt också ges som input:"

msgid ":doc:`pgr_trsp` - Routing with restrictions."
msgstr ":doc:`pgr_trsp` - Routing with restrictions."

msgid ":doc:`pgr_trspVia` - Via Vertices routing with restrictions."
msgstr ":doc:`pgr_trspVia` - Via Vertices routing with restrictions."

msgid ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions."
msgstr ":doc:`pgr_trsp_withPoints` - Vertex/Point routing with restrictions."

msgid ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions."
msgstr ":doc:`pgr_trspVia_withPoints` - Via Vertex/point routing with restrictions."

msgid "Experimental"
msgstr "Experiment"

msgid "Experimental functions"
msgstr "Experimentella funktioner"

msgid "They are not officially of the current release."
msgstr "De är inte officiellt i den aktuella versionen."

msgid "They likely will not be officially be part of the next release:"
msgstr "De kommer troligen inte att officiellt vara en del av nästa utgåva:"

msgid "The functions might not make use of ANY-INTEGER and ANY-NUMERICAL"
msgstr "Funktionerna får inte använda sig av ANY-INTEGER och ANY-NUMERICAL"

msgid "Name might change."
msgstr "Namnet kan komma att ändras."

msgid "Signature might change."
msgstr "Signaturen kan komma att ändras."

msgid "Functionality might change."
msgstr "Funktionaliteten kan komma att ändras."

msgid "pgTap tests might be missing."
msgstr "pgTap-tester kan saknas."

msgid "Might need c/c++ review."
msgstr "Kan behöva c/c++ granskning."

msgid "Documentation if any might need to be rewritten."
msgstr "Eventuell dokumentation kan behöva skrivas om."

msgid "Might need a lot of feedback from the community."
msgstr "Det kan behövas mycket feedback från samhället."

msgid ":doc:`pgr_turnRestrictedPath` - Routing with restrictions."
msgstr ":doc:`pgr_turnRestrictedPath` - Routing with restrictions."

msgid "Introduction"
msgstr "Introduktion"

msgid "Road restrictions are a sequence of road segments that can not be taken in a sequential manner. Some restrictions are implicit on a directed graph, for example, one way roads where the wrong way edge is not even inserted on the graph. But normally on turns like no left turn or no right turn, hence the name turn restrictions, there are sometimes restrictions."
msgstr "Vägrestriktioner är en sekvens av vägsegment som inte kan tas i en följd. Vissa restriktioner är implicita i en riktad graf, t.ex. enkelriktade vägar där kanten för fel väg inte ens är inlagd i grafen. Men normalt finns det ibland restriktioner vid svängar, t.ex. ingen vänstersväng eller högersväng, därav namnet svängrestriktioner."

msgid "TRSP algorithm"
msgstr "TRSP-algoritm"

msgid "The internal TRSP algorithm performs a lookahead over the dijkstra algorithm in order to find out if the attempted path has a restriction. This allows the algorithm to pass twice on the same vertex."
msgstr "Den interna TRSP-algoritmen utför en lookahead över dijkstra-algoritmen för att ta reda på om den sökta sökvägen har en restriktion. Detta gör att algoritmen kan passera två gånger på samma vertex."

msgid "`Edges SQL`_ query as described."
msgstr "`Kanter SQL`_-fråga enligt beskrivningen."

msgid "`Restrictions SQL`_"
msgstr "`Begränsningar SQL`_"

msgid "`Restrictions SQL`_ query as described."
msgstr "`Begränsningar SQL`_-fråga enligt beskrivningen."

msgid "**via vertices**"
msgstr "**via hörnpunkter**"

msgid "``ARRAY[`` **ANY-INTEGER** ``]``"
msgstr "``ARRAY[`` **ANY-TAL** ``]```"

msgid "Array of ordered vertices identifiers that are going to be visited."
msgstr "Array av ordnade toppunktsidentifierare som kommer att besökas."

msgid "Restrictions"
msgstr "Begränsningar"

msgid "On road networks, there are restrictions such as left or right turn restrictions, no U turn restrictions."
msgstr "På vägnätet finns det begränsningar, till exempel begränsningar för vänster- eller högersväng, inga begränsningar för U-sväng."

msgid "A restriction is a sequence of edges, called path and that path is to be avoided."
msgstr "En restriktion är en sekvens av kanter, som kallas väg, och den vägen ska undvikas."

msgid "**Restrictions on the road network**"
msgstr "**Begränsningar av vägnätet**"

msgid "These restrictions are represented on a table as follows:"
msgstr "Dessa begränsningar visas i en tabell enligt följande:"

msgid "The table has an identifier, which maybe is needed for the administration of the restrictions, but the algorithms do not need that information. If given it will be ignored."
msgstr "Tabellen har en identifierare, som kanske behövs för administrationen av restriktionerna, men algoritmerna behöver inte den informationen. Om den ges kommer den att ignoreras."

msgid "Restrictions SQL"
msgstr "Begränsningar SQL"

msgid "``path``"
msgstr "``path``"

msgid "``ARRAY`` [**ANY-INTEGER**]"
msgstr "``ARRAY`` [**ANY-INTEGER**]"

msgid "Sequence of edge identifiers that form a path that is not allowed to be taken. - Empty arrays or ``NULL`` arrays are ignored. - Arrays that have a ``NULL`` element will raise an exception."
msgstr "Sekvens av kantidentifierare som bildar en väg som inte är tillåten att ta. - Tomma arrayer eller ``NULL`` arrayer ignoreras. - Arrayer som har ett ``NULL``-element kommer att ge upphov till ett undantag."

msgid "``Cost``"
msgstr "``Cost``"

msgid "Cost of taking the forbidden path."
msgstr "Kostnaden för att gå den förbjudna vägen."

msgid "Traveling Sales Person - Family of functions"
msgstr "Resande säljare - Familj av funktioner"

msgid ":doc:`pgr_TSP` - When input is given as matrix cell information."
msgstr ":doc:`pgr_TSP` - When input is given as matrix cell information."

msgid ":doc:`pgr_TSPeuclidean` - When input are coordinates."
msgstr ":doc:`pgr_TSPeuclidean` - When input are coordinates."

msgid "Table of Contents"
msgstr "Innehåll"

msgid "General Information"
msgstr "Allmän information"

msgid "Problem Definition"
msgstr "Definition av problem"

msgid "The travelling salesperson problem (TSP) asks the following question:"
msgstr "Problemet med den resande försäljaren (TSP) ställer följande fråga:"

msgid "*Given a list of cities and the distances between each pair of cities, which is the shortest possible route that visits each city exactly once and returns to the origin city?*"
msgstr "*Givet en lista över städer och avstånden mellan varje par av städer, vilken är den kortaste möjliga rutten som besöker varje stad exakt en gång och återvänder till ursprungsstaden?*"

msgid "Origin"
msgstr "Ursprung"

msgid "The traveling sales person problem was studied in the 18th century by mathematicians **Sir William Rowam Hamilton** and **Thomas Penyngton Kirkman**."
msgstr "Problemet med den resande försäljaren studerades på 1700-talet av matematikerna **Sir William Rowam Hamilton** och **Thomas Penyngton Kirkman**."

msgid "A discussion about the work of Hamilton & Kirkman can be found in the book **Graph Theory (Biggs et al. 1976)**."
msgstr "En diskussion om Hamilton & Kirkmans arbete finns i boken **Graph Theory (Biggs et al. 1976)**."

msgid "ISBN-13: 978-0198539162"
msgstr "ISBN-13: 978-0198539162"

msgid "ISBN-10: 0198539169"
msgstr "ISBN-10: 0198539169"

msgid "It is believed that the general form of the TSP have been first studied by Kalr Menger in Vienna and Harvard. The problem was later promoted by Hassler, Whitney & Merrill at Princeton. A detailed description about the connection between Menger & Whitney, and the development of the TSP can be found in `On the history of combinatorial optimization (till 1960) <https://homepages.cwi.nl/~lex/files/histco.ps>`__"
msgstr "Man tror att den allmänna formen av TSP först studerades av Kalr Menger i Wien och Harvard. Problemet togs senare vidare av Hassler, Whitney & Merrill vid Princeton. En detaljerad beskrivning av sambandet mellan Menger & Whitney och utvecklingen av TSP finns i `On the history of combinatorial optimization (till 1960) <https://homepages.cwi.nl/~lex/files/histco.ps>`__"

msgid "To calculate the number of different tours through :math:`n` cities:"
msgstr "För att beräkna antalet olika turer genom :math:`n` städer:"

msgid "Given a starting city,"
msgstr "Med tanke på en startstad,"

msgid "There are :math:`n-1` choices for the second city,"
msgstr "Det finns :math:`n-1` val för den andra staden,"

msgid "And :math:`n-2` choices for the third city, etc."
msgstr "Och :math:`n-2` val för den tredje staden, etc."

msgid "Multiplying these together we get :math:`(n-1)! = (n-1) (n-2) . . 1`."
msgstr "Multiplicerar vi dessa tillsammans får vi :math:`(n-1)! = (n-1) (n-2) . . 1`."

msgid "Now since the travel costs do not depend on the direction taken around the tour:"
msgstr "Nu när resekostnaderna inte beror på vilken riktning som tas runt turen:"

msgid "this number by 2"
msgstr "detta tal med 2"

msgid ":math:`(n-1)!/2`."
msgstr ":math:`(n-1)!/2`."

msgid "Characteristics"
msgstr "Egenskaper"

msgid "This problem is an NP-hard optimization problem."
msgstr "Detta problem är ett NP-svårt optimeringsproblem."

msgid "Metric Algorithm is used"
msgstr "Metrisk algoritm används"

msgid "Implementation generates solutions that *are twice as long as the optimal tour in the worst case*:"
msgstr "Implementeringen genererar lösningar som *är dubbelt så långa som den optimala turen i värsta fall*:"

msgid "Graph characteristics for best performance:"
msgstr "Grafiska egenskaper för bästa prestanda:"

msgid "Graph is undirected"
msgstr "Grafen är ostyrd"

msgid "Graph is fully connected"
msgstr "Grafen är helt sammanhängande"

msgid "Graph where traveling costs on edges obey the triangle inequality."
msgstr "Graf där resekostnader på kanter följer triangelolikheten."

msgid "The traveling costs are symmetric:"
msgstr "Resekostnaderna är symmetriska:"

msgid "Traveling costs from ``u`` to ``v`` are just as much as traveling from ``v`` to ``u``"
msgstr "Resekostnaderna från ``u`` till ``v`` är lika mycket som att resa från ``v`` till ``u``"

msgid "TSP optional parameters"
msgstr "TSP valfria parametrar"

msgid "``start_id``"
msgstr "``start_id``"

msgid "``0``"
msgstr "``0``"

msgid "The first visiting vertex"
msgstr "Det första besökande toppunktet"

msgid "When `0` any vertex can become the first visiting vertex."
msgstr "När `0` kan vilken toppunkt som helst bli den första besökande toppunkten."

msgid "``end_id``"
msgstr "``end_id``"

msgid "Last visiting vertex before returning to ``start_vid``."
msgstr "Sista besökande toppunkt innan återgång till ``start_vid``."

msgid "When ``0`` any vertex can become the last visiting vertex before returning to ``start_id``."
msgstr "När ``0`` kan vilken topp som helst bli den sista besökande toppen innan den återvänder till ``start_id``."

msgid "When ``NOT 0`` and ``start_id = 0`` then it is the first and last vertex"
msgstr "När ``NOT 0`` och ``start_id = 0`` är det den första och sista toppunkten"

msgid "References"
msgstr "Referenser"

msgid "`Boost: metric TSP approx <https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"
msgstr "`Boost: metrisk TSP ca <https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"

msgid "`University of Waterloo TSP <https://www.math.uwaterloo.ca/tsp/>`__"
msgstr "universitetet i Waterloo TSP <https://www.math.uwaterloo.ca/tsp/>`__"

msgid "`Wikipedia: Traveling Salesman Problem <https://en.wikipedia.org/wiki/Traveling_salesman_problem>`__"
msgstr "`Wikipedia: Problemet med den resande försäljaren <https://en.wikipedia.org/wiki/Traveling_salesman_problem>`__"

msgid "Vehicle Routing Functions - Category"
msgstr "Funktioner för fordonsdirigering - Kategori"

msgid "Pickup and delivery problem"
msgstr "Problem med upphämtning och leverans"

msgid ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix"
msgstr ":doc:`pgr_pickDeliver` - Pickup & Delivery using a Cost Matrix"

msgid ":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances"
msgstr ":doc:`pgr_pickDeliverEuclidean` - Pickup & Delivery with Euclidean distances"

msgid "Distribution problem"
msgstr "Distributionsproblem"

msgid ":doc:`pgr_vrpOneDepot` - From a single depot, distributes orders"
msgstr ":doc:`pgr_vrpOneDepot` - From a single depot, distributes orders"

msgid "Contents"
msgstr "Innehåll"

msgid "Vehicle Routing Problems `VRP` are **NP-hard** optimization problem, it generalises the travelling salesman problem (TSP)."
msgstr "Vehicle Routing Problems `VRP` är **NP-hårda** optimeringsproblem och är en generalisering av Travelling Salesman Problem (TSP)."

msgid "The objective of the VRP is to minimize the total route cost."
msgstr "VRP:s mål är att minimera den totala ruttkostnaden."

msgid "There are several variants of the VRP problem,"
msgstr "Det finns flera varianter av VRP-problemet,"

msgid "**pgRouting does not try to implement all variants.**"
msgstr "**pgRouting försöker inte implementera alla varianter.**"

msgid "Capacitated Vehicle Routing Problem `CVRP` where The vehicles have limited carrying capacity of the goods."
msgstr "Capacitated Vehicle Routing Problem `CVRP` där fordonen har begränsad lastkapacitet för godset."

msgid "Vehicle Routing Problem with Time Windows `VRPTW` where the locations have time windows within which the vehicle's visits must be made."
msgstr "Vehicle Routing Problem with Time Windows `VRPTW` där platserna har tidsfönster inom vilka fordonets besök måste göras."

msgid "Vehicle Routing Problem with Pickup and Delivery `VRPPD` where a number of goods need to be moved from certain pickup locations to other delivery locations."
msgstr "Vehicle Routing Problem with Pickup and Delivery `VRPPD` där ett antal varor måste flyttas från vissa upphämtningsplatser till andra leveransplatser."

msgid "Limitations"
msgstr "Begränsningar"

msgid "No multiple time windows for a location."
msgstr "Inga flera tidsfönster för en plats."

msgid "Less vehicle used is considered better."
msgstr "Mindre fordon som används anses vara bättre."

msgid "Less total duration is better."
msgstr "Kortare total varaktighet är bättre."

msgid "Less wait time is better."
msgstr "Kortare väntetid är bättre."

msgid "Pick & Delivery"
msgstr "Pick & Delivery"

msgid "Problem: `CVRPPDTW` Capacitated Pick and Delivery Vehicle Routing problem with Time Windows"
msgstr "Problem: `CVRPPDTW` Kapaciterade plock- och leveransfordons ruttproblem med tidsfönster"

msgid "Times are relative to `0`"
msgstr "Tiden är relativ till `0`"

msgid "The vehicles"
msgstr "Fordonen"

msgid "have start and ending service duration times."
msgstr "har start- och sluttider för tjänstens varaktighet."

msgid "have opening and closing times for the start and ending locations."
msgstr "ha öppnings- och stängningstider för start- och slutplatserna."

msgid "have a capacity."
msgstr "har en kapacitet."

msgid "The orders"
msgstr "Beställningarna"

msgid "Have pick up and delivery locations."
msgstr "Har upphämtnings- och leveransplatser."

msgid "Have opening and closing times for the pickup and delivery locations."
msgstr "Ha öppet- och stängningstider för upphämtnings- och leveransplatserna."

msgid "Have pickup and delivery duration service times."
msgstr "Har servicetider för upphämtning och leveranstid."

msgid "have a demand request for moving goods from the pickup location to the delivery location."
msgstr "har en begäran om att få flytta varor från upphämtningsplatsen till leveransplatsen."

msgid "Time based calculations:"
msgstr "Tidsbaserade beräkningar:"

msgid "Travel time between customers is :math:`distance / speed`"
msgstr "Restiden mellan kunder är :math:`avstånd / hastighet`"

msgid "Pickup and delivery order pair is done by the same vehicle."
msgstr "Hämtning och leverans av orderparet sker med samma fordon."

msgid "A pickup is done before the delivery."
msgstr "En upphämtning görs före leveransen."

msgid "Pick & deliver"
msgstr "Hämta och leverera"

msgid "Used in :doc:`pgr_pickDeliverEuclidean`"
msgstr "Används i :doc:`pgr_pickDeliverEuclidean`"

msgid "`Orders SQL`_"
msgstr "`beställningar SQL`_"

msgid "`Orders SQL`_ as described below."
msgstr "`beställningar SQL`_ enligt beskrivningen nedan."

msgid "`Vehicles SQL`_"
msgstr "`Fordon SQL`_"

msgid "`Vehicles SQL`_ as described below."
msgstr "`Fordon SQL`_ enligt beskrivningen nedan."

msgid "Used in :doc:`pgr_pickDeliver`"
msgstr "Används i :doc:`pgr_pickDeliver`"

msgid "`Matrix SQL`_"
msgstr "`Matrix SQL`_"

msgid "`Matrix SQL`_ as described below."
msgstr "`Matrix SQL`_ enligt beskrivningen nedan."

msgid "Pick-Deliver optional parameters"
msgstr "Pick-Deliver valfria parametrar"

msgid "``factor``"
msgstr "``factor``"

msgid "``NUMERIC``"
msgstr "``NUMERIC``"

msgid "1"
msgstr "1"

msgid "Travel time multiplier. See :ref:`pd_factor`"
msgstr "Multiplikator för restid. Se :ref:`pd_factor`"

msgid "``max_cycles``"
msgstr "``max_cycles``"

msgid "``INTEGER``"
msgstr "``INTEGER``"

msgid "10"
msgstr "10"

msgid "Maximum number of cycles to perform on the optimization."
msgstr "Maximalt antal cykler som ska utföras på optimeringen."

msgid "``initial_sol``"
msgstr "``initial_sol``"

msgid "4"
msgstr "4"

msgid "Initial solution to be used."
msgstr "Initial lösning som ska användas."

msgid "``1`` One order per truck"
msgstr "``1`` En order per lastbil"

msgid "``2`` Push front order."
msgstr "``2`` Tryck på främre order."

msgid "``3`` Push back order."
msgstr "``3`` Tryck tillbaka order."

msgid "``4`` Optimize insert."
msgstr "``4`` Optimera insättning."

msgid "``5`` Push back order that allows more orders to be inserted at the back"
msgstr "``5`` Push back-order som gör det möjligt att lägga in fler order på baksidan"

msgid "``6`` Push front order that allows more orders to be inserted at the front"
msgstr "``6`` Push front order som gör det möjligt att lägga in fler order längst fram"

msgid "Orders SQL"
msgstr "`beställningar SQL`_"

msgid "Common columns for the orders SQL in both implementations:"
msgstr "Gemensamma kolumner för order SQL i båda implementationerna:"

msgid "|ANY-INTEGER|"
msgstr "|ANY-INTEGER|"

msgid "Identifier of the pick-delivery order pair."
msgstr "Identifierare för orderparet plockning-leverans."

msgid "``demand``"
msgstr "``demand``"

msgid "|ANY-NUMERICAL|"
msgstr "|ANY-NUMERICAL|"

msgid "Number of units in the order"
msgstr "Antal enheter i ordern"

msgid "``p_open``"
msgstr "``p_open``"

msgid "The time, relative to 0, when the pickup location opens."
msgstr "Tidpunkten, relativt till 0, när upphämtningsplatsen öppnas."

msgid "``p_close``"
msgstr "``p_close``"

msgid "The time, relative to 0, when the pickup location closes."
msgstr "Tidpunkten, relativt till 0, när upphämtningsplatsen stängs."

msgid "[``p_service``]"
msgstr "[``p_service``]"

msgid "The duration of the loading at the pickup location."
msgstr "Varaktigheten av lastningen på upphämtningsplatsen."

msgid "When missing: 0 time units are used"
msgstr "När den saknas: 0 tidsenheter används"

msgid "``d_open``"
msgstr "``d_open``"

msgid "The time, relative to 0, when the delivery location opens."
msgstr "Tidpunkten, relativt till 0, när leveransplatsen öppnas."

msgid "``d_close``"
msgstr "``d_close``"

msgid "The time, relative to 0, when the delivery location closes."
msgstr "Tidpunkten, relativt till 0, när leveransplatsen stängs."

msgid "[``d_service``]"
msgstr "[``d_service``]"

msgid "The duration of the unloading at the delivery location."
msgstr "Varaktigheten av lossningen på leveransplatsen."

msgid "For :doc:`pgr_pickDeliver` the pickup and delivery identifiers of the locations are needed:"
msgstr "För :doc:`pgr_pickDeliver` behövs identifierarna för upphämtning och leverans av platserna:"

msgid "``p_node_id``"
msgstr "``p_node_id``"

msgid "The node identifier of the pickup, must match a vertex identifier in the `Matrix SQL`_."
msgstr "Pickupens nodidentifierare måste matcha en vertexidentifierare i `Matrix SQL`_."

msgid "``d_node_id``"
msgstr "``d_node_id``"

msgid "The node identifier of the delivery, must match a vertex identifier in the `Matrix SQL`_."
msgstr "Leveransens nodidentifierare måste matcha en vertexidentifierare i `Matrix SQL`_."

msgid "For :doc:`pgr_pickDeliverEuclidean` the :math:`(x, y)` values of the locations are needed:"
msgstr "För :doc:`pgr_pickDeliverEuclidean` behövs :math:`(x, y)`-värdena för platserna:"

msgid "``p_x``"
msgstr "``p_x``"

msgid ":math:`x` value of the pick up location"
msgstr ":math:`x` value of the pick up location"

msgid "``p_y``"
msgstr "``p_y``"

msgid ":math:`y` value of the pick up location"
msgstr ":math:`y` value of the pick up location"

msgid "``d_x``"
msgstr "``d_x``"

msgid ":math:`x` value of the delivery location"
msgstr ":math:`x` value of the delivery location"

msgid "``d_y``"
msgstr "``d_y``"

msgid ":math:`y` value of the delivery location"
msgstr ":math:`y` value of the delivery location"

msgid "Vehicles SQL"
msgstr "Fordon SQL"

msgid "Common columns for the vehicles SQL in both implementations:"
msgstr "Gemensamma kolumner för fordon SQL i båda implementationerna:"

msgid "Identifier of the vehicle."
msgstr "Identifierare av fordonet."

msgid "``capacity``"
msgstr "``capacity``"

msgid "Maiximum capacity units"
msgstr "Enheter med maximal kapacitet"

msgid "``start_open``"
msgstr "``start_open``"

msgid "The time, relative to 0, when the starting location opens."
msgstr "Tidpunkten, relativt 0, när startplatsen öppnas."

msgid "``start_close``"
msgstr "``start_close``"

msgid "The time, relative to 0, when the starting location closes."
msgstr "Tidpunkten, relativt 0, när startplatsen stängs."

msgid "[``start_service``]"
msgstr "[``start_service``]"

msgid "The duration of the loading at the starting location."
msgstr "Längden på lastningen vid startplatsen."

msgid "When missing: A duration of :math:`0` time units is used."
msgstr "När den saknas: En varaktighet på :math:`0` tidsenheter används."

msgid "[``end_open``]"
msgstr "[``end_open``]"

msgid "The time, relative to 0, when the ending location opens."
msgstr "Tidpunkten, relativt 0, då slutplatsen öppnas."

msgid "When missing: The value of ``start_open`` is used"
msgstr "När den saknas: Värdet på ``start_open`` används"

msgid "[``end_close``]"
msgstr "[``end_close``]"

msgid "The time, relative to 0, when the ending location closes."
msgstr "Tidpunkten, relativt till 0, när slutplatsen stängs."

msgid "When missing: The value of ``start_close`` is used"
msgstr "När den saknas: Värdet på ``start_close`` används"

msgid "[``end_service``]"
msgstr "[``end_service``]"

msgid "The duration of the loading at the ending location."
msgstr "Längden på lastningen vid slutplatsen."

msgid "When missing: A duration in ``start_service`` is used."
msgstr "När den saknas: En varaktighet i ``start_service`` används."

msgid "For :doc:`pgr_pickDeliver` the starting and ending identifiers of the locations are needed:"
msgstr "För :doc:`pgr_pickDeliver` behövs start- och slutidentifierare för platserna:"

msgid "``start_node_id``"
msgstr "``start_node_id``"

msgid "The node identifier of the start location, must match a vertex identifier in the `Matrix SQL`_."
msgstr "Startplatsens nodidentifierare måste matcha en vertexidentifierare i `Matrix SQL`_."

msgid "[``end_node_id``]"
msgstr "[``end_node_id``]"

msgid "The node identifier of the end location, must match a vertex identifier in the `Matrix SQL`_."
msgstr "Nodeidentifieraren för slutpositionen måste matcha en vertexidentifierare i `Matrix SQL`_."

msgid "When missing: ``end_node_id`` is used."
msgstr "När den saknas: ``end_node_id`` används."

msgid "``start_x``"
msgstr "``start_x``"

msgid ":math:`x` value of the starting location"
msgstr ":math:`x` value of the starting location"

msgid "``start_y``"
msgstr "``start_y``"

msgid ":math:`y` value of the starting location"
msgstr ":math:`y` value of the starting location"

msgid "[``end_x``]"
msgstr "[``end_x``]"

msgid ":math:`x` value of the ending location"
msgstr ":math:`x` value of the ending location"

msgid "When missing: ``start_x`` is used."
msgstr "När den saknas: ``start_x`` används."

msgid "[``end_y``]"
msgstr "[``end_y``]"

msgid ":math:`y` value of the ending location"
msgstr ":math:`y` value of the ending location"

msgid "When missing: ``start_y`` is used."
msgstr "När den saknas: ``start_y`` används."

msgid "Matrix SQL"
msgstr "Matrix SQL"

msgid "Set of |matrix-result|"
msgstr "Uppsättning av |matrix-result|"

msgid "Identifier of the starting vertex."
msgstr "Identifierare för startvertexen."

msgid "``end_vid``"
msgstr "``end_vid``"

msgid "Identifier of the ending vertex."
msgstr "Identifierare för det avslutande toppunktet."

msgid "Aggregate cost from ``start_vid`` to ``end_vid``."
msgstr "Sammanlagd kostnad från ``start_vid`` till ``slut_vid``."

msgid "Sequential value starting from **1**."
msgstr "Sekventiellt värde med början från **1**."

msgid "``vehicle_seq``"
msgstr "``vehicle_seq``"

msgid "Sequential value starting from **1** for current vehicles. The :math:`n_{th}` vehicle in the solution."
msgstr "Sekventiellt värde med början från **1** för aktuella fordon. Fordonet :math:`n_{th}` i lösningen."

msgid "Value :math:`-2` indicates it is the summary row."
msgstr "Värdet :math:`-2` anger att det är den sammanfattande raden."

msgid "``vehicle_id``"
msgstr "``vehicle_id``"

msgid "BIGINT"
msgstr "BIGINT"

msgid "Current vehicle identifier."
msgstr "Aktuell fordonsidentifiering."

msgid "Summary row has the **total capacity violations**."
msgstr "Sammanfattningsraden har **totala kapacitetsöverträdelser**."

msgid "A capacity violation happens when overloading or underloading a vehicle."
msgstr "En kapacitetsöverträdelse inträffar när ett fordon överlastas eller underlastas."

msgid "``stop_seq``"
msgstr "``stop_seq``"

msgid "INTEGER"
msgstr "INTEGER"

msgid "Sequential value starting from **1** for the stops made by the current vehicle. The :math:`m_{th}` stop of the current vehicle."
msgstr "Sekventiellt värde med början från **1** för de stopp som görs av det aktuella fordonet. Stoppet :math:`m_{th}` för det aktuella fordonet."

msgid "Summary row has the **total time windows violations**."
msgstr "Sammanfattning rad har **total tid fönster överträdelser**."

msgid "A time window violation happens when arriving after the location has closed."
msgstr "En överträdelse av tidsfönstret inträffar när man anländer efter att platsen har stängt."

msgid "``stop_type``"
msgstr "``stop_type``"

msgid "Kind of stop location the vehicle is at"
msgstr "Typ av stopplats som fordonet befinner sig på"

msgid ":math:`-1`: at the solution summary row"
msgstr ":math:`-1`: at the solution summary row"

msgid ":math:`1`: Starting location"
msgstr ":math:`1`: Starting location"

msgid ":math:`2`: Pickup location"
msgstr ":math:`2`: Pickup location"

msgid ":math:`3`: Delivery location"
msgstr ":math:`3`: Delivery location"

msgid ":math:`6`: Ending location and indicates the vehicle's summary row"
msgstr ":math:`6`: Ending location and indicates the vehicle's summary row"

msgid "``order_id``"
msgstr "``order_id``"

msgid "Pickup-Delivery order pair identifier."
msgstr "Identifierare för orderparet hämtning-leverans."

msgid "Value :math:`-1`: When no order is involved on the current stop location."
msgstr "Värde :math:`-1`: När ingen order är involverad på den aktuella stoppositionen."

msgid "``cargo``"
msgstr "``cargo``"

msgid "Cargo units of the vehicle when leaving the stop."
msgstr "Fordonets lastenheter när det lämnar hållplatsen."

msgid "Value :math:`-1` on solution summary row."
msgstr "Värde :math:`-1` på raden för lösningssammanfattning."

msgid "``travel_time``"
msgstr "``travel_time``"

msgid "Travel time from previous ``stop_seq`` to current ``stop_seq``."
msgstr "Restid från föregående ``stop_seq`` till aktuell ``stop_seq``."

msgid "Summary has the **total traveling time**:"
msgstr "Sammanfattning har **total restid**:"

msgid "The sum of all the ``travel_time``."
msgstr "Summan av alla ``travel_time``."

msgid "``arrival_time``"
msgstr "``arrival_time``"

msgid "Time spent waiting for current location to open."
msgstr "Tidsåtgång för att vänta på att den aktuella platsen ska öppnas."

msgid ":math:`-1`: at the solution summary row."
msgstr ":math:`-1`: at the solution summary row."

msgid ":math:`0`: at the starting location."
msgstr ":math:`0`: at the starting location."

msgid "``wait_time``"
msgstr "``wait_time``"

msgid "Summary row has the **total waiting time**:"
msgstr "Sammanfattning rad har **total väntetid**:"

msgid "The sum of all the ``wait_time``."
msgstr "Summan av alla ``wait_time``."

msgid "``service_time``"
msgstr "``service_time``"

msgid "Service duration at current location."
msgstr "Servicens varaktighet på den aktuella platsen."

msgid "Summary row has the **total service time**:"
msgstr "Sammanfattningsraden har **total servicetid**:"

msgid "The sum of all the ``service_time``."
msgstr "Summan av alla ``service_time``."

msgid "``departure_time``"
msgstr "``departure_time``"

msgid "The time at which the vehicle departs from the stop."
msgstr "Den tidpunkt då fordonet avgår från hållplatsen."

msgid ":math:`arrival\\_time + wait\\_time + service\\_time`."
msgstr ":math:`arrival\\_time + wait\\_time + service\\_time`."

msgid "The ending location has the **total time** used by the current vehicle."
msgstr "Slutplatsen har den **totala tid** som använts av det aktuella fordonet."

msgid "Summary row has the **total solution time**:"
msgstr "Sammanfattningsraden har den **totala lösningstiden**:"

msgid ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`."
msgstr ":math:`total\\ traveling\\ time + total\\ waiting\\ time + total\\ service\\ time`."

msgid "Summary Row"
msgstr "Sammanfattande rad"

msgid "Continues the sequence"
msgstr "Fortsätter sekvensen"

msgid "**total capacity violations**:"
msgstr "**överträdelser av total kapacitet**:"

msgid "**total time windows violations**:"
msgstr "**Totalt antal överträdelser av tidsfönster**:"

msgid ":math:`-1`"
msgstr ":math:`-1`"

msgid "**total traveling time**:"
msgstr "**total restid**:"

msgid "**total waiting time**:"
msgstr "**total väntetid**:"

msgid "**total service time**:"
msgstr "**total servicetid**:"

msgid "Handling Parameters"
msgstr "Parametrar för hantering"

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 "För att definiera ett problem måste flera överväganden göras för att få konsekventa resultat. Detta avsnitt ger en inblick i hur parametrar ska beaktas."

msgid "`Capacity and Demand Units Handling`_"
msgstr "`Hantering av kapacitets- och efterfrågeenheter`_"

msgid "`Locations`_"
msgstr "`Lokaliseringar`_"

msgid "`Time Handling`_"
msgstr "`Tidshantering`_"

msgid "`Factor Handling`_"
msgstr "`Faktorhantering`_"

msgid "Capacity and Demand Units Handling"
msgstr "Hantering av kapacitets- och efterfrågeenheter"

msgid "The `capacity` of a vehicle, can be measured in:"
msgstr "Ett fordons \"kapacitet\" kan mätas i:"

msgid "Volume units like :math:`m^3`."
msgstr "Volymenheter som :math:`m^3`."

msgid "Area units like :math:`m^2` (when no stacking is allowed)."
msgstr "Areaenheter som :math:`m^2` (när ingen stapling är tillåten)."

msgid "Weight units like :math:`kg`."
msgstr "Viktenheter som :math:`kg`."

msgid "Number of boxes that fit in the vehicle."
msgstr "Antal lådor som får plats i fordonet."

msgid "Number of seats in the vehicle"
msgstr "Antal sittplatser i fordonet"

msgid "The `demand` request of the pickup-deliver orders must use the same units as the units used in the vehicle's `capacity`."
msgstr "Begäran om hämtnings- och leveransorder måste använda samma enheter som de enheter som används i fordonets \"kapacitet\"."

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 "För att hantera problem som t.ex: 10 (lika stora) lådor med äpplen och 5 kg fjädrar som ska transporteras (inte packas i lådor)."

msgid "If the vehicle's **capacity** is measured in `boxes`, a conversion of `kg of feathers` to `number of boxes` is needed."
msgstr "Om fordonets **kapacitet** mäts i `lådor`, behövs en omvandling av `kg fjädrar` till `antal lådor`."

msgid "If the vehicle's **capacity** is measured in `kg`, a conversion of `box of apples` to `kg` is needed."
msgstr "Om fordonets **kapacitet** mäts i `kg`, krävs en omvandling av `låda äpplen` till `kg`."

msgid "Showing how the 2 possible conversions can be done"
msgstr "Visar hur de 2 möjliga konverteringarna kan göras"

msgid "Let: - :math:`f\\_boxes`: number of boxes needed for `1` kg of feathers. - :math:`a\\_weight`: weight of `1` box of apples."
msgstr "Låt: - :math:`f\\_boxes`: antal boxar som behövs för `1` kg fjädrar. - :math:`a\\_weight`: vikten på `1` låda med äpplen."

msgid "Capacity Units"
msgstr "Kapacitetsenheter"

msgid "apples"
msgstr "äpplen"

msgid "feathers"
msgstr "fjädrar"

msgid "boxes"
msgstr "lådor"

msgid ":math:`5 * f\\_boxes`"
msgstr ":math:`5 * f\\_boxes`"

msgid "kg"
msgstr "kg"

msgid ":math:`10 * a\\_weight`"
msgstr ":math:`10 * a\\_weight`"

msgid "5"
msgstr "5"

msgid "Locations"
msgstr "Platser"

msgid "When using :doc:`pgr_pickDeliverEuclidean`:"
msgstr "När du använder :doc:`pgr_pickDeliverEuclidean`:"

msgid "The vehicles have :math:`(x, y)` pairs for start and ending locations."
msgstr "Fordonen har :math:`(x, y)`-par för start- och slutplatser."

msgid "The orders Have :math:`(x, y)` pairs for pickup and delivery locations."
msgstr "Beställningarna har :math:`(x, y)`-par för upphämtnings- och leveransplatser."

msgid "When using :doc:`pgr_pickDeliver`:"
msgstr "När du använder :doc:`pgr_pickDeliver`:"

msgid "The vehicles have identifiers for the start and ending locations."
msgstr "Fordonen har identifierare för start- och slutplatserna."

msgid "The orders have identifiers for the pickup and delivery locations."
msgstr "Beställningarna har identifierare för upphämtnings- och leveransplatserna."

msgid "All the identifiers are indices to the given matrix."
msgstr "Alla identifierare är index till den givna matrisen."

msgid "Time Handling"
msgstr "Tidshantering"

msgid "The times are relative to **0**. All time units have to be converted to a **0** reference and the same time units."
msgstr "Tiderna är relativa till **0**. Alla tidsenheter måste konverteras till en referens på **0** och samma tidsenheter."

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 "Anta att en fordonsförare börjar sitt skift kl. 9.00 och slutar kl. 16.30 och att servicetiden är 10 minuter och 30 sekunder."

msgid "Meaning of 0"
msgstr "Betydelsen av 0"

msgid "time units"
msgstr "tidsenheter"

msgid "9:00 am"
msgstr "9:00"

msgid "4:30 pm"
msgstr "16:30"

msgid "10 min 30 secs"
msgstr "10 min 30 sek"

msgid "0:00 am"
msgstr "0:00 am"

msgid "hours"
msgstr "timmar"

msgid "9"
msgstr "9"

msgid "16.5"
msgstr "16.5"

msgid ":math:`10.5 / 60 = 0.175`"
msgstr ":math:`10.5 / 60 = 0.175`"

msgid "minutes"
msgstr "minuter"

msgid ":math:`9*60 = 54`"
msgstr ":math:`9*60 = 54`"

msgid ":math:`16.5*60 = 990`"
msgstr ":math:`16.5*60 = 990`"

msgid "10.5"
msgstr "10.5"

msgid "0"
msgstr "0"

msgid "7.5"
msgstr "7.5"

msgid ":math:`7.5*60 = 540`"
msgstr ":math:`7.5*60 = 540`"

msgid "Factor handling"
msgstr "Faktorhantering"

msgid "``factor`` acts as a multiplier to convert from distance values to time units the matrix values or the euclidean values."
msgstr "``factor`` fungerar som en multiplikator för att konvertera matrisvärden eller euklidiska värden från avståndsvärden till tidsenheter."

msgid "When the values are already in the desired time units"
msgstr "När värdena redan är i önskad tidsenhet"

msgid "``factor`` should be **1**"
msgstr "``factor`` bör vara **1**"

msgid "When ``factor`` > 1 the travel times are faster"
msgstr "När ``faktor`` > 1 är restiderna snabbare"

msgid "When ``factor`` < 1 the travel times are slower"
msgstr "När ``faktor`` < 1 är restiderna långsammare"

msgid "For the :doc:`pgr_pickDeliverEuclidean`:"
msgstr "För :doc:`pgr_pickDeliverEuclidean`:"

msgid "Working with time units in seconds, and x/y in lat/lon: Factor: would depend on the location of the points and on the average velocity say 25m/s is the velocity."
msgstr "Arbeta med tidsenheter i sekunder och x/y i lat/lon: Faktor: skulle bero på punkternas läge och på medelhastigheten, säg att 25 m/s är hastigheten."

msgid "Latitude"
msgstr "Latitud"

msgid "Conversion"
msgstr "Konvertering"

msgid "Factor"
msgstr "Faktor"

msgid "45"
msgstr "45"

msgid "1 longitude degree is (78846.81m)/(25m/s)"
msgstr "1 longitudgrad är (78846,81m)/(25m/s)"

msgid "3153 s"
msgstr "3153 s"

msgid "1 longitude degree is (111319.46 m)/(25m/s)"
msgstr "1 longitudgrad är (111319,46 m)/(25m/s)"

msgid "4452 s"
msgstr "4452 s"

msgid "For the :doc:`pgr_pickDeliver`:"
msgstr "För :doc:`pgr_pickDeliver`:"

msgid "Given :math:`v = d / t` therefore :math:`t = d / v` And the ``factor`` becomes :math:`1 / v`"
msgstr "Med tanke på :math:`v = d / t` därför :math:`t = d / v` Och ``faktorn`` blir :math:`1 / v`"

msgid "v"
msgstr "v"

msgid "Velocity"
msgstr "Hastighet"

msgid "d"
msgstr "d"

msgid "Distance"
msgstr "Avstånd"

msgid "t"
msgstr "t"

msgid "Time"
msgstr "Tid"

msgid "For the following equivalences :math:`10m/s \\approx 600m/min \\approx 36 km/hr`"
msgstr "För följande ekvivalenser :math:`10m/s \\approx 600m/min \\approx 36 km/tim`"

msgid "Working with time units in seconds and the matrix been in meters: For a 1000m length value on the matrix:"
msgstr "Arbeta med tidsenheter i sekunder och matrisen i meter: För ett 1000m längdvärde på matrisen:"

msgid "Units"
msgstr "Enheter"

msgid "velocity"
msgstr "hastighet"

msgid "Result"
msgstr "Resultat"

msgid "seconds"
msgstr "sekunder"

msgid ":math:`10 m/s`"
msgstr ":math:`10 m/s`"

msgid ":math:`\\frac{1}{10m/s}`"
msgstr ":math:`\\frac{1}{10m/s}`"

msgid ":math:`0.1s/m`"
msgstr ":math:`0.1s/m`"

msgid ":math:`1000m * 0.1s/m = 100s`"
msgstr ":math:`1000m * 0.1s/m = 100s`"

msgid ":math:`600 m/min`"
msgstr ":math:`600 m/min`"

msgid ":math:`\\frac{1}{600m/min}`"
msgstr ":math:`\\frac{1}{600m/min}`"

msgid ":math:`0.0016min/m`"
msgstr ":math:`0.0016min/m`"

msgid ":math:`1000m * 0.0016min/m = 1.6min`"
msgstr ":math:`1000m * 0.0016min/m = 1.6min`"

msgid "Hours"
msgstr "Timmar"

msgid ":math:`36 km/hr`"
msgstr ":math:`36 km/hr`"

msgid ":math:`\\frac{1}{36 km/hr}`"
msgstr ":math:`\\frac{1}{36 km/hr}`"

msgid ":math:`0.0277hr/km`"
msgstr ":math:`0.0277hr/km`"

msgid ":math:`1km * 0.0277hr/km = 0.0277hr`"
msgstr ":math:`1km * 0.0277hr/km = 0.0277hr`"

msgid "https://en.wikipedia.org/wiki/Vehicle_routing_problem"
msgstr "https://en.wikipedia.org/wiki/Vehicle_routing_problem"

msgid ":doc:`sampledata`"
msgstr ":doc:`sampledata`"

msgid "A* - Family of functions"
msgstr "A* - Familj av funktioner"

msgid "The A* (pronounced \"A Star\") algorithm is based on Dijkstra's algorithm with a heuristic that allow it to solve most shortest path problems by evaluation only a sub-set of the overall graph."
msgstr "Algoritmen A* (uttalas \"A Star\") är baserad på Dijkstras algoritm med en heuristik som gör att den kan lösa de flesta problem med kortaste vägen genom att endast utvärdera en delmängd av den totala grafen."

msgid ":doc:`pgr_aStar` - A* algorithm for the shortest path."
msgstr ":doc:`pgr_aStar` - A* algorithm for the shortest path."

msgid ":doc:`pgr_aStarCost` - Get the aggregate cost of the shortest paths."
msgstr ":doc:`pgr_aStarCost` - Get the aggregate cost of the shortest paths."

msgid ":doc:`pgr_aStarCostMatrix` - Get the cost matrix of the shortest paths."
msgstr ":doc:`pgr_aStarCostMatrix` - Get the cost matrix of the shortest paths."

msgid "The main Characteristics are:"
msgstr "De viktigaste egenskaperna är:"

msgid "Process works for directed and undirected graphs."
msgstr "Processen fungerar för riktade och oriktade grafer."

msgid "Ordering is:"
msgstr "Beställning är:"

msgid "first by ``start_vid`` (if exists)"
msgstr "först av ``start_vid`` (om sådan finns)"

msgid "then by ``end_vid``"
msgstr "sedan genom ``slut_vid``"

msgid "Values are returned when there is a path."
msgstr "Värden returneras när det finns en sökväg."

msgid "Let :math:`v` and :math:`u` be nodes on the graph:"
msgstr "Låt :math:`v` och :math:`u` vara noder i grafen:"

msgid "If there is no path from :math:`v` to :math:`u`:"
msgstr "Om det inte finns någon sökväg från :math:`v` till :math:`u`:"

msgid "no corresponding row is returned"
msgstr "ingen motsvarande rad returneras"

msgid "``agg_cost`` from :math:`v` to :math:`u` is :math:`\\infty`"
msgstr "``agg_cost`` från :math:`v` till :math:`u` är :math:``infty``"

msgid "There is no path when :math:`v = u` therefore"
msgstr "Det finns ingen väg när :math:`v = u` därför"

msgid "``agg_cost`` from `v` to `u` is :math:`0`"
msgstr "``agg_cost`` från `v` till `u`` är :math:`0``"

msgid "When :math:`(x,y)` coordinates for the same vertex identifier differ:"
msgstr "När :math:`(x,y)`-koordinaterna för samma toppunktsidentifierare skiljer sig åt:"

msgid "A random selection of the vertex's :math:`(x,y)` coordinates is used."
msgstr "Ett slumpmässigt urval av toppunktens :math:`(x,y)`-koordinater används."

msgid "Running time: :math:`O((E + V) * \\log V)`"
msgstr "Drifttid: :math:`O((E + V) * \\log V)`"

msgid "aStar optional parameters"
msgstr "aStar valfria parametrar"

msgid "``heuristic``"
msgstr "``heuristic``"

msgid "Heuristic number. Current valid values 0~5."
msgstr "Heuristiskt nummer. Aktuella giltiga värden 0~5."

msgid "0: :math:`h(v) = 0` (Use this value to compare with pgr_dijkstra)"
msgstr "0: :math:`h(v) = 0` (Använd detta värde för att jämföra med pgr_dijkstra)"

msgid "1: :math:`h(v) = abs(max(\\Delta x, \\Delta y))`"
msgstr "1: :math:`h(v) = abs(max(\\Delta x, \\Delta y))`"

msgid "2: :math:`h(v) = abs(min(\\Delta x, \\Delta y))`"
msgstr "2: :math:`h(v) = abs(min(\\Delta x, \\Delta y))`"

msgid "3: :math:`h(v) = \\Delta x * \\Delta x + \\Delta y * \\Delta y`"
msgstr "3: :math:`h(v) = \\Delta x * \\Delta x + \\Delta y * \\Delta y`"

msgid "4: :math:`h(v) = sqrt(\\Delta x * \\Delta x + \\Delta y * \\Delta y)`"
msgstr "4: :math:`h(v) = sqrt(\\Delta x * \\Delta x + \\Delta y * \\Delta y)`"

msgid "5: :math:`h(v) = abs(\\Delta x) + abs(\\Delta y)`"
msgstr "5: :math:`h(v) = abs(\\Delta x) + abs(\\Delta y)`"

msgid "``1``"
msgstr "``1``"

msgid "For units manipulation. :math:`factor > 0`."
msgstr "För manipulering av enheter. :math:`factor > 0`."

msgid "``epsilon``"
msgstr "``epsilon``"

msgid "For less restricted results. :math:`epsilon >= 1`."
msgstr "För mindre begränsade resultat. :math:`epsilon >= 1`."

msgid "See :ref:`heuristics <astar_heuristics>` available and :ref:`factor <astar_factor>` handling."
msgstr "Se :ref:`heuristics <astar_heuristics>` tillgänglig och :ref:`factor <astar_factor>` hantering."

msgid "Advanced documentation"
msgstr "Avancerad dokumentation"

msgid "Heuristic"
msgstr "Heuristisk"

msgid "Currently the heuristic functions available are:"
msgstr "För närvarande är de tillgängliga heuristiska funktionerna:"

msgid "where :math:`\\Delta x = x_1 - x_0` and :math:`\\Delta y = y_1 - y_0`"
msgstr "där :math:`\\Delta x = x_1 - x_0` och :math:`\\Delta y = y_1 - y_0`"

msgid "Analysis 1"
msgstr "Analys 1"

msgid "Working with cost/reverse_cost as length in degrees, x/y in lat/lon: Factor = 1 (no need to change units)"
msgstr "Arbetar med kostnad/omvänd_kostnad som längd i grader, x/y i lat/lon: Faktor = 1 (inget behov av att ändra enheter)"

msgid "Analysis 2"
msgstr "Analys 2"

msgid "Working with cost/reverse_cost as length in meters, x/y in lat/lon: Factor = would depend on the location of the points:"
msgstr "Arbetar med kostnad/omvänd_kostnad som längd i meter, x/y i lat/lon: Faktor = skulle bero på punkternas läge:"

msgid "1 longitude degree is 78846.81 m"
msgstr "1 longitudgrad är 78846,81 m"

msgid "78846"
msgstr "78846"

msgid "1 longitude degree is 111319.46 m"
msgstr "1 longitudgrad är 111319,46 m"

msgid "111319"
msgstr "111319"

msgid "Analysis 3"
msgstr "Analys 3"

msgid "Working with cost/reverse_cost as time in seconds, x/y in lat/lon: Factor: would depend on the location of the points and on the average speed say 25m/s is the speed."
msgstr "Arbetar med kostnad/omvänd_kostnad som tid i sekunder, x/y i lat/lon: Faktor: skulle bero på punkternas läge och på medelhastigheten, säg att 25 m/s är hastigheten."

msgid ":doc:`bdAstar-family`"
msgstr ":doc:`bdAstar-family`"

msgid "`Boost: A* search <https://www.boost.org/libs/graph/doc/astar_search.html>`__"
msgstr "`Boost: A*-sökning <https://www.boost.org/libs/graph/doc/astar_search.html>`__"

msgid "https://en.wikipedia.org/wiki/A*_search_algorithm"
msgstr "https://en.wikipedia.org/wiki/A*_search_algorithm"

msgid "All Pairs - Family of Functions"
msgstr "Alla par - Familj av funktioner"

msgid "The following functions work on all vertices pair combinations"
msgstr "Följande funktioner fungerar på alla kombinationer av toppar och par"

msgid ":doc:`pgr_floydWarshall` - Floyd-Warshall's algorithm."
msgstr ":doc:`pgr_floydWarshall` - Floyd-Warshall's algorithm."

msgid ":doc:`pgr_johnson` - Johnson's algorithm"
msgstr ":doc:`pgr_johnson` - Johnson's algorithm"

msgid "The main characteristics are:"
msgstr "De viktigaste egenskaperna är:"

msgid "It does not return a path."
msgstr "Den returnerar inte någon sökväg."

msgid "Returns the sum of the costs of the shortest path for each pair of nodes in the graph."
msgstr "Returnerar summan av kostnaderna för den kortaste vägen för varje par av noder i grafen."

msgid "Boost returns a :math:`V \\times V` matrix, where the infinity values. Represent the distance between vertices for which there is no path."
msgstr "Boost returnerar en :math:`V \\times V`-matris, där oändlighetsvärdena. Representerar avståndet mellan hörnpunkter för vilka det inte finns någon väg."

msgid "We return only the non infinity values in form of a set of `(start_vid, end_vid, agg_cost)`."
msgstr "Vi returnerar endast de värden som inte är oändliga i form av en uppsättning `(start_vid, end_vid, agg_cost)`."

msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`."
msgstr "Låt oss anta att de värden som returneras lagras i en tabell, så det unika indexet skulle vara paret: `(start_vid, end_vid)`."

msgid "For the undirected graph, the results are symmetric."
msgstr "För den oriktade grafen är resultaten symmetriska."

msgid "The `agg_cost` of `(u, v)` is the same as for `(v, u)`."
msgstr "Agg_cost för `(u, v)` är samma som för `(v, u)`."

msgid "When `start_vid` = `end_vid`, the `agg_cost` = 0."
msgstr "När `start_vid` = `slut_vid` är `agg_cost` = 0."

msgid "**Recommended, use a bounding box of no more than 3500 edges.**"
msgstr "**Rekommendation: använd en avgränsande box med högst 3500 kanter**"

msgid "Optional parameters"
msgstr "Valfria parametrar"

msgid "``directed``"
msgstr "``directed``"

msgid "``BOOLEAN``"
msgstr "``BOOLEAN``"

msgid "``true``"
msgstr "``true``"

msgid "When ``true`` the graph is considered `Directed`"
msgstr "När ``true`` anses grafen vara `Directed``"

msgid "When ``false`` the graph is considered as `Undirected`."
msgstr "När den är ``falsk`` betraktas grafen som `Ondirected``."

msgid "Performance"
msgstr "Prestanda"

msgid "The following tests:"
msgstr "Följande tester:"

msgid "non server computer"
msgstr "dator som inte är en server"

msgid "with AMD 64 CPU"
msgstr "med AMD 64 CPU"

msgid "4G memory"
msgstr "4G-minne"

msgid "trusty"
msgstr "pålitlig"

msgid "PostgreSQL version 9.3"
msgstr "PostgreSQL version 9.3"

msgid "Data"
msgstr "Data"

msgid "The following data was used"
msgstr "Följande uppgifter användes"

msgid "Data processing was done with osm2pgrouting-alpha"
msgstr "Databehandling gjordes med osm2pgrouting-alpha"

msgid "Results"
msgstr "Resultat"

msgid "Test"
msgstr "Test"

msgid "One"
msgstr "En"

msgid "This test is not with a bounding box The density of the passed graph is extremely low. For each <SIZE> 30 tests were executed to get the average The tested query is:"
msgstr "Detta test är inte med en bounding box Densiteten i den godkända grafen är extremt låg. För varje <SIZE> utfördes 30 tester för att få fram genomsnittet Den testade frågan är:"

msgid "The results of this tests are presented as:"
msgstr "Resultaten av dessa tester presenteras enligt följande:"

msgid "SIZE"
msgstr "STRL"

msgid "is the number of edges given as input."
msgstr "är antalet kanter som anges som indata."

msgid "EDGES"
msgstr "EDGES"

msgid "is the total number of records in the query."
msgstr "är det totala antalet poster i sökningen."

msgid "DENSITY"
msgstr "DENSITET"

msgid "is the density of the data :math:`\\dfrac{E}{V \\times (V-1)}`."
msgstr "är densiteten för data :math:`\\dfrac{E}{V \\times (V-1)}`."

msgid "OUT ROWS"
msgstr "UT RÄDER"

msgid "is the number of records returned by the queries."
msgstr "är antalet poster som returneras av sökningarna."

msgid "Floyd-Warshall"
msgstr "Floyd-Warshall"

msgid "is the average execution time in seconds of pgr_floydWarshall."
msgstr "är den genomsnittliga exekveringstiden i sekunder för pgr_floydWarshall."

msgid "Johnson"
msgstr "Johnson"

msgid "is the average execution time in seconds of pgr_johnson."
msgstr "är den genomsnittliga exekveringstiden i sekunder för pgr_johnson."

msgid "500"
msgstr "500"

msgid "0.18E-7"
msgstr "0.18E-7"

msgid "1346"
msgstr "1346"

msgid "0.14"
msgstr "0.14"

msgid "0.13"
msgstr "0.13"

msgid "1000"
msgstr "1000"

msgid "0.36E-7"
msgstr "0.36E-7"

msgid "2655"
msgstr "2655"

msgid "0.23"
msgstr "0.23"

msgid "0.18"
msgstr "0.18"

msgid "1500"
msgstr "1500"

msgid "0.55E-7"
msgstr "0.55E-7"

msgid "4110"
msgstr "4110"

msgid "0.37"
msgstr "0.37"

msgid "0.34"
msgstr "0.34"

msgid "2000"
msgstr "2000"

msgid "0.73E-7"
msgstr "0.73E-7"

msgid "5676"
msgstr "5676"

msgid "0.56"
msgstr "0.56"

msgid "2500"
msgstr "2500"

msgid "0.89E-7"
msgstr "0.89E-7"

msgid "7177"
msgstr "7177"

msgid "0.84"
msgstr "0.84"

msgid "0.51"
msgstr "0.51"

msgid "3000"
msgstr "3000"

msgid "1.07E-7"
msgstr "1.07E-7"

msgid "8778"
msgstr "8778"

msgid "1.28"
msgstr "1.28"

msgid "0.68"
msgstr "0.68"

msgid "3500"
msgstr "3500"

msgid "1.24E-7"
msgstr "1.24E-7"

msgid "10526"
msgstr "10526"

msgid "2.08"
msgstr "2.08"

msgid "0.95"
msgstr "0.95"

msgid "4000"
msgstr "4000"

msgid "1.41E-7"
msgstr "1.41E-7"

msgid "12484"
msgstr "12484"

msgid "3.16"
msgstr "3.16"

msgid "1.24"
msgstr "1.24"

msgid "4500"
msgstr "4500"

msgid "1.58E-7"
msgstr "1.58E-7"

msgid "14354"
msgstr "14354"

msgid "4.49"
msgstr "4.49"

msgid "1.47"
msgstr "1.47"

msgid "5000"
msgstr "5000"

msgid "1.76E-7"
msgstr "1.76E-7"

msgid "16503"
msgstr "16503"

msgid "6.05"
msgstr "6.05"

msgid "1.78"
msgstr "1.78"

msgid "5500"
msgstr "5500"

msgid "1.93E-7"
msgstr "1.93E-7"

msgid "18623"
msgstr "18623"

msgid "7.53"
msgstr "7.53"

msgid "2.03"
msgstr "2.03"

msgid "6000"
msgstr "6000"

msgid "2.11E-7"
msgstr "2.11E-7"

msgid "20710"
msgstr "20710"

msgid "8.47"
msgstr "8.47"

msgid "2.37"
msgstr "2.37"

msgid "6500"
msgstr "6500"

msgid "2.28E-7"
msgstr "2.28E-7"

msgid "22752"
msgstr "22752"

msgid "9.99"
msgstr "9.99"

msgid "2.68"
msgstr "2.68"

msgid "7000"
msgstr "7000"

msgid "2.46E-7"
msgstr "2.46E-7"

msgid "24687"
msgstr "24687"

msgid "11.82"
msgstr "11.82"

msgid "3.12"
msgstr "3.12"

msgid "7500"
msgstr "7500"

msgid "2.64E-7"
msgstr "2.64E-7"

msgid "26861"
msgstr "26861"

msgid "13.94"
msgstr "13.94"

msgid "3.60"
msgstr "3.60"

msgid "8000"
msgstr "8000"

msgid "2.83E-7"
msgstr "2.83E-7"

msgid "29050"
msgstr "29050"

msgid "15.61"
msgstr "15.61"

msgid "4.09"
msgstr "4.09"

msgid "8500"
msgstr "8500"

msgid "3.01E-7"
msgstr "3.01E-7"

msgid "31693"
msgstr "31693"

msgid "17.43"
msgstr "17.43"

msgid "4.63"
msgstr "4.63"

msgid "9000"
msgstr "9000"

msgid "3.17E-7"
msgstr "3.17E-7"

msgid "33879"
msgstr "33879"

msgid "19.19"
msgstr "19.19"

msgid "5.34"
msgstr "5.34"

msgid "9500"
msgstr "9500"

msgid "3.35E-7"
msgstr "3.35E-7"

msgid "36287"
msgstr "36287"

msgid "20.77"
msgstr "20.77"

msgid "6.24"
msgstr "6.24"

msgid "10000"
msgstr "10000"

msgid "3.52E-7"
msgstr "3.52E-7"

msgid "38491"
msgstr "38491"

msgid "23.26"
msgstr "23.26"

msgid "6.51"
msgstr "6.51"

msgid "Two"
msgstr "Två"

msgid "This test is with a bounding box The density of the passed graph higher than of the Test One. For each <SIZE> 30 tests were executed to get the average The tested edge query is:"
msgstr "Detta test är med en avgränsande box Densiteten i den godkända grafen högre än i test ett. För varje <SIZE> utfördes 30 tester för att få fram genomsnittet Den testade kantfrågan är:"

msgid "The tested queries"
msgstr "De testade frågorna"

msgid "is the size of the bounding box."
msgstr "är storleken på den avgränsande rutan."

msgid "0.001"
msgstr "0.001"

msgid "44"
msgstr "44"

msgid "0.0608"
msgstr "0.0608"

msgid "1197"
msgstr "1197"

msgid "0.10"
msgstr "0.10"

msgid "0.002"
msgstr "0.002"

msgid "99"
msgstr "99"

msgid "0.0251"
msgstr "0.0251"

msgid "4330"
msgstr "4330"

msgid "0.003"
msgstr "0.003"

msgid "223"
msgstr "223"

msgid "0.0122"
msgstr "0.0122"

msgid "18849"
msgstr "18849"

msgid "0.12"
msgstr "0.12"

msgid "0.004"
msgstr "0.004"

msgid "358"
msgstr "358"

msgid "0.0085"
msgstr "0.0085"

msgid "71834"
msgstr "71834"

msgid "0.16"
msgstr "0.16"

msgid "0.005"
msgstr "0.005"

msgid "470"
msgstr "470"

msgid "0.0070"
msgstr "0.0070"

msgid "116290"
msgstr "116290"

msgid "0.22"
msgstr "0.22"

msgid "0.19"
msgstr "0.19"

msgid "0.006"
msgstr "0.006"

msgid "639"
msgstr "639"

msgid "0.0055"
msgstr "0.0055"

msgid "207030"
msgstr "207030"

msgid "0.27"
msgstr "0.27"

msgid "0.007"
msgstr "0.007"

msgid "843"
msgstr "843"

msgid "0.0043"
msgstr "0.0043"

msgid "346930"
msgstr "346930"

msgid "0.64"
msgstr "0.64"

msgid "0.38"
msgstr "0.38"

msgid "0.008"
msgstr "0.008"

msgid "996"
msgstr "996"

msgid "0.0037"
msgstr "0.0037"

msgid "469936"
msgstr "469936"

msgid "0.90"
msgstr "0.90"

msgid "0.49"
msgstr "0.49"

msgid "0.009"
msgstr "0.009"

msgid "1146"
msgstr "1146"

msgid "0.0032"
msgstr "0.0032"

msgid "613135"
msgstr "613135"

msgid "1.26"
msgstr "1.26"

msgid "0.62"
msgstr "0.62"

msgid "0.010"
msgstr "0.010"

msgid "1360"
msgstr "1360"

msgid "0.0027"
msgstr "0.0027"

msgid "849304"
msgstr "849304"

msgid "1.87"
msgstr "1.87"

msgid "0.82"
msgstr "0.82"

msgid "0.011"
msgstr "0.011"

msgid "1573"
msgstr "1573"

msgid "0.0024"
msgstr "0.0024"

msgid "1147101"
msgstr "1147101"

msgid "2.65"
msgstr "2.65"

msgid "1.04"
msgstr "1.04"

msgid "0.012"
msgstr "0.012"

msgid "1789"
msgstr "1789"

msgid "0.0021"
msgstr "0.0021"

msgid "1483629"
msgstr "1483629"

msgid "3.72"
msgstr "3.72"

msgid "1.35"
msgstr "1.35"

msgid "0.013"
msgstr "0.013"

msgid "1975"
msgstr "1975"

msgid "0.0019"
msgstr "0.0019"

msgid "1846897"
msgstr "1846897"

msgid "4.86"
msgstr "4.86"

msgid "1.68"
msgstr "1.68"

msgid "0.014"
msgstr "0.014"

msgid "2281"
msgstr "2281"

msgid "0.0017"
msgstr "0.0017"

msgid "2438298"
msgstr "2438298"

msgid "7.08"
msgstr "7.08"

msgid "2.28"
msgstr "2.28"

msgid "0.015"
msgstr "0.015"

msgid "2588"
msgstr "2588"

msgid "0.0015"
msgstr "0.0015"

msgid "3156007"
msgstr "3156007"

msgid "10.28"
msgstr "10.28"

msgid "2.80"
msgstr "2.80"

msgid "0.016"
msgstr "0.016"

msgid "2958"
msgstr "2958"

msgid "0.0013"
msgstr "0.0013"

msgid "4090618"
msgstr "4090618"

msgid "14.67"
msgstr "14.67"

msgid "3.76"
msgstr "3.76"

msgid "0.017"
msgstr "0.017"

msgid "3247"
msgstr "3247"

msgid "0.0012"
msgstr "0.0012"

msgid "4868919"
msgstr "4868919"

msgid "18.12"
msgstr "18.12"

msgid "4.48"
msgstr "4.48"

msgid ":doc:`pgr_johnson`"
msgstr ":doc:`pgr_johnson`"

msgid ":doc:`pgr_floydWarshall`"
msgstr ":doc:`pgr_floydWarshall`"

msgid "Boost `floyd-Warshall <https://www.boost.org/libs/graph/doc/floyd_warshall_shortest.html>`__"
msgstr "Boost `floyd-Warshall <https://www.boost.org/libs/graph/doc/floyd_warshall_shortest.html>`__"

msgid "Bidirectional A* - Family of functions"
msgstr "Dubbelriktad A* - Familj av funktioner"

msgid "The bidirectional A* (pronounced \"A Star\") algorithm is based on the A* algorithm."
msgstr "Den dubbelriktade algoritmen A* (uttalas \"A Star\") är baserad på A*-algoritmen."

msgid ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths."
msgstr ":doc:`pgr_bdAstar` - Bidirectional A* algorithm for obtaining paths."

msgid ":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of the paths."
msgstr ":doc:`pgr_bdAstarCost` - Bidirectional A* algorithm to calculate the cost of the paths."

msgid ":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a cost matrix of paths."
msgstr ":doc:`pgr_bdAstarCostMatrix` - Bidirectional A* algorithm to calculate a cost matrix of paths."

msgid "Based on A* algorithm, the bidirectional search finds a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``). It runs two simultaneous searches: one forward from the ``start_vid``, and one backward from the ``end_vid``, stopping when the two meet in the middle. This implementation can be used with a directed graph and an undirected graph."
msgstr "Baserat på A*-algoritmen hittar den dubbelriktade sökningen den kortaste vägen från ett startvertex (``start_vid``) till ett slutvertex (``end_vid``). Den kör två samtidiga sökningar: en framåt från ``start_vid`` och en bakåt från ``slut_vid``, och stannar när de två möts i mitten. Den här implementationen kan användas med en riktad graf och en oriktad graf."

msgid "For large graphs where there is a path between the starting vertex and ending vertex:"
msgstr "För stora grafer där det finns en väg mellan start- och slutvertexen:"

msgid "It is expected to terminate faster than :doc:`pgr_aStar`"
msgstr "Den förväntas avslutas snabbare än :doc:`pgr_aStar`"

msgid ":doc:`aStar-family`"
msgstr ":doc:`aStar-family`"

msgid "Bidirectional Dijkstra - Family of functions"
msgstr "Dubbelriktad Dijkstra - Familj av funktioner"

msgid ":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest paths."
msgstr ":doc:`pgr_bdDijkstra` - Bidirectional Dijkstra algorithm for the shortest paths."

msgid ":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of the shortest paths"
msgstr ":doc:`pgr_bdDijkstraCost` - Bidirectional Dijkstra to calculate the cost of the shortest paths"

msgid ":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths."
msgstr ":doc:`pgr_bdDijkstraCostMatrix` - Bidirectional Dijkstra algorithm to create a matrix of costs of the shortest paths."

msgid "Synopsis"
msgstr "Sammanfattning"

msgid "Based on Dijkstra's algorithm, the bidirectional search finds a shortest path a starting vertex to an ending vertex."
msgstr "Baserat på Dijkstras algoritm hittar den dubbelriktade sökningen den kortaste vägen från en startpunkt till en slutpunkt."

msgid "It runs two simultaneous searches: one forward from the source, and one backward from the target, stopping when the two meet in the middle."
msgstr "Den kör två samtidiga sökningar: en framåt från källan och en bakåt från målet, och stannar när de två möts i mitten."

msgid "This implementation can be used with a directed graph and an undirected graph."
msgstr "Denna implementation kan användas med en riktad graf och en oriktad graf."

msgid "A negative value on a cost column is interpreted as the edge does not exist."
msgstr "Ett negativt värde i en kostnadskolumn tolkas som att kanten inte existerar."

msgid "When there is no path:"
msgstr "När det inte finns någon väg:"

msgid "When the starting vertex and ending vertex are the same."
msgstr "När startvertex och slutvertex är desamma."

msgid "The **aggregate cost** of the non included values :math:`(v, v)` is :math:`0`"
msgstr "Den **samlade kostnaden** för de icke inkluderade värdena :math:`(v, v)` är :math:`0`"

msgid "When the starting vertex and ending vertex are the different and there is no path:"
msgstr "När startvertex och slutvertex är olika och det inte finns någon väg:"

msgid "The **aggregate cost** the non included values :math:`(u, v)` is :math:`\\infty`"
msgstr "Den **samlade kostnaden** för de icke inkluderade värdena :math:`(u, v)` är :math:`\\infty`"

msgid "For optimization purposes, any duplicated value in the starting vertices or on the ending vertices are ignored."
msgstr "För optimeringsändamål ignoreras alla duplicerade värden i startpunkterna eller på slutpunkterna."

msgid "Running time (worse case scenario): :math:`O((V \\log V + E))`"
msgstr "Körtid (värsta tänkbara scenario): :math:`O((V \\log V + E))`"

msgid "For large graphs where there is a path bewtween the starting vertex and ending vertex:"
msgstr "För stora grafer där det finns en väg mellan start- och slutvertexen:"

msgid "It is expected to terminate faster than :doc:`pgr_dijkstra`"
msgstr "Den förväntas sluta snabbare än :doc:`pgr_dijkstra`"

msgid "`Boost  <https://www.boost.org/libs/graph/doc>`__"
msgstr "förstärkning <https://www.boost.org/libs/graph/doc>`__"

msgid "Chinese Postman Problem - Family of functions"
msgstr "Problem med kinesiska brevbärare - Familj av funktioner"

msgid ":doc:`pgr_chinesePostman`"
msgstr ":doc:`pgr_chinesePostman`"

msgid ":doc:`pgr_chinesePostmanCost`"
msgstr ":doc:`pgr_chinesePostmanCost`"

msgid "**The main characteristics are:**"
msgstr "**De viktigaste egenskaperna är:**"

msgid "Process is done only on edges with **positive** costs."
msgstr "Processen utförs endast på kanter med **positiva** kostnader."

msgid "Running time: :math:`O(E * (E + V * logV))`"
msgstr "Drifttid: :math:`O(E * (E + V * logV))`"

msgid "Graph must be connected."
msgstr "Grafen måste vara ansluten."

msgid "An Edges SQL that represents a **directed** graph with the following columns"
msgstr "En Edges SQL som representerar en **riktad** graf med följande kolumner"

msgid "Coloring - Family of functions"
msgstr "Färgläggning - Familj av funktioner"

msgid ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach."
msgstr ":doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach."

msgid ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach."
msgstr ":doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach."

msgid ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem."
msgstr ":doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem."

msgid "Returns set of |result_edge_color|"
msgstr "Returnerar uppsättning av |result_edge_color|"

msgid "``color``"
msgstr "``color``"

msgid "Color of the edge."
msgstr "Färg på kanten."

msgid "The minimum value of color is 1."
msgstr "Det minsta värdet för färg är 1."

msgid "Returns set of |result_node_color|"
msgstr "Returnerar uppsättning av |result_node_color|"

msgid "Identifier of the node."
msgstr "Identifierare för noden."

msgid "Color of the node."
msgstr "Färg på noden."

msgid "`Boost: <https://www.boost.org/libs/graph/doc/table_of_contents.html>`__"
msgstr "`Boost: <https://www.boost.org/libs/graph/doc/table_of_contents.html>`__"

msgid "Components - Family of functions"
msgstr "Komponenter - Familj av funktioner"

msgid ":doc:`pgr_connectedComponents` - Connected components of an undirected graph."
msgstr ":doc:`pgr_connectedComponents` - Connected components of an undirected graph."

msgid ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph."
msgstr ":doc:`pgr_strongComponents` - Strongly connected components of a directed graph."

msgid ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph."
msgstr ":doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph."

msgid ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph."
msgstr ":doc:`pgr_articulationPoints` - Articulation points of an undirected graph."

msgid ":doc:`pgr_bridges` - Bridges of an undirected graph."
msgstr ":doc:`pgr_bridges` - Bridges of an undirected graph."

msgid ":doc:`pgr_makeConnected` - Details of edges to make graph connected."
msgstr ":doc:`pgr_makeConnected` - Details of edges to make graph connected."

msgid "Contraction - Family of functions"
msgstr "Sammandragning - Familj av funktioner"

msgid ":doc:`pgr_contraction`"
msgstr ":doc:`pgr_contraction`"

msgid ":doc:`pgr_contractionDeadEnd`"
msgstr ":doc:`pgr_contractionDeadEnd`"

msgid ":doc:`pgr_contractionLinear`"
msgstr ":doc:`pgr_contractionLinear`"

msgid ":doc:`pgr_contractionHierarchies`"
msgstr ":doc:`pgr_contractionHierarchies`"

msgid "In large graphs, like road graphs or electric networks, graph contraction can be used to speed up some graph algorithms. Contraction can reduce the size of the graph by removing some of the vertices and edges and adding edges that represent a sequence of original edges (the original ones can be kept in some methods). In this way, it decreases the total time and space used by graph algorithms, particularly those searching for an optimal path."
msgstr "I stora grafer, t.ex. väggrafer eller elnät, kan grafkontraktion användas för att snabba upp vissa grafalgoritmer. Kontraktion kan minska storleken på grafen genom att ta bort några av topparna och kanterna och lägga till kanter som representerar en sekvens av ursprungliga kanter (de ursprungliga kanterna kan behållas i vissa metoder). På så sätt minskar den totala tiden och utrymmet som används av grafalgoritmer, särskilt de som söker efter en optimal väg."

msgid "This implementation gives a flexible framework for adding contraction algorithms in the future. Currently, it supports three algorithms."
msgstr "Denna implementering ger ett flexibelt ramverk för att lägga till sammandragningsalgoritmer i framtiden. För närvarande stöder den tre algoritmer."

msgid "Dead end contraction"
msgstr "Kontraktion i återvändsgränd"

msgid "Linear contraction"
msgstr "Linjär sammandragning"

msgid "Contraction hierarchies"
msgstr "Sammandragningshierarkier"

msgid "The two first ones can be combined through a iterative procedure, via the ``pgr_contraction`` method. The third one is implemented on its own."
msgstr "De två första kan kombineras genom ett iterativt förfarande, via metoden ``pgr_contraction``. Den tredje är implementerad på egen hand."

msgid "All functions allow the user to forbid contraction on a set of nodes."
msgstr "Alla funktioner gör det möjligt för användaren att förbjuda sammandragning på en uppsättning noder."

msgid "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf"
msgstr "https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf"

msgid "https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf"
msgstr "https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf"

msgid "https://jlazarsfeld.github.io/ch.150.project/contents/"
msgstr "https://jlazarsfeld.github.io/ch.150.project/contents/"

msgid "Cost - Category"
msgstr "Kostnad - Kategori"

msgid ":doc:`pgr_aStarCost`"
msgstr ":doc:`pgr_aStarCost`"

msgid ":doc:`pgr_bdAstarCost`"
msgstr ":doc:`pgr_bdAstarCost`"

msgid ":doc:`pgr_dijkstraCost`"
msgstr ":doc:`pgr_dijkstraCost`"

msgid ":doc:`pgr_dijkstraNearCost`"
msgstr ":doc:`pgr_dijkstraNearCost`"

msgid ":doc:`pgr_bdDijkstraCost`"
msgstr ":doc:`pgr_bdDijkstraCost`"

msgid ":doc:`pgr_withPointsCost`"
msgstr ":doc:`pgr_withPointsCost`"

msgid "Each function works as part of the family it belongs to."
msgstr "Varje funktion fungerar som en del av den familj den tillhör."

msgid "Returns the sum of the costs of the shortest path of each pair combination of nodes requested."
msgstr "Returnerar summan av kostnaderna för den kortaste vägen för varje begärd parkombination av noder."

msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: ``(start_vid, end_vid)``."
msgstr "Låt oss anta att de värden som returneras lagras i en tabell, så det unika indexet skulle vara paret: ``(start_vid, end_vid)``."

msgid "Depending on the function and its parameters, the results can be symmetric."
msgstr "Beroende på funktionen och dess parametrar kan resultaten vara symmetriska."

msgid "The **aggregate cost** of :math:`(u, v)` is the same as for :math:`(v, u)`."
msgstr "Den **samlade kostnaden** för :math:`(u, v)` är densamma som för :math:`(v, u)`."

msgid "Any duplicated value in the start or end vertex identifiers are ignored."
msgstr "Eventuella duplicerade värden i start- eller slutvertexidentifierarna ignoreras."

msgid "The returned values are ordered:"
msgstr "De returnerade värdena är ordnade:"

msgid "``start_vid`` ascending"
msgstr "``start_vid`` stigande"

msgid "``end_vid`` ascending"
msgstr "``end_vid`` stigande"

msgid "Cost Matrix - Category"
msgstr "Kostnadsmatris - Kategori"

msgid ":doc:`pgr_aStarCostMatrix`"
msgstr ":doc:`pgr_aStarCostMatrix`"

msgid ":doc:`pgr_dijkstraCostMatrix`"
msgstr ":doc:`pgr_dijkstraCostMatrix`"

msgid ":doc:`pgr_bdAstarCostMatrix`"
msgstr ":doc:`pgr_bdAstarCostMatrix`"

msgid ":doc:`pgr_bdDijkstraCostMatrix`"
msgstr ":doc:`pgr_bdDijkstraCostMatrix`"

msgid ":doc:`pgr_withPointsCostMatrix`"
msgstr ":doc:`pgr_withPointsCostMatrix`"

msgid ":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, v)` must value :math:`\\infty`."
msgstr ":doc:`TSP-family` needs as input a symmetric cost matrix and no edge `(u, v)` must value :math:`\\infty`."

msgid "This collection of functions will return a cost matrix in form of a table."
msgstr "Denna samling funktioner returnerar en kostnadsmatris i form av en tabell."

msgid "Can be used as input to :doc:`pgr_TSP`."
msgstr "Kan användas som indata till :doc:`pgr_TSP`."

msgid "Use directly when the resulting matrix is symmetric and there is no :math:`\\infty` value."
msgstr "Används direkt när den resulterande matrisen är symmetrisk och det inte finns något :math:`\\infty`-värde."

msgid "It will be the users responsibility to make the matrix symmetric."
msgstr "Det är användarens ansvar att göra matrisen symmetrisk."

msgid "By using geometric or harmonic average of the non symmetric values."
msgstr "Genom att använda geometriskt eller harmoniskt medelvärde av de icke symmetriska värdena."

msgid "By using max or min the non symmetric values."
msgstr "Genom att använda max eller min används de icke symmetriska värdena."

msgid "By setting the upper triangle to be the mirror image of the lower triangle."
msgstr "Genom att ställa in den övre triangeln så att den blir en spegelbild av den nedre triangeln."

msgid "By setting the lower triangle to be the mirror image of the upper triangle."
msgstr "Genom att ställa in den nedre triangeln så att den blir en spegelbild av den övre triangeln."

msgid "It is also the users responsibility to fix an :math:`\\infty` value."
msgstr "Det är också användarens ansvar att åtgärda ett :math:`\\infty`-värde."

msgid "Returns the sum of the costs of the shortest path for pair combination of nodes in the graph."
msgstr "Returnerar summan av kostnaderna för den kortaste vägen för parkombinationer av noder i grafen."

msgid "When the starting vertex and ending vertex are the same, there is no path."
msgstr "När startvertex och slutvertex är desamma finns det ingen väg."

msgid "The aggregate cost in the non included values `(v, v)` is `0`."
msgstr "Den sammanlagda kostnaden för de icke inkluderade värdena `(v, v)` är `0`."

msgid "When the starting vertex and ending vertex are the different and there is no path."
msgstr "När startvertex och slutvertex är olika och det inte finns någon väg."

msgid "The aggregate cost in the non included values `(u, v)` is :math:`\\infty`."
msgstr "Den sammanlagda kostnaden för de icke inkluderade värdena `(u, v)` är :math:`\\infty`."

msgid "Let be the case the values returned are stored in a table:"
msgstr "Om så är fallet lagras de värden som returneras i en tabell:"

msgid "The unique index would be the pair: ``(start_vid, end_vid)``."
msgstr "Det unika indexet skulle vara paret: ``(start_vid, end_vid)``."

msgid "The aggregate cost of `(u, v)` is the same as for `(v, u)`."
msgstr "Den sammanlagda kostnaden för `(u, v)` är densamma som för `(v, u)`."

msgid "Any duplicated value in the **start vids** are ignored."
msgstr "Alla duplicerade värden i **start vids** ignoreras."

msgid "Used in:"
msgstr "Används i:"

msgid "`Edges SQL`_ as described below"
msgstr "`Kanter SQL`_ enligt beskrivningen nedan"

msgid "**start vids**"
msgstr "**start vids**"

msgid "``ARRAY[BIGINT]``"
msgstr "``ARRAY[BIGINT]``"

msgid "Array of identifiers of starting vertices."
msgstr "Array med identifierare för startpunkter."

msgid "`Points SQL`_"
msgstr "`Punkt SQL`_"

msgid "`Points SQL`_ as described below"
msgstr "`Points SQL`_ enligt beskrivningen nedan"

msgid "Points SQL"
msgstr "Punkt SQL"

msgid "``pid``"
msgstr "``pid``"

msgid "**value**"
msgstr "**värde**"

msgid "Identifier of the point."
msgstr "Identifierare av punkten."

msgid "Use with positive value, as internally will be converted to negative value"
msgstr "Använd med positivt värde, eftersom det internt kommer att omvandlas till negativt värde"

msgid "If column is present, it can not be NULL."
msgstr "Om kolumnen finns med kan den inte vara NULL."

msgid "If column is not present, a sequential negative **value** will be given automatically."
msgstr "Om kolumnen inte finns med kommer ett negativt **värde** att anges automatiskt i ordningsföljd."

msgid "``edge_id``"
msgstr "``edge_id``"

msgid "Identifier of the \"closest\" edge to the point."
msgstr "Identifierar den kant som ligger \"närmast\" punkten."

msgid "``fraction``"
msgstr "``fraction``"

msgid "Value in <0,1> that indicates the relative position from the first end point of the edge."
msgstr "Värde i <0,1> som anger den relativa positionen från kantens första ändpunkt."

msgid "``side``"
msgstr "``side``"

msgid "``CHAR``"
msgstr "``CHAR``"

msgid "``b``"
msgstr "``b``"

msgid "Value in [``b``, ``r``, ``l``, ``NULL``] indicating if the point is:"
msgstr "Värde i [``b``, ``r``, ``l``, ``NULL``] som anger om punkten är:"

msgid "In the right ``r``,"
msgstr "I rätt \"r\","

msgid "In the left ``l``,"
msgstr "I vänster \"l\","

msgid "In both sides ``b``, ``NULL``"
msgstr "I båda sidor ``b``, ``NULL``"

msgid ":doc:`TSP-family`"
msgstr ":doc:`TSP-family`"

msgid "Dijkstra - Family of functions"
msgstr "Dijkstra - Familj av funktioner"

msgid ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths."
msgstr ":doc:`pgr_dijkstra` - Dijkstra's algorithm for the shortest paths."

msgid ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths."
msgstr ":doc:`pgr_dijkstraCost` - Get the aggregate cost of the shortest paths."

msgid ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix."
msgstr ":doc:`pgr_dijkstraCostMatrix` - Use pgr_dijkstra to create a costs matrix."

msgid ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament information."
msgstr ":doc:`pgr_drivingDistance` - Use pgr_dijkstra to calculate catchament information."

msgid ":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest paths."
msgstr ":doc:`pgr_KSP` - Use Yen algorithm with pgr_dijkstra to get the K shortest paths."

msgid ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices."
msgstr ":doc:`pgr_dijkstraVia` - Get a route of a sequence of vertices."

msgid ":doc:`pgr_dijkstraNear` - Get the route to the nearest vertex."
msgstr ":doc:`pgr_dijkstraNear` - Get the route to the nearest vertex."

msgid ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex."
msgstr ":doc:`pgr_dijkstraNearCost` - Get the cost to the nearest vertex."

msgid "Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956. It is a graph search algorithm that solves the shortest path problem for a graph with non-negative edge path costs, producing a shortest path from a starting vertex to an ending vertex. This implementation can be used with a directed graph and an undirected graph."
msgstr "Dijkstras algoritm, skapad av den holländske datavetaren Edsger Dijkstra 1956. Det är en algoritm för grafsökning som löser problemet med kortaste vägen för en graf med icke-negativa kantvägskostnader, vilket ger en kortaste väg från ett startvertex till ett slutvertex. Den här implementationen kan användas med en riktad graf och en oriktad graf."

msgid "Running time: :math:`O(| start\\ vids | * (V \\log V + E))`"
msgstr "Drifttid: :math:`O(| start\\ vids | * (V \\log V + E))`"

msgid "The Dijkstra family functions are based on the Dijkstra algorithm."
msgstr "Dijkstra-familjens funktioner är baserade på Dijkstra-algoritmen."

msgid "`Combinations SQL`_"
msgstr "`Kombinationer SQL`_"

msgid "`Combinations SQL`_ as described below"
msgstr "`Combinations SQL`_ enligt beskrivningen nedan"

msgid "**start vid**"
msgstr "**start vid**"

msgid "Identifier of the starting vertex of the path."
msgstr "Identifierare för stigens startvertex."

msgid "**end vid**"
msgstr "**end vid**"

msgid "Identifier of the ending vertex of the path."
msgstr "Identifierare för banans slutpunkt."

msgid "**end vids**"
msgstr "**end vids**"

msgid "Array of identifiers of ending vertices."
msgstr "Array med identifierare för slutpunkter."

msgid "Combinations SQL"
msgstr "Kombinationer SQL"

msgid "Identifier of the departure vertex."
msgstr "Identifierare för avgångsvertexen."

msgid "Identifier of the arrival vertex."
msgstr "Identifierare för ankomstvertexet."

msgid "The problem definition (Advanced documentation)"
msgstr "Problemdefinition (avancerad dokumentation)"

msgid "Given the following query:"
msgstr "Givet följande frågeställning:"

msgid "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)"
msgstr "pgr_dijkstra(:math:`sql, start_{vid}, end_{vid}, directed`)"

msgid "where :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}`"
msgstr "där :math:`sql = \\{(id_i, source_i, target_i, cost_i, reverse\\_cost_i)\\}``"

msgid "and"
msgstr "och"

msgid ":math:`source = \\bigcup source_i`,"
msgstr ":math:`source = \\bigcup source_i`,"

msgid ":math:`target = \\bigcup target_i`,"
msgstr ":math:`target = \\bigcup target_i`,"

msgid "The graphs are defined as follows:"
msgstr "Graferna definieras på följande sätt:"

msgid "Directed graph"
msgstr "Riktad graf"

msgid "The weighted directed graph, :math:`G_d(V,E)`, is defined by:"
msgstr "Den viktade riktade grafen, :math:`G_d(V,E)`, definieras av:"

msgid "the set of vertices :math:`V`"
msgstr "uppsättningen av hörn :math:`V`"

msgid ":math:`V = source \\cup target \\cup {start_{vid}} \\cup  {end_{vid}}`"
msgstr ":math:`V = source \\cup target \\cup {start_{vid}} \\cup  {end_{vid}}`"

msgid "the set of edges :math:`E`"
msgstr "uppsättningen kanter :math:`E`"

msgid ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ }  & \\quad \\text{ } \\\\ \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} &  \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`"
msgstr ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\quad \\text{if } reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ }  & \\quad \\text{ } \\\\ \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} &  \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i>=0 \\} & \\quad \\text{if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`"

msgid "Undirected graph"
msgstr "Oriktad graf"

msgid "The weighted undirected graph, :math:`G_u(V,E)`, is defined by:"
msgstr "Den viktade oavledda grafen, :math:`G_u(V,E)`, definieras av:"

msgid ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup  {end_{vid}}`"
msgstr ":math:`V = source \\cup target \\cup {start_v{vid}} \\cup  {end_{vid}}`"

msgid ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\}  & \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 \\}  & \\quad \\text{ if } reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ }  & \\text{ } \\\\ \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad \\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`"
msgstr ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\}  & \\quad \\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 \\}  & \\quad \\text{ if } reverse\\_cost = \\varnothing \\\\ \\text{ } \\text{ }  & \\text{ } \\\\ \\text{ } \\{(source_i, target_i, cost_i) \\text{ when } cost >=0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, cost_i) \\text{ when } cost >=0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\text{ } \\\\ \\cup \\{(source_i, target_i, reverse\\_cost_i) \\text{ when } reverse\\_cost_i >=0)\\} & \\quad \\text{ if } reverse\\_cost \\neq \\varnothing \\\\ \\end{cases}`"

msgid "The problem"
msgstr "Problemet"

msgid "Given:"
msgstr "Givetvis:"

msgid ":math:`start_{vid} \\in V` a starting vertex"
msgstr ":math:`start_{vid} \\in V` a starting vertex"

msgid ":math:`end_{vid} \\in V` an ending vertex"
msgstr ":math:`end_{vid} \\in V` an ending vertex"

msgid ":math:`G(V,E) = \\begin{cases} G_d(V,E) & \\quad \\text{ if6 } directed = true \\\\ G_u(V,E) & \\quad \\text{ if5 } directed = false \\\\ \\end{cases}`"
msgstr ":math:`G(V,E) = \\begin{cases} G_d(V,E) & \\quad \\text{ if6 } directed = true \\\\ G_u(V,E) & \\quad \\text{ if5 } directed = false \\\\ \\end{cases}`"

msgid "Then:"
msgstr "Då så:"

msgid ":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, agg\\_cost_i)\\}`"
msgstr ":math:`\\boldsymbol{\\pi} = \\{(path\\_seq_i, node_i, edge_i, cost_i, agg\\_cost_i)\\}`"

msgid "where:"
msgstr "var:"

msgid ":math:`path\\_seq_i = i`"
msgstr ":math:`path\\_seq_i = i`"

msgid ":math:`path\\_seq_{| \\pi |} = | \\pi |`"
msgstr ":math:`path\\_seq_{| \\pi |} = | \\pi |`"

msgid ":math:`node_i \\in V`"
msgstr ":math:`node_i \\in V`"

msgid ":math:`node_1 = start_{vid}`"
msgstr ":math:`node_1 = start_{vid}`"

msgid ":math:`node_{| \\pi |}  = end_{vid}`"
msgstr ":math:`node_{| \\pi |}  = end_{vid}`"

msgid ":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`"
msgstr ":math:`\\forall i \\neq | \\pi |, \\quad (node_i, node_{i+1}, cost_i) \\in E`"

msgid ":math:`edge_i  = \\begin{cases}  id_{(node_i, node_{i+1},cost_i)}  &\\quad  \\text{when } i \\neq | \\pi | \\\\ -1 &\\quad  \\text{when } i = | \\pi | \\\\ \\end{cases}`"
msgstr ":math:`edge_i  = \\begin{cases}  id_{(node_i, node_{i+1},cost_i)}  &\\quad  \\text{when } i \\neq | \\pi | \\\\ -1 &\\quad  \\text{when } i = | \\pi | \\\\ \\end{cases}`"

msgid ":math:`cost_i = cost_{(node_i, node_{i+1})}`"
msgstr ":math:`cost_i = cost_{(node_i, node_{i+1})}`"

msgid ":math:`agg\\_cost_i  = \\begin{cases}  0   &\\quad  \\text{when } i = 1  \\\\ \\displaystyle\\sum_{k=1}^{i}  cost_{(node_{k-1}, node_k)}  &\\quad  \\text{when } i \\neq 1 \\\\ \\end{cases}`"
msgstr ":math:`agg\\_cost_i  = \\begin{cases}  0   &\\quad  \\text{when } i = 1  \\\\ \\displaystyle\\sum_{k=1}^{i}  cost_{(node_{k-1}, node_k)}  &\\quad  \\text{when } i \\neq 1 \\\\ \\end{cases}`"

msgid "In other words: The algorithm returns a the shortest path between :math:`start_{vid}` and :math:`end_{vid}`, if it exists, in terms of a sequence of nodes and of edges,"
msgstr "Eller med andra ord Algoritmen returnerar den kortaste vägen mellan :math:`start_{vid}` och :math:`slut_{vid}`, om den finns, i form av en sekvens av noder och kanter,"

msgid ":math:`path\\_seq` indicates the relative position in the path of the :math:`node` or :math:`edge`."
msgstr ":math:`path\\_seq` indicates the relative position in the path of the :math:`node` or :math:`edge`."

msgid ":math:`cost` is the cost of the edge to be used to go to the next node."
msgstr ":math:`cost` is the cost of the edge to be used to go to the next node."

msgid ":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node."
msgstr ":math:`agg\\_cost` is the cost from the :math:`start_{vid}` up to the node."

msgid "If there is no path, the resulting set is empty."
msgstr "Om det inte finns någon väg är den resulterande uppsättningen tom."

msgid "Driving Distance - Category"
msgstr "Köravstånd - Kategori"

msgid ":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm"
msgstr ":doc:`pgr_drivingDistance` - Driving Distance based on Dijkstra's algorithm"

msgid ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm"
msgstr ":doc:`pgr_primDD` - Driving Distance based on Prim's algorithm"

msgid ":doc:`pgr_kruskalDD` - Driving Distance based on Kruskal's algorithm"
msgstr ":doc:`pgr_kruskalDD` - Driving Distance based on Kruskal's algorithm"

msgid ":doc:`pgr_withPointsDD` - Driving Distance based on pgr_withPoints"
msgstr ":doc:`pgr_withPointsDD` - Driving Distance based on pgr_withPoints"

msgid "Calculate nodes that are within a distance."
msgstr "Beräkna noder som ligger inom ett visst avstånd."

msgid "Extracts all the nodes that have costs less than or equal to the value distance."
msgstr "Extraherar alla noder som har kostnader som är mindre än eller lika med värdeavståndet."

msgid "The edges extracted will conform to the corresponding spanning tree."
msgstr "De kanter som extraheras kommer att överensstämma med motsvarande spännträd."

msgid "Edge :math:`(u, v)` will not be included when:"
msgstr "Edge :math:`(u, v)` kommer inte att inkluderas när:"

msgid "The distance from the **root** to :math:`u` > limit distance."
msgstr "Avståndet från **roten** till :math:`u` > gränsavstånd."

msgid "The distance from the **root** to :math:`v` > limit distance."
msgstr "Avståndet från **roten** till :math:`v` > gränsavstånd."

msgid "No new nodes are created on the graph, so when is within the limit and is not within the limit, the edge is not included."
msgstr "Inga nya noder skapas i grafen, så när är inom gränsen och är inte inom gränsen, är kanten inte inkluderad."

msgid "Edges SQL as described below."
msgstr "Kanter SQL enligt beskrivningen nedan."

msgid "**Root vid**"
msgstr "**Root vid**"

msgid "**Root vids**"
msgstr "**Root vids**"

msgid "``ARRAY[ANY-INTEGER]``"
msgstr "``ARRAY[ANY-TAL]``"

msgid "**distance**"
msgstr "**distance**"

msgid "Upper limit for the inclusion of a node in the result."
msgstr "Övre gräns för när en nod ska inkluderas i resultatet."

msgid "Returns set of |result-spantree|"
msgstr "Returnerar uppsättning av |result-spantree|"

msgid ":math:`depth-1` is the depth of ``pred``"
msgstr ":math:`depth-1` is the depth of ``pred``"

msgid "``pred``"
msgstr "``pred``"

msgid "Predecessor of ``node``."
msgstr "Föregångare till ``node``."

msgid "When ``node`` = ``start_vid`` then has the value ``node``."
msgstr "När ``node`` = ``start_vid`` så har värdet ``node``."

msgid "Identifier of the ``edge`` used to arrive from ``pred`` to ``node``."
msgstr "Identifierare av den ``edge`` som används för att komma från ``pred`` till ``node``."

msgid "Experimental Functions"
msgstr "Experimentella funktioner"

msgid "Families"
msgstr "Familjer"

msgid ":doc:`flow-family`"
msgstr ":doc:`flow-family`"

msgid ":doc:`pgr_maxFlowMinCost` - Details of flow and cost on edges."
msgstr ":doc:`pgr_maxFlowMinCost` - Details of flow and cost on edges."

msgid ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation."
msgstr ":doc:`pgr_maxFlowMinCost_Cost` - Only the Min Cost calculation."

msgid ":doc:`chinesePostmanProblem-family`"
msgstr ":doc:`chinesePostmanProblem-family`"

msgid ":doc:`coloring-family`"
msgstr ":doc:`coloring-family`"

msgid ":doc:`contraction-family`"
msgstr ":doc:`contraction-family`"

msgid ":doc:`transformation-family`"
msgstr ":doc:`transformation-family`"

msgid ":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line Graph out of each vertex in the input graph."
msgstr ":doc:`pgr_lineGraphFull` - Transformation algorithm for generating a Line Graph out of each vertex in the input graph."

msgid ":doc:`traversal-family`"
msgstr ":doc:`traversal-family`"

msgid ":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph."
msgstr ":doc:`pgr_breadthFirstSearch` - Breath first search traversal of the graph."

msgid ":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the graph."
msgstr ":doc:`pgr_binaryBreadthFirstSearch` - Breath first search traversal of the graph."

msgid ":doc:`components-family`"
msgstr ":doc:`components-family`"

msgid ":doc:`ordering-family`"
msgstr ":doc:`ordering-family`"

msgid ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph."
msgstr ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph."

msgid ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph."
msgstr ":doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph."

msgid ":doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph."
msgstr ":doc:`pgr_sloanOrdering` - Returnerar sloan-ordningen för en odränerad graf."

msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph."
msgstr ":doc:`pgr_kingOrdering` - Returnerar King-ordningen för en odelad graf."

msgid ":doc:`metrics-family`"
msgstr ":doc:`metrics-family`"

msgid ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness centrality using Brandes Algorithm"
msgstr ":doc:`pgr_betweennessCentrality` - Calculates relative betweenness centrality using Brandes Algorithm"

msgid ":doc:`pgr_bandwidth` - Computes the bandwidth of a graph."
msgstr ":doc:`pgr_bandwidth` - Beräknar bandbredden för en graf."

msgid ":doc:`TRSP-family`"
msgstr ":doc:`TRSP-family`"

msgid "categories"
msgstr "kategorier"

msgid ":doc:`VRP-category`"
msgstr ":doc:`VRP-category`"

msgid "Shortest Path Category"
msgstr "Kortaste vägen Kategori"

msgid ":doc:`pgr_bellmanFord`"
msgstr ":doc:`pgr_bellmanFord`"

msgid ":doc:`pgr_dagShortestPath`"
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"

msgid ":doc:`pgr_lengauerTarjanDominatorTree`"
msgstr ":doc:`pgr_lengauerTarjanDominatorTree`"

msgid ":doc:`pgr_stoerWagner`"
msgstr ":doc:`pgr_stoerWagner`"

msgid ":doc:`pgr_transitiveClosure`"
msgstr ":doc:`pgr_transitiveClosure`"

msgid ":doc:`pgr_hawickCircuits`"
msgstr ":doc:`pgr_hawickCircuits`"

msgid "Flow - Family of functions"
msgstr "Flow - Familj av funktioner"

msgid ":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel algorithm."
msgstr ":doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel algorithm."

msgid ":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on edges."
msgstr ":doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on edges."

msgid ":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on edges."
msgstr ":doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on edges."

msgid ":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges."
msgstr ":doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges."

msgid "Applications"
msgstr "Ansökningar"

msgid ":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two groups of vertices."
msgstr ":doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two groups of vertices."

msgid ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph."
msgstr ":doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph."

msgid "Flow Functions General Information"
msgstr "Flödesfunktioner Allmän information"

msgid "The graph is **directed**."
msgstr "Grafen är **riktad**."

msgid "Process is done only on edges with positive capacities."
msgstr "Processen utförs endast på kanter med positiva kapaciteter."

msgid "When the maximum flow is 0 then there is no flow and **EMPTY SET** is returned."
msgstr "När det maximala flödet är 0 finns det inget flöde och **EMPTY SET** returneras."

msgid "There is no flow when source has the same value as target."
msgstr "Det finns inget flöde när källan har samma värde som målet."

msgid "Any duplicated values in source or target are ignored."
msgstr "Alla duplicerade värden i källan eller målet ignoreras."

msgid "Calculates the flow/residual capacity for each edge. In the output"
msgstr "Beräknar flödet/resterande kapacitet för varje kant. I utmatningen"

msgid "Edges with zero flow are omitted."
msgstr "Kanter med nollflöde utelämnas."

msgid "Creates"
msgstr "Skapar"

msgid "a **super source** and edges from it to all the sources,"
msgstr "en **superkälla** och kanter från den till alla källor,"

msgid "a **super target** and edges from it to all the targetss."
msgstr "ett **supermål** och kanter från det till alla mål."

msgid "The maximum flow through the graph is guaranteed to be the value returned by :doc:`pgr_maxFlow <pgr_maxFlow>` when executed with the same parameters and can be calculated:"
msgstr "Det maximala flödet genom grafen är garanterat det värde som returneras av :doc:`pgr_maxFlow <pgr_maxFlow>` när det körs med samma parametrar och kan beräknas:"

msgid "By aggregation of the outgoing flow from the sources"
msgstr "Genom aggregering av det utgående flödet från källorna"

msgid "By aggregation of the incoming flow to the targets"
msgstr "Genom aggregering av det inkommande flödet till målen"

msgid ":doc:`pgr_maxFlow` is the maximum Flow and that maximum is guaranteed to be the same on the functions :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :doc:`pgr_boykovKolmogorov`, but the actual flow through each edge may vary."
msgstr ":doc:`pgr_maxFlow` is the maximum Flow and that maximum is guaranteed to be the same on the functions :doc:`pgr_pushRelabel`, :doc:`pgr_edmondsKarp`, :doc:`pgr_boykovKolmogorov`, but the actual flow through each edge may vary."

msgid "Capacity edges"
msgstr "Kapacitet kanter"

msgid ":doc:`pgr_pushRelabel`"
msgstr ":doc:`pgr_pushRelabel`"

msgid ":doc:`pgr_edmondsKarp`"
msgstr ":doc:`pgr_edmondsKarp`"

msgid ":doc:`pgr_boykovKolmogorov`"
msgstr ":doc:`pgr_boykovKolmogorov`"

msgid "``reverse_capacity``"
msgstr "``reverse_capacity``"

msgid "Capacity-Cost edges"
msgstr "Kanter mellan kapacitet och kostnad"

msgid ":doc:`pgr_maxFlowMinCost`"
msgstr ":doc:`pgr_maxFlowMinCost`"

msgid ":doc:`pgr_maxFlowMinCost_Cost`"
msgstr ":doc:`pgr_maxFlowMinCost_Cost`"

msgid "Capacity of the edge (``source``, ``target``)"
msgstr "Kapacitet för kanten (``källa``, ``mål``)"

msgid "Capacity of the edge (``target``, ``source``)"
msgstr "Kapacitet för kanten (``mål``, ``källa``)"

msgid "Weight of the edge (``source``, ``target``) if it exist"
msgstr "Vikt för kanten (``källa``, ``mål``) om den finns"

msgid "Weight of the edge (``target``, ``source``) if it exist"
msgstr "Vikt för kanten (``mål``, ``källa``) om den finns"

msgid "Cost edges"
msgstr "Kostnad kanter"

msgid ":doc:`pgr_edgeDisjointPaths`"
msgstr ":doc:`pgr_edgeDisjointPaths`"

msgid "Used in"
msgstr "Använd i"

msgid "**seq**"
msgstr "**seq**"

msgid "``INT``"
msgstr "``INT``"

msgid "**edge**"
msgstr "**edge**"

msgid "Identifier of the edge in the original query (edges_sql)."
msgstr "Identifierare av kanten i den ursprungliga frågan (edges_sql)."

msgid "**start_vid**"
msgstr "**start_vid**"

msgid "**end_vid**"
msgstr "**end_vid**"

msgid "**flow**"
msgstr "**flow**"

msgid "Flow through the edge in the direction (``start_vid``, ``end_vid``)."
msgstr "Flöde genom kanten i riktning (``start_vid``, ``slut_vid``)."

msgid "**residual_capacity**"
msgstr "**återstående_kapacitet**"

msgid "Residual capacity of the edge in the direction (``start_vid``, ``end_vid``)."
msgstr "Restkapacitet för kanten i riktningen (``start_vid``, ``slut_vid``)."

msgid "For :doc:`pgr_maxFlowMinCost`"
msgstr "För :doc:`pgr_maxFlowMinCost`"

msgid "**source**"
msgstr "**källa**"

msgid "**target**"
msgstr "**mål**"

msgid "Flow through the edge in the direction (source, target)."
msgstr "Flöde genom kanten i riktning (källa, mål)."

msgid "Residual capacity of the edge in the direction (source, target)."
msgstr "Restkapacitet för kanten i riktningen (källa, mål)."

msgid "**cost**"
msgstr "**cost**"

msgid "The cost of sending this flow through the edge in the direction (source, target)."
msgstr "Kostnaden för att skicka detta flöde genom kanten i riktningen (källa, mål)."

msgid "**agg_cost**"
msgstr "**agg_cost**"

msgid "The aggregate cost."
msgstr "Den sammanlagda kostnaden."

msgid "Advanced Documentation"
msgstr "Avancerad dokumentation"

msgid "A flow network is a directed graph where each edge has a capacity and a flow. The flow through an edge must not exceed the capacity of the edge. Additionally, the incoming and outgoing flow of a node must be equal except for source which only has outgoing flow, and the destination(sink) which only has incoming flow."
msgstr "Ett flödesnät är en riktad graf där varje kant har en kapacitet och ett flöde. Flödet genom en kant får inte överstiga kapaciteten i kanten. Dessutom måste det inkommande och utgående flödet för en nod vara lika med undantag för källan som bara har utgående flöde och destinationen (sink) som bara har inkommande flöde."

msgid "Maximum flow algorithms calculate the maximum flow through the graph and the flow of each edge."
msgstr "Algoritmer för maximalt flöde beräknar det maximala flödet genom grafen och flödet för varje kant."

msgid "The maximum flow through the graph is guaranteed to be the same with all implementations, but the actual flow through each edge may vary."
msgstr "Det maximala flödet genom grafen är garanterat detsamma för alla implementeringar, men det faktiska flödet genom varje kant kan variera."

msgid "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`"
msgstr "pgr_maxFlow :math:`(edges\\_sql, source\\_vertex, sink\\_vertex)`"

msgid "where :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse\\_capacity_i)\\}`"
msgstr "där :math:`edges\\_sql = \\{(id_i, source_i, target_i, capacity_i, reverse\\_capacity_i)\\}``"

msgid "Graph definition"
msgstr "Definition av graf"

msgid "The weighted directed graph, :math:`G(V,E)`, is defined as:"
msgstr "Den viktade riktade grafen, :math:`G(V,E)`, definieras som:"

msgid "the set of vertices  :math:`V`"
msgstr "uppsättningen av hörn :math:`V`"

msgid ":math:`source\\_vertex  \\cup  sink\\_vertex  \\bigcup  source_i  \\bigcup  target_i`"
msgstr ":math:`source\\_vertex  \\cup  sink\\_vertex  \\bigcup  source_i  \\bigcup  target_i`"

msgid ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\quad  \\text{ if } reverse\\_capacity = \\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq \\varnothing \\\\ \\end{cases}`"
msgstr ":math:`E = \\begin{cases} \\text{ } \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\quad  \\text{ if } reverse\\_capacity = \\varnothing \\\\ \\text{ } & \\quad \\text{ } \\\\ \\{(source_i, target_i, capacity_i) \\text{ when } capacity > 0 \\} & \\text{ } \\\\ \\cup \\{(target_i, source_i, reverse\\_capacity_i) \\text{ when } reverse\\_capacity_i > 0)\\} & \\quad \\text{ if } reverse\\_capacity \\neq \\varnothing \\\\ \\end{cases}`"

msgid "Maximum flow problem"
msgstr "Problem med maximalt flöde"

msgid ":math:`G(V,E)`"
msgstr ":math:`G(V,E)`"

msgid ":math:`source\\_vertex \\in V` the source vertex"
msgstr ":math:`source\\_vertex \\in V` the source vertex"

msgid ":math:`sink\\_vertex \\in V` the sink vertex"
msgstr ":math:`sink\\_vertex \\in V` the sink vertex"

msgid ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`"
msgstr ":math:`pgr\\_maxFlow(edges\\_sql, source, sink) = \\boldsymbol{\\Phi}`"

msgid ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, flow_i, residual\\_capacity_i)}`"
msgstr ":math:`\\boldsymbol{\\Phi} = {(id_i, edge\\_id_i, source_i, target_i, flow_i, residual\\_capacity_i)}`"

msgid ":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their residual capacity and flow. The maximum flow through the graph can be obtained by aggregating on the source or sink and summing the flow from/to it. In particular:"
msgstr ":math:`\\boldsymbol{\\Phi}` is a subset of the original edges with their residual capacity and flow. The maximum flow through the graph can be obtained by aggregating on the source or sink and summing the flow from/to it. In particular:"

msgid ":math:`id_i = i`"
msgstr ":math:`id_i = i`"

msgid ":math:`edge\\_id = id_i` in edges_sql"
msgstr ":math:`edge\\_id = id_i` in edges_sql"

msgid ":math:`residual\\_capacity_i = capacity_i - flow_i`"
msgstr ":math:`residual\\_capacity_i = capacity_i - flow_i`"

msgid "https://en.wikipedia.org/wiki/Maximum_flow_problem"
msgstr "https://en.wikipedia.org/wiki/Maximum_flow_problem"

msgid "pgRouting extends the `PostGIS <https://postgis.net>`__/`PostgreSQL <https://www.postgresql.org>`__ geospatial database to provide geospatial routing and other network analysis functionality."
msgstr "pgRouting utökar `PostGIS <https://postgis.net>`__/`PostgreSQL <https://www.postgresql.org>`__ geospatial databas för att tillhandahålla geospatial routing och annan nätverksanalysfunktionalitet."

msgid "This is the manual for pgRouting |release|."
msgstr "Detta är manualen för pgRouting |release|."

msgid "Creative Commons Attribution-Share Alike 3.0 License"
msgstr "Creative Commons Erkännande-Dela Lika 3.0-licens"

msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License <https://creativecommons.org/licenses/by-sa/3.0/>`_. Feel free to use this material any way you like, but we ask that you attribute credit to the pgRouting Project and wherever possible, a link back to https://pgrouting.org. For other licenses used in pgRouting see the :ref:`license` page."
msgstr "Manualen för pgRouting är licensierad under en `Creative Commons Attribution-Share Alike 3.0 License <https://creativecommons.org/licenses/by-sa/3.0/>`_. Du är välkommen att använda detta material på vilket sätt du vill, men vi ber dig att ange pgRouting-projektet som källa och om möjligt en länk tillbaka till https://pgrouting.org. För andra licenser som används i pgRouting, se sidan :ref:`license`."

msgid "General"
msgstr "Allmänt"

msgid ":doc:`sampledata` that is used in the examples of this manual."
msgstr ":doc:`sampledata` that is used in the examples of this manual."

msgid "Pgrouting Concepts"
msgstr "Koncept för injektering"

msgid ":doc:`routingFunctions`"
msgstr ":doc:`routingFunctions`"

msgid ":doc:`allpairs-family`"
msgstr ":doc:`allpairs-family`"

msgid ":doc:`bdDijkstra-family`"
msgstr ":doc:`bdDijkstra-family`"

msgid ":doc:`dijkstra-family`"
msgstr ":doc:`dijkstra-family`"

msgid ":doc:`kruskal-family`"
msgstr ":doc:`kruskal-family`"

msgid ":doc:`pgr_kruskal`"
msgstr ":doc:`pgr_kruskal`"

msgid ":doc:`pgr_kruskalDD`"
msgstr ":doc:`pgr_kruskalDD`"

msgid ":doc:`pgr_degree` - Returns a set of vertices and corresponding count of incident edges to the vertex."
msgstr ":doc:`pgr_degree` - Returns a set of vertices and corresponding count of incident edges to the vertex."

msgid ":doc:`prim-family`"
msgstr ":doc:`prim-family`"

msgid ":doc:`pgr_prim`"
msgstr ":doc:`pgr_prim`"

msgid ":doc:`pgr_primDD`"
msgstr ":doc:`pgr_primDD`"

msgid ":doc:`reference`"
msgstr ":doc:`reference`"

msgid ":doc:`pgr_version`"
msgstr ":doc:`pgr_version`"

msgid ":doc:`pgr_full_version`"
msgstr ":doc:`pgr_full_version`"

msgid ":doc:`utilities-family`"
msgstr ":doc:`utilities-family`"

msgid ":doc:`pgr_extractVertices` - Extracts vertex information based on the edge table information."
msgstr ":doc:`pgr_extractVertices` - Extracts vertex information based on the edge table information."

msgid ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly"
msgstr ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly"

msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other."
msgstr ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other."

msgid ":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each other."
msgstr ":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each other."

msgid ":doc:`withPoints-family`"
msgstr ":doc:`withPoints-family`"

msgid ":doc:`pgr_withPoints` - Route from/to points anywhere on the graph."
msgstr ":doc:`pgr_withPoints` - Route from/to points anywhere on the graph."

msgid ":doc:`pgr_withPointsCost` - Costs of the shortest paths."
msgstr ":doc:`pgr_withPointsCost` - Costs of the shortest paths."

msgid ":doc:`pgr_withPointsCostMatrix` - Costs of the shortest paths."
msgstr ":doc:`pgr_withPointsCostMatrix` - Costs of the shortest paths."

msgid ":doc:`pgr_withPointsKSP` - K shortest paths."
msgstr ":doc:`pgr_withPointsKSP` - K shortest paths."

msgid ":doc:`pgr_withPointsDD` - Driving distance."
msgstr ":doc:`pgr_withPointsDD` - Driving distance."

msgid ":doc:`pgr_withPointsVia` - Via routing"
msgstr ":doc:`pgr_withPointsVia` - Via routing"

msgid "Functions by categories"
msgstr "Funktioner per kategori"

msgid ":doc:`cost-category`"
msgstr ":doc:`cost-category`"

msgid ":doc:`costMatrix-category`"
msgstr ":doc:`costMatrix-category`"

msgid ":doc:`drivingDistance-category`"
msgstr ":doc:`drivingDistance-category`"

msgid ":doc:`KSP-category`"
msgstr ":doc:`KSP-category`"

msgid ":doc:`spanningTree-category`"
msgstr ":doc:`spanningTree-category`"

msgid ":doc:`BFS-category`"
msgstr ":doc:`BFS-category`"

msgid ":doc:`DFS-category`"
msgstr ":doc:`DFS-category`"

msgid ":doc:`withPoints-category`"
msgstr ":doc:`withPoints-category`"

msgid ":doc:`withPoints-family` - Functions based on Dijkstra algorithm."
msgstr ":doc:`withPoints-family` - Functions based on Dijkstra algorithm."

msgid "From the :doc:`TRSP-family`:"
msgstr "Från :doc:`TRSP-familjen <TRSP-family>`:"

msgid "Available Functions but not official pgRouting functions"
msgstr "Tillgängliga funktioner men inte officiella pgRouting-funktioner"

msgid ":doc:`proposed`"
msgstr ":doc:`proposed`"

msgid ":doc:`experimental`"
msgstr ":doc:`experimental`"

msgid ":doc:`release_notes`"
msgstr ":doc:`release_notes`"

msgid "pgRouting 4.0"
msgstr "pgRouting 4.0"

msgid "pgRouting 4.0.0-alpha1 Release Notes"
msgstr "pgRouting 4.0.0-alpha1 Release Notes"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.0.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 4.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.0.0%22>`__"

msgid "Build"
msgstr "Skapa"

msgid "C++ standard is std17"
msgstr "C++-standarden är std17"

msgid "Using this standard, all supported toolchains across our CI matrix will work."
msgstr "Med hjälp av denna standard kommer alla verktygskedjor som stöds i vår CI-matris att fungera."

msgid "The code is not yet modified to use std17:"
msgstr "Koden är ännu inte modifierad för att använda std17:"

msgid "If needed: ``-DCMAKE_CXX_STANDARD=14`` to lower the standard."
msgstr "Om det behövs: ``-DCMAKE_CXX_STANDARD=14`` för att sänka standarden."

msgid "The user's documentation is built by default."
msgstr "Användarens dokumentation byggs som standard."

msgid "The doxygen documentation is built by default."
msgstr "Doxygen-dokumentationen byggs som standard."

msgid "For developers:"
msgstr "För utvecklare:"

msgid "Set `-DUSE_CLANG_TIDY=ON` for clang tidy checks."
msgstr "Ställ in `-DUSE_CLANG_TIDY=ON` för clang tidy-kontroller."

msgid "Tidy checks are done on CI."
msgstr "Ordentliga kontroller görs på CI."

msgid "Documentation build"
msgstr "Uppbyggnad av dokumentation"

msgid "The doxygen documentation is built by default"
msgstr "Doxygen-dokumentationen byggs som standard"

msgid "The HTML documentation is built by default"
msgstr "HTML-dokumentationen byggs som standard"

msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation are built by default"
msgstr "HTML-dokumentationen för översatta språk (en, es, sv, zh_Hans) byggs som standard"

msgid "`WITH-DOC` is not used anymore"
msgstr "`WITH-DOC` används inte längre"

msgid "User Documentation is not built when"
msgstr "Användardokumentation skapas inte när"

msgid "Sphinx is not found"
msgstr "Sfinxen hittas inte"

msgid "When all Sphinx formats are OFF"
msgstr "När alla Sphinx-format är OFF"

msgid "To not build HTML default format: `-DBUILD_HTML=OFF`"
msgstr "För att inte bygga HTML-standardformat: `-DBUILD_HTML=OFF`"

msgid "When all languages are OFF"
msgstr "När alla språk är OFF"

msgid "To build only English: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`"
msgstr "Om du bara vill bygga på engelska: `-DES=OFF -DSV=OFF -DZH_HANS=OFF`"

msgid "Documentation output location: ``build/doc/_build/<format>``"
msgstr "Plats för dokumentationsutdata: ``build/doc/_build/<format>``"

msgid "For example: for HTML output is on `build/doc/_build/html` directory"
msgstr "Till exempel: för HTML-utdata i katalogen `build/doc/_build/html`"

msgid "Developers' Documentation is not built when"
msgstr "Dokumentation för utvecklare byggs inte när"

msgid "Doxygen is not found"
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"

msgid "Combinations signature promoted to official."
msgstr "Kombinationer signatur befordrad till tjänsteman."

msgid "pgr_aStarCost"
msgstr "pgr_aStarCost"

msgid "pgr_bandwidth"
msgstr "pgr_bandwidth"

msgid "New experimental function."
msgstr "Ny experimentell funktion."

msgid "pgr_bdAstar"
msgstr "pgr_bdAstar"

msgid "pgr_bdAstarCost"
msgstr "pgr_bdAstarCost"

msgid "pgr_bdDijkstra"
msgstr "pgr_bdDijkstra"

msgid "Output columns standardized to |short-generic-result|"
msgstr "Utdatakolumner standardiserade till |short-generic-result|"

msgid "pgr_bdDijkstraCost"
msgstr "pgr_bdDijkstraCost"

msgid "pgr_bellmanFord"
msgstr "pgr_bellmanFord"

msgid "pgr_binaryBreadthFirstSearch"
msgstr "pgr_binaryBreadthFirstSearch"

msgid "pgr_bipartite"
msgstr "pgr_bipartite"

msgid "Output columns standardized to |result_node_color|"
msgstr "Utdatakolumner standardiserade till |result_node_color|"

msgid "pgr_boykovKolmogorov"
msgstr "pgr_boykovKolmogorov"

msgid "pgr_breadthFirstSearch"
msgstr "pgr_breadthFirstSearch"

msgid ":"
msgstr ":"

msgid "Standardizing output columns to |result-spantree|"
msgstr "Standardisering av utdatakolumner till |result-spantree|"

msgid "pgr_contraction"
msgstr "pgr_contraction"

msgid "Breaking change, signatures no longer available:"
msgstr "Förändring på gång, signaturer inte längre tillgängliga:"

msgid "pgr_contraction(text,bigint[],integer,bigint[],boolean)"
msgstr "pgr_contraction(text,bigint[],integer,bigint[],boolean)"

msgid "pgr_dagShortestPath"
msgstr "pgr_dagShortestPath"

msgid "pgr_depthFirstSearch"
msgstr "pgr_depthFirstSearch"

msgid "pgr_dijkstra"
msgstr "pgr_dijkstra"

msgid "pgr_dijkstraCost"
msgstr "pgr_dijkstraCost"

msgid "pgr_dijkstraNear"
msgstr "pgr_dijkstraNear"

msgid "Function promoted to official."
msgstr "Funktion befordrad till tjänsteman."

msgid "pgr_dijkstraNearCost"
msgstr "pgr_dijkstraNearCost"

msgid "pgr_dijkstraVia"
msgstr "pgr_dijkstraVia"

msgid "pgr_edgeColoring"
msgstr "pgr_edgeColoring"

msgid "Output columns standardized to |result_edge_color|"
msgstr "Utgångskolumner standardiserade till |result_edge_color|"

msgid "pgr_edgeDisjointPaths"
msgstr "pgr_edgeDisjointPaths"

msgid "Output columns standardized to |generic-result|"
msgstr "Utdatakolumner standardiserade till |generic-result|"

msgid "pgr_edmondsKarp"
msgstr "pgr_edmondsKarp"

msgid "pgr_edwardMoore"
msgstr "pgr_edwardMoore"

msgid "Version 3.2.0"
msgstr "Version 3.2.0"

msgid "New experimental signature:"
msgstr "Ny experimentell signatur:"

msgid "pgr_edwardMoore(Combinations)"
msgstr "pgr_edwardMoore(Combinations)"

msgid "Version 3.0.0"
msgstr "Version 3.0.0"

msgid "pgr_kingOrdering"
msgstr "pgr_kingOrdering"

msgid "pgr_KSP"
msgstr "pgr_KSP"

msgid "All signatures promoted to official."
msgstr "Alla signaturer har uppgraderats till officiella."

msgid "pgr_maxCardinalityMatch"
msgstr "pgr_maxCardinalityMatch"

msgid "pgr_maxCardinalityMatch(text,boolean)"
msgstr "pgr_maxCardinalityMatch(text,boolean)"

msgid "pgr_maxFlow"
msgstr "pgr_maxFlow"

msgid "pgr_pushRelabel"
msgstr "pgr_pushRelabel"

msgid "pgr_sequentialVertexColoring"
msgstr "pgr_sequentialVertexColoring"

msgid "pgr_sloanOrdering"
msgstr "pgr_sloanOrdering"

msgid "pgr_topologicalSort"
msgstr "pgr_topologicalSort"

msgid "Standardize output to |result_node_order|"
msgstr "Standardisera utdata till |result_node_order|"

msgid "pgr_transitiveClosure"
msgstr "pgr_transitiveClosure"

msgid "Standardized output to |result-closure|"
msgstr "Standardisera utdata till |result-closure|"

msgid "pgr_trsp"
msgstr "pgr_trsp"

msgid "pgr_trsp(text,integer,integer,boolean,boolean,text)"
msgstr "pgr_trsp(text,integer,integer,boolean,boolean,text)"

msgid "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)"
msgstr "pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)"

msgid "pgr_trspVia"
msgstr "pgr_trspVia"

msgid "pgr_trspviavertices(text,anyarray,boolean,boolean,text)"
msgstr "pgr_trspviavertices(text,anyarray,boolean,boolean,text)"

msgid "pgr_trspVia_withPoints"
msgstr "pgr_trspVia_withPoints"

msgid "**Driving side** parameter is positional unnamed."
msgstr "**Driving side** parametern är positionell utan namn."

msgid "Valid values depend on kind of graph"
msgstr "Giltiga värden beror på typ av graf"

msgid "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"
msgstr "pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"

msgid "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)"
msgstr "pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)"

msgid "pgr_trsp_withPoints"
msgstr "pgr_trsp_withPoints"

msgid "**Driving side** parameter is positional unnamed and compulsory."
msgstr "**Driving side** parametern är positionell, namnlös och obligatorisk."

msgid "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"
msgstr "pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"

msgid "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)"
msgstr "pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)"

msgid "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)"
msgstr "pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)"

msgid "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)"
msgstr "pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)"

msgid "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)"
msgstr "pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)"

msgid "pgr_TSP"
msgstr "pgr_TSP"

msgid "Results change depending on input order"
msgstr "Resultaten ändras beroende på inmatningsordning"

msgid "Only for undirected graphs"
msgstr "Endast för odelade grafer"

msgid "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
msgstr "pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"

msgid "pgr_TSPeuclidean"
msgstr "pgr_TSPeuclidean"

msgid "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)"
msgstr "pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer, integer,double precision,double precision,double precision,boolean)"

msgid "pgr_turnRestrictedPath"
msgstr "pgr_turnRestrictedPath"

msgid "Output columns standardized to |nksp-result|"
msgstr "Utdatakolumner standardiserade till |nksp-result|"

msgid "pgr_withPoints"
msgstr "pgr_withPoints"

msgid "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)"
msgstr "pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)"

msgid "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)"
msgstr "pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)"

msgid "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)"
msgstr "pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)"

msgid "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)"
msgstr "pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)"

msgid "pgr_withpoints(text,text,text,boolean,character,boolean)"
msgstr "pgr_withpoints(text,text,text,boolean,character,boolean)"

msgid "pgr_withPointsCost"
msgstr "pgr_withPointsCost"

msgid "**Driving side** parameter is unnamed and compulsory."
msgstr "*parametern *Driving side** är inte namngiven och är obligatorisk."

msgid "Output columns standardized to |matrix-result|"
msgstr "Utmatningskolumner standardiserade till |matrix-result|"

msgid "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)"
msgstr "pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)"

msgid "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)"
msgstr "pgr_withpointscost(text,text,anyarray,bigint,boolean,character)"

msgid "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)"
msgstr "pgr_withpointscost(text,text,bigint,anyarray,boolean,character)"

msgid "pgr_withpointscost(text,text,bigint,bigint,boolean,character)"
msgstr "pgr_withpointscost(text,text,bigint,bigint,boolean,character)"

msgid "pgr_withpointscost(text,text,text,boolean,character)"
msgstr "pgr_withpointscost(text,text,text,boolean,character)"

msgid "pgr_withPointsCostMatrix"
msgstr "pgr_withPointsCostMatrix"

msgid "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)"
msgstr "pgr_withpointscostmatrix(text,text,anyarray,boolean,character)"

msgid "pgr_withPointsDD"
msgstr "pgr_withPointsDD"

msgid "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)"
msgstr "pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)"

msgid "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)"
msgstr "pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)"

msgid "pgr_withPointsKSP"
msgstr "pgr_withPointsKSP"

msgid "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"
msgstr "pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"

msgid "pgr_withPointsVia"
msgstr "pgr_withPointsVia"

msgid "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"
msgstr "pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"

msgid "Functions promoted to official"
msgstr "Funktioner som befordrats till tjänsteman"

msgid "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trsp"
msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trsp"

msgid "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trspVia"
msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trspVia"

msgid "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trspVia_withPoints"
msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trspVia_withPoints"

msgid "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trsp_withPoints"
msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__: pgr_trsp_withPoints"

msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPoints"
msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPoints"

msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsCost"
msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsCost"

msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsCostMatrix"
msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsCostMatrix"

msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsDD"
msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsDD"

msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsKSP"
msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsKSP"

msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsVia"
msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__: pgr_withPointsVia"

msgid "`#2983 <https://github.com/pgRouting/pgrouting/issues/2983>`__: pgr_dijkstraNear"
msgstr "`#2983 <https://github.com/pgRouting/pgrouting/issues/2983>`__: pgr_dijkstraNear"

msgid "`#2983 <https://github.com/pgRouting/pgrouting/issues/2983>`__: pgr_dijkstraNearCost"
msgstr "`#2983 <https://github.com/pgRouting/pgrouting/issues/2983>`__: pgr_dijkstraNearCost"

msgid "`#2983 <https://github.com/pgRouting/pgrouting/issues/2983>`__: pgr_dijkstraVia"
msgstr "`#2983 <https://github.com/pgRouting/pgrouting/issues/2983>`__: pgr_dijkstraVia"

msgid "Signatures promoted to official"
msgstr "Underskrifter befordrade till officiella"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_aStar(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_aStar(Kombinationer)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_aStarCost(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_aStarCost(Kombinationer)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdAstar(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdAstar(Kombinationer)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdAstarCost(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdAstarCost(Kombinationer)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdDijkstra(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdDijkstra(Kombinationer)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdDijkstraCost(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_bdDijkstraCost(Kombinationer)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_dijkstra(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_dijkstra(Kombinationer)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_dijkstraCost(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_dijkstraCost(Kombinationer)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_KSP(All signatures)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_KSP(Alla signaturer)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_boykovKolmogorov(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_boykovKolmogorov(Kombinationer)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_edmondsKarp(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_edmondsKarp(Kombinationer)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_maxFlow(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_maxFlow(Kombinationer)"

msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_pushRelabel(Combinations)"
msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2718>`__: pgr_pushRelabel(Kombinationer)"

msgid "New experimental functions."
msgstr "Nya experimentella funktioner."

msgid "Metrics"
msgstr "Mätvärde"

msgid "`#2951 <https://github.com/pgRouting/pgrouting/issues/2951>`__: pgr_bandwidth"
msgstr "`#2951 <https://github.com/pgRouting/pgrouting/issues/2951>`__: pgr_bandbredd"

msgid "Ordering"
msgstr "Ordning"

msgid "`#2954 <https://github.com/pgRouting/pgrouting/issues/2954>`__: pgr_kingOrdering"
msgstr "`#2954 <https://github.com/pgRouting/pgrouting/issues/2954>`__: pgr_kingOrdering"

msgid "`#2955 <https://github.com/pgRouting/pgrouting/issues/2955>`__: pgr_sloanOrdering"
msgstr "`#2955 <https://github.com/pgRouting/pgrouting/issues/2955>`__: pgr_sloanOrdering"

msgid "SQL signatures and output standardization"
msgstr "SQL-signaturer och standardisering av utdata"

msgid "`#2904 <https://github.com/pgRouting/pgrouting/issues/2904>`__: Standardize output columns of functions with different output"
msgstr "`#2904 <https://github.com/pgRouting/pgrouting/issues/2904>`__: Standardisera utdatakolumner för funktioner med olika utdata"

msgid "columns within overloads"
msgstr "kolumner inom överbelastningar"

msgid "Standardized to |short-generic-result|"
msgstr "Standardiserad till |short-generic-result|"

msgid "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__: pgr_withPoints"
msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__: pgr_withPoints"

msgid "`#2906 <https://github.com/pgRouting/pgrouting/issues/2906>`__: pgr_bdDijkstra"
msgstr "`#2906 <https://github.com/pgRouting/pgrouting/issues/2906>`__: pgr_bdDijkstra"

msgid "`#2907 <https://github.com/pgRouting/pgrouting/issues/2907>`__: pgr_bellmanFord"
msgstr "`#2907 <https://github.com/pgRouting/pgrouting/issues/2907>`__: pgr_bellmanFord"

msgid "`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__: pgr_binaryBreadthFirstSearch"
msgstr "`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__: pgr_binaryBreadthFirstSearch"

msgid "`#2910 <https://github.com/pgRouting/pgrouting/issues/2910>`__: pgr_edwardMoore"
msgstr "`#2910 <https://github.com/pgRouting/pgrouting/issues/2910>`__: pgr_edwardMoore"

msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__: pgr_dagShortestPath"
msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__: pgr_dagShortestPath"

msgid "Standardized to |matrix-result|"
msgstr "Standardiserat till |matrix-result|"

msgid "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__: pgr_withPointsCost"
msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__: pgr_withPointsCost"

msgid "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__: pgr_withPointsCostMatrix"
msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__: pgr_withPointsCostMatrix"

msgid "Standardized to |generic-result|"
msgstr "Standardiserat till |generic-result|"

msgid "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__: pgr_edgeDisjointPaths"
msgstr "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__: pgr_edgeDisjointPaths"

msgid "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__: pgr_turnRestrictedPath"
msgstr "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__: pgr_turnRestrictedPath"

msgid "Standardized to |result_edge_color|"
msgstr "Standardiserad till |result_edge_color|"

msgid "`#2924 <https://github.com/pgRouting/pgrouting/issues/2924>`__: pgr_edgeColoring"
msgstr "`#2924 <https://github.com/pgRouting/pgrouting/issues/2924>`__: pgr_edgeColoring"

msgid "Standardized to |result_node_color|"
msgstr "Standardiserad till |result_node_color|"

msgid "`#2924 <https://github.com/pgRouting/pgrouting/issues/2924>`__: pgr_bipartite"
msgstr "`#2924 <https://github.com/pgRouting/pgrouting/issues/2924>`__: pgr_bipartite"

msgid "`#2927 <https://github.com/pgRouting/pgrouting/issues/2927>`__: pgr_sequentialVertexColoring"
msgstr "`#2927 <https://github.com/pgRouting/pgrouting/issues/2927>`__: pgr_sequentialVertexColoring"

msgid "Standardized to |result-spantree|"
msgstr "Standardiserad till |result-spantree|"

msgid "`#2931 <https://github.com/pgRouting/pgrouting/issues/2931>`__: pgr_breadthFirstSearch"
msgstr "`#2931 <https://github.com/pgRouting/pgrouting/issues/2931>`__: pgr_breadthFirstSearch"

msgid "`#2931 <https://github.com/pgRouting/pgrouting/issues/2931>`__: pgr_depthFirstSearch"
msgstr "`#2931 <https://github.com/pgRouting/pgrouting/issues/2931>`__: pgr_depthFirstSearch"

msgid "Standardized to |result_node_order|"
msgstr "Standardisera till |result_node_order|"

msgid "`#2934 <https://github.com/pgRouting/pgrouting/issues/2934>`__: pgr_topologicalSort"
msgstr "`#2934 <https://github.com/pgRouting/pgrouting/issues/2934>`__: pgr_topologicalSort"

msgid "Standardized to |result-closure|"
msgstr "Standardisera till |result-closure|"

msgid "`#2934 <https://github.com/pgRouting/pgrouting/issues/2934>`__: pgr_transitiveClosure"
msgstr "`#2934 <https://github.com/pgRouting/pgrouting/issues/2934>`__: pgr_transitiveClosure"

msgid "Removal of SQL deprecated signatures"
msgstr "Borttagning av SQL-signaturer som inte längre är aktuella"

msgid "`#2798 <https://github.com/pgRouting/pgrouting/issues/2798>`__: pgr_contraction"
msgstr "`#2798 <https://github.com/pgRouting/pgrouting/issues/2798>`__: pgr_kontraktion"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__: pgr_trsp"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__: pgr_trsp"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__: pgr_trspVia"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__: pgr_trspVia"

msgid "`#2888 <https://github.com/pgRouting/pgrouting/issues/2888>`__: pgr_findCloseEdges"
msgstr "`#2888 <https://github.com/pgRouting/pgrouting/issues/2888>`__: pgr_findCloseEdges"

msgid "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)"
msgstr "pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)"

msgid "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)"
msgstr "pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)"

msgid "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__: pgr_withPointsDD"
msgstr "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__: pgr_withPointsDD"

msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__: pgr_withPointsKSP"
msgstr "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__: pgr_withPointsKSP"

msgid "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__: pgr_maxCardinalityMatch"
msgstr "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__: pgr_maxCardinalityMatch"

msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__: pgr_TSP"
msgstr "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__: pgr_TSP"

msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__: pgr_TSPeuclidean"
msgstr "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__: pgr_TSPeuclidean"

msgid "Removal of SQL deprecated functions"
msgstr "Borttagning av föråldrade SQL-funktioner"

msgid "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__: pgr_trspViaedges"
msgstr "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__: pgr_trspViaedges"

msgid "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__: pgr_trspViaVertices"
msgstr "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__: pgr_trspViaVertices"

msgid "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__: pgr_alphaShape"
msgstr "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__: pgr_alphaShape"

msgid "`#2751 <https://github.com/pgRouting/pgrouting/issues/2751>`__: pgr_createTopology"
msgstr "`#2751 <https://github.com/pgRouting/pgrouting/issues/2751>`__: pgr_createTopology"

msgid "`#2752 <https://github.com/pgRouting/pgrouting/issues/2752>`__: pgr_analyzeGraph"
msgstr "`#2752 <https://github.com/pgRouting/pgrouting/issues/2752>`__: pgr_analyzeGraph"

msgid "`#2755 <https://github.com/pgRouting/pgrouting/issues/2755>`__: pgr_analyzeOneWay"
msgstr "`#2755 <https://github.com/pgRouting/pgrouting/issues/2755>`__: pgr_analyzeOneWay"

msgid "`#2827 <https://github.com/pgRouting/pgrouting/issues/2827>`__: pgr_createVerticesTable"
msgstr "`#2827 <https://github.com/pgRouting/pgrouting/issues/2827>`__: pgr_createVerticesTable"

msgid "`#2886 <https://github.com/pgRouting/pgrouting/issues/2886>`__: pgr_nodeNetwork"
msgstr "`#2886 <https://github.com/pgRouting/pgrouting/issues/2886>`__: pgr_nodeNetwork"

msgid "Removal of SQL deprecated internal functions"
msgstr "Borttagning av interna funktioner i SQL som inte längre är aktuella"

msgid "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ _pgr_alphaShape(text,double precision)"
msgstr "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ _pgr_alphaShape(text,dubbel precision)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_checkVertTab(text,text[],integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_checkVertTab(text,text[],heltal,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_createIndex(text,text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_createIndex(text,text,text,heltal,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_createIndex(text,text,text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_createIndex(text,text,text,text,heltal,text)"

msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagShortestPath(text,anyarray,anyarray,boolean,boolean)"
msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagShortestPath(text,valfri matris,valfri matris,boolean,boolean)"

msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagShortestPath(text,text,boolean,boolean)"
msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagShortestPath(text,text,boolean,boolean)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstraNear(text,anyarray,anyarray,bigint,boolean)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstraNear(text,valfri matris,valfri matris,bigint,boolean)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstraNear(text,anyarray,bigint,bigint,boolean)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstraNear(text,bigint,anyarray,bigint,boolean)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstraNear(text,bigint,valfri matris,bigint,boolean)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)"

msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,text,boolean,boolean,boolean)"
msgstr "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstra(text,text,boolean,boolean,boolean)"

msgid "`#2735 <https://github.com/pgRouting/pgrouting/issues/2735>`__ _pgr_drivingDistance(text,anyarray,double precision,boolean,boolean)"
msgstr "`#2735 <https://github.com/pgRouting/pgrouting/issues/2735>`__ _pgr_drivingDistance(text,valfri matris,dubbel precision,boolean,boolean)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_endPoint(geometry)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_endPoint(geometry)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnName(text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnName(text,text,heltal,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnName(text,text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnName(text,text,text,heltal,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnType(text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnType(text,text,heltal,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnType(text,text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getColumnType(text,text,text,heltal,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getTableName(text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ __pgr_getTableName(text,heltal,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_isColumnIndexed(text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_isColumnIndexed(text,text,heltal,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_isColumnIndexed(text,text,text,integer,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_isColumnIndexed(text,text,text,heltal,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_isColumnIntable(text,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_isColumnIntable(text,text)"

msgid "`#2745 <https://github.com/pgRouting/pgrouting/issues/2745>`__ _pgr_kruskal(text,anyarray,text,bigint,double precision)"
msgstr "`#2745 <https://github.com/pgRouting/pgrouting/issues/2745>`__ _pgr_kruskal(text,valfri matris,text,bigint,dubbel precision)"

msgid "`#2897 <https://github.com/pgRouting/pgrouting/issues/2897>`__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)"
msgstr "`#2897 <https://github.com/pgRouting/pgrouting/issues/2897>`__ _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean,boolean)"

msgid "`#2897 <https://github.com/pgRouting/pgrouting/issues/2897>`__ _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)"
msgstr "`#2897 <https://github.com/pgRouting/pgrouting/issues/2897>`__ _pgr_ksp(text,bigint,bigint,heltal,boolean,boolean)"

msgid "`#2897 <https://github.com/pgRouting/pgrouting/issues/2897>`__ _pgr_ksp(text,text,integer,boolean,boolean)"
msgstr "`#2897 <https://github.com/pgRouting/pgrouting/issues/2897>`__ _pgr_ksp(text,text,heltal,boolean,boolean)"

msgid "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__ _pgr_maxCardinalityMatch(text,boolean)"
msgstr "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__ _pgr_maxCardinalityMatch(text,boolean)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_msg(integer,text,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_msg(heltal,text,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_onerror(boolean,integer,text,text,text,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_onerror(boolean,heltal,text,text,text,text,text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_pointtoid(geometry,double precision,text,integer)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_pointtoid(geometri,dubbel precision,text,heltal)"

msgid "`#2743 <https://github.com/pgRouting/pgrouting/issues/2743>`__ _pgr_prim(text,anyarray,text,bigint,double precision)"
msgstr "`#2743 <https://github.com/pgRouting/pgrouting/issues/2743>`__ _pgr_prim(text,valfri matris,text,bigint,dubbel precision)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_quote_ident(text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_quote_ident(text)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_startPoint(geometry)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_startPoint(geometry)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,anyarray,anyarray,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,valfri matris,valfri matris,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,anyarray,bigint,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,valfri matris,bigint,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,bigint,anyarray,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,bigint,valfri matris,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,bigint,bigint,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _pgr_trsp(text,text,bigint,bigint,boolean)"

msgid "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__ _pgr_trspViaVertices(text,integer[],boolean,boolean,text)"
msgstr "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__ _pgr_trspViaVertices(text,heltal[],boolean,boolean,text)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trsp_withPoints(text,text,text,valfri matris,valfri matris,boolean,tecken,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trsp_withPoints(text,text,text,text,boolean,tecken,boolean)"

msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ _pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
msgstr "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ _pgr_tspEuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)"

msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
msgstr "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ _pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)"

msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_versionLess(text,text)"
msgstr "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_versionLess(text,text)"

msgid "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ _pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)"
msgstr "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ _pgr_withPointsDD(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)"

msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withPointsKSP(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)"
msgstr "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withPointsKSP(text,text,valfri matris,valfri matris,heltal,tecken,boolean,boolean,boolean,boolean,boolean)"

msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"
msgstr "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"

msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withPointsKSP(text,text,text,integer,character,boolean,boolean,boolean)"
msgstr "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withPointsKSP(text,text,text,heltal,tecken,boolean,boolean,boolean,boolean)"

msgid "`#2741 <https://github.com/pgRouting/pgrouting/issues/2741>`__ _pgr_withPointsVia(text,bigint[],double precision[],boolean)"
msgstr "`#2741 <https://github.com/pgRouting/pgrouting/issues/2741>`__ _pgr_withPointsVia(text,bigint[],dubbel precision[],boolean)"

msgid "`#2741 <https://github.com/pgRouting/pgrouting/issues/2741>`__ _pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"
msgstr "`#2741 <https://github.com/pgRouting/pgrouting/issues/2741>`__ _pgr_withPointsVia(text,text,valfri matris,boolean,boolean,boolean,boolean,tecken,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _trsp(text,text,anyarray,anyarray,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _trsp(text,text,valfri matris,valfri matris,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _v4trsp(text,text,anyarray,anyarray,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _v4trsp(text,text,valfri matris,valfri matris,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _v4trsp(text,text,text,boolean)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _v4trsp(text,text,text,boolean)"

msgid "Summary of functions and signatures no longer on pgrouting"
msgstr "Sammanfattning av funktioner och signaturer som inte längre finns på pgrouting"

msgid "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ pgr_alphashape(geometry,double precision)"
msgstr "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ pgr_alphashape(geometri,dubbel precision)"

msgid "`#2752 <https://github.com/pgRouting/pgrouting/issues/2752>`__ pgr_analyzegraph(text,double precision,text,text,text,text,text)"
msgstr "`#2752 <https://github.com/pgRouting/pgrouting/issues/2752>`__ pgr_analyzegraph(text,dubbel precision,text,text,text,text,text,text)"

msgid "`#2755 <https://github.com/pgRouting/pgrouting/issues/2755>`__ pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)"
msgstr "`#2755 <https://github.com/pgRouting/pgrouting/issues/2755>`__ pgr_analyzeoneway(text,text[],text[],text[],text[],text[],boolean,text,text,text)"

msgid "`#2798 <https://github.com/pgRouting/pgrouting/issues/2798>`__ pgr_contraction(text,bigint[],integer,bigint[],boolean)"
msgstr "`#2798 <https://github.com/pgRouting/pgrouting/issues/2798>`__ pgr_contraction(text,bigint[],integer,bigint[],boolean)"

msgid "`#2751 <https://github.com/pgRouting/pgrouting/issues/2751>`__ pgr_createtopology(text,double precision,text,text,text,text,text,boolean)"
msgstr "`#2751 <https://github.com/pgRouting/pgrouting/issues/2751>`__ pgr_createtopology(text,dubbel precision,text,text,text,text,text,boolean)"

msgid "`#2827 <https://github.com/pgRouting/pgrouting/issues/2827>`__ pgr_createverticestable(text,text,text,text,text)"
msgstr "`#2827 <https://github.com/pgRouting/pgrouting/issues/2827>`__ pgr_createverticestable(text,text,text,text,text,text)"

msgid "`#2888 <https://github.com/pgRouting/pgrouting/issues/2888>`__ pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)"
msgstr "`#2888 <https://github.com/pgRouting/pgrouting/issues/2888>`__ pgr_findcloseedges(text,geometry,dubbel precision,heltal,boolean,boolean)"

msgid "`#2888 <https://github.com/pgRouting/pgrouting/issues/2888>`__ pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)"
msgstr "`#2888 <https://github.com/pgRouting/pgrouting/issues/2888>`__ pgr_findcloseedges(text,geometry[],dubbel precision,heltal,boolean,boolean)"

msgid "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__ pgr_maxCardinalityMatch(text,boolean)"
msgstr "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__ pgr_maxCardinalityMatch(text,boolean)"

msgid "`#2886 <https://github.com/pgRouting/pgrouting/issues/2886>`__ pgr_nodenetwork(text,double precision,text,text,text,text,boolean)"
msgstr "`#2886 <https://github.com/pgRouting/pgrouting/issues/2886>`__ pgr_nodenetwork(text,dubbel precision,text,text,text,text,text,boolean)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ pgr_trsp(text,integer,integer,boolean,boolean,text)"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ pgr_trsp(text,heltal,heltal,boolean,boolean,text)"

msgid "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__ pgr_trspViaedges(text,integer[],double precision[],boolean,boolean,text)"
msgstr "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__ pgr_trspViaedges(text,heltal[],dubbel precision[],boolean,boolean,text)"

msgid "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__ pgr_trspViaVertices(text,anyarray,boolean,boolean,text)"
msgstr "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__ pgr_trspViaVertices(text,valfri matris,boolean,boolean,text)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trspVia_withPoints(text,text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,valfri matris,valfri matris,boolean,tecken,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,anyarray,bigint,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,bigint,anyarray,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,bigint,bigint,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withPoints(text,text,text,text,boolean,character,boolean)"

msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ pgr_tspEuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
msgstr "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ pgr_tspEuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)"

msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
msgstr "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCostMatrix(text,text,anyarray,boolean,character)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCostMatrix(text,text,valfri matris,boolean,tecken)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,anyarray,anyarray,boolean,character)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,valfri matris,valfri matris,boolean,tecken)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,anyarray,bigint,boolean,character)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,valfri matris,bigint,boolean,tecken)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,bigint,anyarray,boolean,character)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,bigint,valfri matris,boolean,tecken)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,bigint,bigint,boolean,character)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,text,boolean,character)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsCost(text,text,text,boolean,tecken)"

msgid "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ pgr_withPointsDD(text,text,anyarray,double precision,boolean,character,boolean,boolean)"
msgstr "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ pgr_withPointsDD(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)"

msgid "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ pgr_withPointsDD(text,text,bigint,double precision,boolean,character,boolean)"
msgstr "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ pgr_withPointsDD(text,text,bigint,dubbel precision,boolean,tecken,boolean)"

msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"
msgstr "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ pgr_withPointsKSP(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,anyarray,anyarray,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,valfri matris,valfri matris,boolean,tecken,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,anyarray,bigint,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,valfri matris,bigint,boolean,tecken,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,bigint,anyarray,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,bigint,valfri matris,boolean,tecken,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,bigint,bigint,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,bigint,bigint,boolean,tecken,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,text,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPoints(text,text,text,boolean,tecken,boolean)"

msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsVia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"
msgstr "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withPointsVia(text,text,valfri matris,boolean,boolean,boolean,boolean,tecken,boolean)"

msgid "Code enhancements"
msgstr "Förbättringar av koden"

msgid "Removal of unused C/C++ code"
msgstr "Borttagning av oanvänd C/C++-kod"

msgid "Refactor the Script to build the update PostgreSQL file."
msgstr "Refaktorera skriptet för att bygga uppdateringsfilen PostgreSQL."

msgid "One process & driver for:"
msgstr "En process & drivrutin för:"

msgid "allpairs: johnson and Floyd-Warshall"
msgstr "alla par: johnson och Floyd-Warshall"

msgid "Shortest path: Dijkstra and withPoints using Dijkstra"
msgstr "Kortaste vägen: Dijkstra och withPoints med hjälp av Dijkstra"

msgid "Deprecation of internal C/C++ functions"
msgstr "Avveckling av interna C/C++-funktioner"

msgid "Deprecated functions are substituted by new function."
msgstr "Föråldrade funktioner ersätts av nya funktioner."

msgid "_pgr_drivingDistance => _pgr_drivingDistancev4"
msgstr "_pgr_drivingDistance => _pgr_drivingDistancev4"

msgid "_pgr_withPointsDD => _pgr_withPointsddv4"
msgstr "_pgr_medPointsDD => _pgr_medPointsddv4"

msgid "_pgr_kruskal => _pgr_kruskalv4"
msgstr "_pgr_kruskal => _pgr_kruskalv4"

msgid "_pgr_prim => _pgr_primv4"
msgstr "_pgr_prim => _pgr_primv4"

msgid "_pgr_dijkstra => _pgr_dijkstra_v4"
msgstr "_pgr_dijkstra => _pgr_dijkstra_v4"

msgid "_pgr_withPointsKSP => _pgr_withPointsKSP_v4"
msgstr "_pgr_withPointsKSP => _pgr_withPointsKSP_v4"

msgid "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4"
msgstr "_pgr_trspVia_withPoints => _pgr_trspVia_withPoints_v4"

msgid "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4"
msgstr "_pgr_trsp_withPoints => _pgr_trsp_withPoints_v4"

msgid "_pgr_withPointsVia => _pgr_withPointsvia_v4"
msgstr "_pgr_medPointsVia => _pgr_medPointsvia_v4"

msgid "Internal C/C++ functions in legacy"
msgstr "Interna C/C++-funktioner i äldre"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _trsp"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _trsp"

msgid "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _v4trsp"
msgstr "`#2683 <https://github.com/pgRouting/pgrouting/issues/2683>`__ _v4trsp"

msgid "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ _pgr_alphaShape"
msgstr "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ _pgr_alphaShape"

msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagShortestPath"
msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagShortestPath"

msgid "All releases"
msgstr "Alla utgåvor"

msgid "Kruskal - Family of functions"
msgstr "Kruskal - Familj av funktioner"

msgid "Kruskal's algorithm is a greedy minimum spanning tree algorithm that in each cycle finds and adds the edge of the least possible weight that connects any two trees in the forest."
msgstr "Kruskals algoritm är en \"greedy minimum spanning tree\"-algoritm som i varje cykel hittar och lägger till den kant med minsta möjliga vikt som förbinder två träd i skogen."

msgid "**The main Characteristics are:**"
msgstr "**De viktigaste egenskaperna är:**"

msgid "The total weight of all the edges in the tree or forest is minimized."
msgstr "Den totala vikten för alla kanter i trädet eller skogen minimeras."

msgid "Kruskal's running time: :math:`O(E * log E)`"
msgstr "Kruskals körtid: :math:`O(E * log E)`"

msgid "Metrics - Family of functions"
msgstr "Metrics - Familj av funktioner"

msgid "Migration guide"
msgstr "Migrationsguide"

msgid "Several functions are having changes on the signatures, and/or have been replaced by new functions."
msgstr "Flera funktioner har förändringar på signaturerna och/eller har ersatts av nya funktioner."

msgid "Results can be different because of the changes."
msgstr "Resultaten kan bli annorlunda på grund av förändringarna."

msgid "All deprecated functions will be removed on next major version 4.0.0"
msgstr "Alla föråldrade funktioner kommer att tas bort i nästa större version 4.0.0"

msgid "Migration to standardized columns"
msgstr "Migrering till standardiserade kolumner"

msgid "There has been an effort to standardize function output columns names and types."
msgstr "Det har gjorts försök att standardisera namn och typer på kolumner för funktionsutdata."

msgid ":ref:`pgRouting-concepts:Result columns for cost functions`"
msgstr ":ref:`pgRouting-concepts:Result columns for cost functions`"

msgid "|matrix-result|"
msgstr "|matrix-result|"

msgid ":ref:`pgRouting-concepts:Result columns for single path functions`"
msgstr ":ref:`pgRouting-concepts:Result columns for single path functions`"

msgid "|short-generic-result|"
msgstr "|short-generic-result|"

msgid ":ref:`pgRouting-concepts:Result columns for spanning tree functions`"
msgstr ":ref:`pgRouting-concepts:Result columns for spanning tree functions`"

msgid "|result-spantree|"
msgstr "|result-spantree|"

msgid "Function"
msgstr "Funktion"

msgid ":doc:`pgr_dijkstra`"
msgstr ":doc:`pgr_dijkstra`"

msgid "`Migration of single path functions`_"
msgstr "`Migrering av funktioner med en enda sökväg`_"

msgid ":doc:`pgr_aStar`"
msgstr ":doc:`pgr_aStar`"

msgid ":doc:`pgr_bdAstar`"
msgstr ":doc:`pgr_bdAstar`"

msgid ":doc:`pgr_drivingDistance`"
msgstr ":doc:`pgr_drivingDistance`"

msgid "`Migration of spanning tree functions`_"
msgstr "`Migration av funktioner för spänningsträd`_"

msgid ":doc:`pgr_withPointsDD`"
msgstr ":doc:`pgr_withPointsDD`"

msgid ":doc:`pgr_bdDijkstra`"
msgstr ":doc:`pgr_bdDijkstra`"

msgid ":doc:`pgr_binaryBreadthFirstSearch`"
msgstr ":doc:`pgr_binaryBreadthFirstSearch`"

msgid ":doc:`pgr_bipartite`"
msgstr ":doc:`pgr_bipartite`"

msgid "`Migration of output column name change`_"
msgstr "`Migrering av namnändring för utdatakolumn`_"

msgid ":doc:`pgr_breadthFirstSearch`"
msgstr ":doc:`pgr_breadthFirstSearch`"

msgid ":doc:`pgr_depthFirstSearch`"
msgstr ":doc:`pgr_depthFirstSearch`"

msgid ":doc:`pgr_edgeColoring`"
msgstr ":doc:`pgr_edgeColoring`"

msgid "`Migration of multiple paths functions`_"
msgstr "`Migrering av funktioner för flera sökvägar`_"

msgid ":doc:`pgr_sequentialVertexColoring`"
msgstr ":doc:`pgr_sequentialVertexColoring`"

msgid ":doc:`pgr_topologicalSort`"
msgstr ":doc:`pgr_topologicalSort`"

msgid ":doc:`pgr_withPoints`"
msgstr ":doc:`pgr_withPoints`"

msgid "`Migration of cost functions`_"
msgstr "`Migrering av kostnadsfunktioner`_"

msgid "Migration of cost functions"
msgstr "Migrering av kostnadsfunktioner"

msgid "The standardized :ref:`pgRouting-concepts:Result columns for cost functions` are |matrix-result|"
msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for cost functions` är |matrix-result|"

msgid "The following functions need to be migrated when they are being used in an application."
msgstr "Följande funktioner måste migreras när de används i en applikation."

msgid "Version"
msgstr "Version"

msgid "From"
msgstr "Från"

msgid "``pgr_withPointsCost``"
msgstr "``pgr_withPointsCost``"

msgid "v < 4.0"
msgstr "v < 4.0"

msgid "|matrix-pid|"
msgstr "|matrix-pid|"

msgid "``pgr_withPointsCostMatrix``"
msgstr "``pgr_withPointsCostMatrix``"

msgid "**to** |matrix-result|"
msgstr "**till** |matrix-result|"

msgid "Migration of |matrix-pid|"
msgstr "Migrering av |matrix-pid|"

msgid "Signatures to be migrated:"
msgstr "Signaturer som ska migreras:"

msgid "One to One"
msgstr "En till en"

msgid "One to Many"
msgstr "En till många"

msgid "Many to One"
msgstr "Många till en"

msgid "Many to Many"
msgstr "Många till många"

msgid "Combinations"
msgstr "Kombinationer"

msgid "Breaking change"
msgstr "Brytande förändring"

msgid "If using ``pgr_withPointsCost``: column names must be changed after updating pgRouting"
msgstr "Om du använder ``pgr_withPointsCost``: kolumnnamn måste ändras efter uppdatering av pgRouting"

msgid "New output columns are |matrix-result|"
msgstr "Nya utdatakolumner är |matrix-result|"

msgid "To get the old version column names: rename ``start_vid`` to ``start_pid`` and ``end_vid`` to ``end_pid``."
msgstr "För att få kolumnnamnen i den gamla versionen: byt namn på ``start_vid`` till ``start_pid`` och ``end_vid`` till ``end_pid``."

msgid "Examples"
msgstr "Exempel"

msgid "Examples for One to One for cost functions"
msgstr "Exempel på One to One för kostnadsfunktioner"

msgid "Using ``pgr_withPointsCost``"
msgstr "Använda ``pgr_withPointsCost``"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#one-to-one>`__ example."
msgstr "Migrering av `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#one-to-one>`__ exempel."

msgid "from"
msgstr "från"

msgid "to"
msgstr "till"

msgid "Examples for One to Many for cost functions"
msgstr "Exempel på One to Many för kostnadsfunktioner"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#one-to-many>`__ example."
msgstr "Migrering av `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#one-to-many>`__ exempel."

msgid "Examples for Many to One for cost functions"
msgstr "Exempel på Many to One för kostnadsfunktioner"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#many-to-one>`__ example."
msgstr "Migrering av `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#many-to-one>`__ exempel."

msgid "Examples for Many to Many for cost functions"
msgstr "Exempel på Many to Many för kostnadsfunktioner"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#many-to-many>`__ example."
msgstr "Migrering av `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#many-to-many>`__ exempel."

msgid "Examples for Combinations for cost functions"
msgstr "Exempel på Kombinationer för kostnadsfunktioner"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#combinations>`__ example."
msgstr "Migrering av `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPointsCost.html#combinations>`__ exempel."

msgid "Migration of multiple paths functions"
msgstr "Migrering av funktioner för flera banor"

msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |nksp-result|"
msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for single path functions` är |nksp-result|"

msgid "``pgr_KSP``"
msgstr "``pgr_KSP``"

msgid "v < 3.6"
msgstr "v < 3.6"

msgid ":ref:`from_ksp_result`"
msgstr ":ref:`from_ksp_result`"

msgid "``pgr_edgeDisjointPaths``"
msgstr "``pgr_edgeDisjointPaths``"

msgid ":ref:`from_result_disjoint`"
msgstr ":ref:`from_result_disjoint`"

msgid "Migration of |ksp-result|"
msgstr "Migrering av |ksp-result|"

msgid "|nksp-result|"
msgstr "|nksp-result|"

msgid "Before updating pgRouting, enumerate the |ksp-result|"
msgstr "Innan du uppdaterar pgRouting, räkna upp |ksp-result|"

msgid "One to One example using ``pgr_KSP``"
msgstr "Ett till ett exempel med hjälp av ``pgr_KSP``"

msgid "Using `this <https://docs.pgrouting.org/3.5/en/pgr_KSP.html#signatures>`__ example."
msgstr "Använda `det här <https://docs.pgrouting.org/3.5/en/pgr_KSP.html#signatures>`__ exemplet."

msgid "Migration of |result-disjoint|"
msgstr "Migrering av |result-disjoint|"

msgid "Before updating pgRouting, enumerate the |result-disjoint|"
msgstr "Innan du uppdaterar pgRouting, räkna upp |result-disjoint|"

msgid "Skip when applicable, ``start_vid``"
msgstr "Hoppa över när det är tillämpligt, ``start_vid``"

msgid "Skip when applicable, ``end_vid``"
msgstr "Hoppa över när det är tillämpligt, ``end_vid``"

msgid "One to One example using ``pgr_edgeDisjointPaths``"
msgstr "Ett till ett exempel med hjälp av ``pgr_edgeDisjointPaths``"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.6/en/pgr_edgeDisjointPaths.html#one-to-one>`__ example."
msgstr "Migrering av `this v3.8 <https://docs.pgrouting.org/3.6/en/pgr_edgeDisjointPaths.html#one-to-one>`__ exempel."

msgid "Before updating pgRouting enumerate the columns: |ksp-result|"
msgstr "Innan du uppdaterar pgRouting räkna upp kolumnerna: |ksp-result|"

msgid "Migration of single path functions"
msgstr "Migrering av funktioner med en enda sökväg"

msgid "The standardized :ref:`pgRouting-concepts:Result columns for single path functions` are |short-generic-result|"
msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for single path functions` är |short-generic-result|"

msgid "``pgr_dijkstra``"
msgstr "``pgr_dijkstra``"

msgid "v < 3.5"
msgstr "v < 3.5"

msgid "|old-generic-result|"
msgstr "|old-generic-result|"

msgid "``pgr_aStar``"
msgstr "``pgr_aStar``"

msgid "``pgr_bdDijkstra``"
msgstr "``pgr_bdDijkstra``"

msgid "``pgr_bellmanFord``"
msgstr "``pgr_bellmanFord``"

msgid "``pgr_dagShortestPath``"
msgstr "``pgr_dagShortestPath``"

msgid "|result-1-1|"
msgstr "|result-1-1|"

msgid "``pgr_edwardMoore``"
msgstr "``pgr_edwardMoore``"

msgid "``pgr_withPoints``"
msgstr "``pgr_withPoints``"

msgid "|old-pid-result|"
msgstr "|old-pid-result|"

msgid "Migration of |old-generic-result|"
msgstr "Migrering av |old-generic-result|"

msgid "Before updating pgRouting, enumerate the corresponding columns of the signature"
msgstr "Innan du uppdaterar pgRouting, räkna upp motsvarande kolumner i signaturen"

msgid "Migration of |old-pid-result|"
msgstr "Migrering av |old-pid-result|"

msgid "To get the old version column names, depending on the signature:"
msgstr "För att få den gamla versionen kolumnnamn, beroende på signaturen:"

msgid "Filter out the columns: ``start_vid`` and/or ``end_vid``"
msgstr "Filtrera bort kolumnerna: ``start_vid`` och/eller ``slut_vid``"

msgid "Rename the columns:"
msgstr "Byt namn på kolumnerna:"

msgid "``start_vid`` to ``start_pid``"
msgstr "``start_vid`` till ``start_pid``"

msgid "``end_vid`` to ``end_pid``"
msgstr "``slut_vid`` till ``slut_pid``"

msgid "If using ``pgr_withPoints``: column names must be changed after updating pgRouting"
msgstr "Om du använder ``pgr_withPoints``: kolumnnamn måste ändras efter uppdatering av pgRouting"

msgid "Migration of |result-1-1|"
msgstr "Migrering av |result-1-1|"

msgid "To get the old version column names:"
msgstr "För att få kolumnnamnen i den gamla versionen:"

msgid "Filter out the columns: ``start_vid`` and ``end_vid``"
msgstr "Filtrera bort kolumnerna: ``start_vid`` och ``slut_vid``"

msgid "Examples with One to One with one route result"
msgstr "Exempel med en till en med en rutt resultat"

msgid "Using ``pgr_aStar``"
msgstr "Använda ``pgr_aStar``"

msgid "Migrating `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_aStar.html#one-to-one>`__ example."
msgstr "Migrering av `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_aStar.html#one-to-one>`__ exempel."

msgid "Before updating pgRouting enumerate the columns: |result-1-1|"
msgstr "Innan du uppdaterar pgRouting räkna upp kolumnerna: |result-1-1|"

msgid "Using ``pgr_bdDijkstra``"
msgstr "Använda ``pgr_bdDijkstra``"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_bdDijkstra.html#one-to-one>`__ example."
msgstr "Migrering av `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_bdDijkstra.html#one-to-one>`__ exempel."

msgid "Using ``pgr_DAGshortestPath``"
msgstr "Använda ``pgr_DAGshortestPath``"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-one>`__ example."
msgstr "Migrering av `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_dagShortestPath.html#one-to-one>`__ exempel."

msgid "This applies to all signatures of ``pgr_DAGshortestPath``"
msgstr "Detta gäller för alla signaturer av ``pgr_DAGshortestPath``"

msgid "Examples for One to Many with one route result"
msgstr "Exempel för One to Many med ett ruttresultat"

msgid "Using ``pgr_bdAstar``"
msgstr "Använda ``pgr_bdAstar``"

msgid "Migrating `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_bdAstar.html#one-to-many>`__ example."
msgstr "Migrering av `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_bdAstar.html#one-to-many>`__ exempel."

msgid "Before updating pgRouting enumerate the columns: |result-1-m|"
msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-1-m|"

msgid "Using ``pgr_withPoints``"
msgstr "Använda ``pgr_withPoints``"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPoints.html#one-to-many>`__ example."
msgstr "Migrering av `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPoints.html#one-to-many>`__ exempel."

msgid "|pid-1-m|"
msgstr "|pid-1-m|"

msgid "To get the old signature column names: filter out the column ``start_vid`` and rename ``end_vid`` to ``end_pid``."
msgstr "För att få de gamla signaturkolumnnamnen: filtrera bort kolumnen ``start_vid`` och byt namn på ``end_vid`` till ``end_pid``."

msgid "Examples for Many to One with one route result"
msgstr "Exempel för Many to One med ett ruttresultat"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_bdDijkstra.html#many-to-one>`__ example."
msgstr "Migrering av `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_bdDijkstra.html#many-to-one>`__ exempel."

msgid "Before updating pgRouting enumerate the columns: |result-m-1|"
msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-m-1|"

msgid "Using ``pgr_dijkstra``"
msgstr "Använda ``pgr_dijkstra``"

msgid "Migrating `this v3.4 <https://docs.pgrouting.org/3.4/en/pgr_dijkstra.html#many-to-one>`__ example."
msgstr "Migrering av `this v3.4 <https://docs.pgrouting.org/3.4/en/pgr_dijkstra.html#many-to-one>`__ exempel."

msgid "Examples for Many to Many with one route result"
msgstr "Exempel för Many to Many med ett ruttresultat"

msgid "Migrating `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPoints.html#many-to-many>`__ example."
msgstr "Migrering av `this v3.8 <https://docs.pgrouting.org/3.8/en/pgr_withPoints.html#many-to-many>`__ exempel."

msgid "|pid-m-m|"
msgstr "|pid-m-m|"

msgid "Examples for combinations with one route result"
msgstr "Exempel på kombinationer med ett vägresultat"

msgid "Migrating `this v3.8 `this <https://docs.pgrouting.org/3.8/en/pgr_withPoints.html#combinations>`__ example."
msgstr "Migrering av `this v3.8 `this <https://docs.pgrouting.org/3.8/en/pgr_withPoints.html#combinations>`__ exempel."

msgid "Migration of spanning tree functions"
msgstr "Migrering av spanning tree-funktioner"

msgid "The standardized :ref:`pgRouting-concepts:Result columns for spanning tree functions` are |result-spantree|"
msgstr "De standardiserade :ref:`pgRouting-concepts:Result columns for spanning tree functions` är |result-spantree|"

msgid "``pgr_drivingDistance``"
msgstr "``pgr_drivingDistance``"

msgid ":ref:`from_result_dij_dd`"
msgstr ":ref:`from_result_dij_dd`"

msgid "``pgr_withPointsDD``"
msgstr "``pgr_withPointsDD``"

msgid ":ref:`from_result_generic_no_seq`"
msgstr ":ref:`from_result_generic_no_seq`"

msgid "``pgr_kruskalDD``"
msgstr "``pgr_kruskalDD``"

msgid "v < 3.7"
msgstr "v < 3.7"

msgid ":ref:`from_result_bfs`"
msgstr ":ref:`from_result_bfs`"

msgid "``pgr_kruskalBFS``"
msgstr "``pgr_kruskalBFS``"

msgid "``pgr_kruskalDFS``"
msgstr "``pgr_kruskalDFS``"

msgid "``pgr_primDD``"
msgstr "``pgr_primDD``"

msgid "``pgr_primBFS``"
msgstr "``pgr_primBFS``"

msgid "``pgr_primDFS``"
msgstr "``pgr_primDFS``"

msgid "``pgr_breadthFisrtSearch``"
msgstr "``pgr_breadthFisrtSearch``"

msgid "v < 4.0.0"
msgstr "v < 4.0.0"

msgid "``pgr_depthFisrtSearch``"
msgstr "``pgr_depthFisrtSearch``"

msgid "to |result-spantree|"
msgstr "till |result-spantree|"

msgid "Migration from |result-bfs|."
msgstr "Migrering från |result-bfs|."

msgid "Single vertex"
msgstr "Enstaka toppunkt"

msgid "Multiple vertices"
msgstr "Flera hörn"

msgid "Before updating pgRouting enumerate the columns: |result-bfs|"
msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-bfs|"

msgid "Single vertex example using ``pgr_kruskalDD``"
msgstr "Exempel på enstaka toppar med ``pgr_kruskalDD``"

msgid "Migrating `this v3.6 <https://docs.pgrouting.org/3.6/en/pgr_kruskalDD.html#single-vertex>`__ example."
msgstr "Migrering av `this v3.6 <https://docs.pgrouting.org/3.6/en/pgr_kruskalDD.html#single-vertex>`__ exempel."

msgid "Before updating pgRouting enumerate the columns: |result-bfs|."
msgstr "Innan uppdatering av pgRouting räknas kolumnerna upp: |result-bfs|."

msgid "Multiple vertices example using ``pgr_kruskalDFS``"
msgstr "Exempel på flera vertikaler med hjälp av ``pgr_kruskalDFS``"

msgid "Migrating `this v3.6 <https://docs.pgrouting.org/3.6/en/pgr_kruskalDFS.html#multiple-vertices>`__ example."
msgstr "Migrering av `this v3.6 <https://docs.pgrouting.org/3.6/en/pgr_kruskalDFS.html#multiple-vertices>`__ exempel."

msgid "Migration from |result-dij-dd|"
msgstr "Migrering från |result-dij-dd|"

msgid "Migration depends on the signature."
msgstr "Migrationen beror på signaturen."

msgid "For single vertex:"
msgstr "För enstaka toppunkt:"

msgid "Before updating pgRouting, enumerate |result-1-1| columns"
msgstr "Innan du uppdaterar pgRouting, räkna upp |result-1-1| kolumner"

msgid "For multiple vertices:"
msgstr "För flera hörn:"

msgid "Changes must be done after updating pgRouting."
msgstr "Ändringar måste göras efter uppdatering av pgRouting."

msgid "To get the old version column names |result-dij-dd-m|:"
msgstr "För att få den gamla versionens kolumnnamn |result-dij-dd-m|:"

msgid "filter out the column ``pred`` and ``depth`` and"
msgstr "filtrera bort kolumnen ``pred`` och ``depth`` och"

msgid "rename ``start_vid`` to ``from_v``."
msgstr "byt namn på ``start_vid`` till ``from_v``."

msgid "Single vertex example using ``pgr_drivingDistance``"
msgstr "Exempel på en enda vertex med hjälp av ``pgr_drivingDistance``"

msgid "Migrating `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_drivingDistance.html#single-vertex>`__ example."
msgstr "Migrering av `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_drivingDistance.html#single-vertex>`__ exempel."

msgid "Before updating pgRouting, enumerate |result-1-1-no-seq| columns"
msgstr "Innan du uppdaterar pgRouting, räkna upp kolumnerna |result-1-1-no-seq|"

msgid "Multiple vertices example using ``pgr_drivingDistance``"
msgstr "Exempel på flera toppar med hjälp av ``pgr_drivingDistance``"

msgid "Migrating `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_drivingDistance.html#multiple-vertices>`__ example."
msgstr "Migrering av `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_drivingDistance.html#multiple-vertices>`__ exempel."

msgid "To get the old version column names |result-dij-dd-m|: filter out the column ``pred`` and ``depth`` and rename ``start_vid`` to ``from_v``."
msgstr "För att få den gamla versionens kolumnnamn |result-dij-dd-m|: filtrera bort kolumnen ``pred`` och ``depth`` och byt namn på ``start_vid`` till ``from_v``."

msgid "Migration of |result-generic-no-seq|"
msgstr "Migrering av |result-generic-no-seq|"

msgid "After updating pgRouting:"
msgstr "Efter uppdatering av pgRouting:"

msgid "Enumerate |result-1-1-no-seq| columns"
msgstr "Räkna upp kolumner för resultat-1-1-icke-seq"

msgid "Use an unnamed valid value for **driving side** after the **distance** parameter."
msgstr "Använd ett icke namngivet giltigt värde för **körsida** efter parametern **avstånd**."

msgid "Enumerate |result-m-1-no-seq| columns"
msgstr "Räkna upp |result-m-1-no-seq|-kolumner"

msgid "Default value of **driving side** parameter"
msgstr "Standardvärde för parametern **förarsida**"

msgid "**driving side** parameter is unnamed, and valid values differ for directed and undirected graphs."
msgstr "*parametern *driving side** är namnlös och giltiga värden skiljer sig åt för riktade och oriktade grafer."

msgid "In directed graph: valid values are [``r``, ``R``, ``l``, ``L``]"
msgstr "I riktad graf: giltiga värden är [``r``, ``R``, ``l``, ``L``]"

msgid "Default value = 'r';"
msgstr "Standardvärde = \"r\";"

msgid "In undirected graph: valid values are [``b``, ``B``]"
msgstr "I en oriktad graf: giltiga värden är [``b``, ``B``]"

msgid "Default value = 'b';"
msgstr "Standardvärde = \"b\";"

msgid "Single vertex example using ``pgr_withPointsDD``"
msgstr "Exempel på en enda toppunkt med ``pgr_withPointsDD``"

msgid "Migrating `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_withPointsDD.html#single-vertex>`__ example."
msgstr "Migrering av `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_withPointsDD.html#single-vertex>`__ exempel."

msgid "Multiple vertices example using ``pgr_withPointsDD``"
msgstr "Exempel på flera vertikaler med hjälp av ``pgr_withPointsDD``"

msgid "Migrating `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_withPointsDD.html#multiple-vertex>`__ example."
msgstr "Migrering av `this v3.5 <https://docs.pgrouting.org/3.5/en/pgr_withPointsDD.html#multiple-vertex>`__ exempel."

msgid "Migration of output column name change"
msgstr "Ändring av namn på utdatakolumn vid migrering"

msgid "The standardized result columns:"
msgstr "De standardiserade resultatkolumnerna:"

msgid "|result_edge_color|"
msgstr "|result_edge_color|"

msgid "|result_node_color|"
msgstr "|result_node_color|"

msgid "|result_node_order|"
msgstr "|result_node_order|"

msgid "Changes on column names must be done after updating pgRouting."
msgstr "Ändringar av kolumnnamn måste göras efter uppdatering av pgRouting."

msgid "``pgr_edgeColoring``"
msgstr "``pgr_edgeColoring``"

msgid ":ref:`from_old_edge_color`"
msgstr ":ref:`from_old_edge_color`"

msgid "``pgr_bipartite``"
msgstr "``pgr_bipartite``"

msgid ":ref:`from_old_node_color`"
msgstr ":ref:`from_old_node_color`"

msgid "``pgr_sequentialVertexColoring``"
msgstr "``pgr_sequentialVertexColoring``"

msgid "``pgr_topologicalSort``"
msgstr "``pgr_topologicalSort``"

msgid ":ref:`from_toposort`"
msgstr ":ref:`from_toposort`"

msgid "``pgr_transitiveClosure``"
msgstr "``pgr_transitiveClosure``"

msgid ":ref:`from_old_closure`"
msgstr ":ref:`from_old_closure`"

msgid "Migration from |result-old-closure|"
msgstr "Migrering från |result-old-closure|"

msgid "Migration to: |result-old-closure|"
msgstr "Migrering till: |result-old-closure|"

msgid "After update:"
msgstr "Efter uppdatering:"

msgid "Remove column ``seq``"
msgstr "Ta bort kolumnen ``seq``"

msgid "Rename ``vid`` to ``node`` and ``target_array`` to ``targets``"
msgstr "Byt namn på ``vid`` till ``node`` och ``target_array`` till ``targets``"

msgid "Migration from |result-toposort|"
msgstr "Migrering från |result-toposort|"

msgid "Migration to: |result_node_order|"
msgstr "Migrering till: |result_node_order|"

msgid "Rename ``sorted_v`` to ``node``"
msgstr "Byt namn på ``sorted_v`` till ``node``"

msgid "Migration from |old-edge-color|"
msgstr "Migrering från |old-edge-color|"

msgid "Migration to: |result_edge_color|"
msgstr "Migration till: |result_edge_color|"

msgid "Rename ``edge_id`` to ``edge`` and ``color_id`` to ``color``."
msgstr "Byt namn på ``edge_id`` till ``edge`` och ``color_id`` till ``color``."

msgid "Migration from |old-node-color|"
msgstr "Migrering från |old-node-color|"

msgid "Migration to: |result_node_color|"
msgstr "Migration till: |result_node_color|"

msgid "Rename ``vertex_id`` to ``node`` and ``color_id`` to ``color``."
msgstr "Byt namn på ``vertex_id`` till ``node`` och ``color_id`` till ``color``."

msgid "Migration of deleted functions"
msgstr "Migrering av borttagna funktioner"

msgid "Functions no longer on pgRouting"
msgstr "Funktionerna finns inte längre på pgRouting"

msgid "Migration of ``pgr_alphaShape``"
msgstr "Migrering av ``pgr_alphaShape``"

msgid "Deprecated"
msgstr "Föråldrat"

msgid "`v3.8.0 <https://docs.pgrouting.org/3.8>`__"
msgstr "`v3.8.0 <https://docs.pgrouting.org/3.8>`__"

msgid "Removed"
msgstr "Borttagen"

msgid "`v4.0.0 <https://docs.pgrouting.org/4.0>`__"
msgstr "`v4.0.0 <https://docs.pgrouting.org/4.0>`__"

msgid "**Before Deprecation:** The following was calculated:"
msgstr "**För Deprecation:** Följande beräknades:"

msgid "An alphaShape was calculated"
msgstr "En alphaShape beräknades"

msgid "**After Deprecation:**"
msgstr "**After Deprecation:**"

msgid "PostGIS has two ways of generating alphaShape."
msgstr "PostGIS har två sätt att generera alphaShape."

msgid "If you have SFCGAL, which you can install using"
msgstr "Om du har SFCGAL, som du kan installera med hjälp av"

msgid "Since PostGIS 3.5+ use `CG_AlphaShape <https://postgis.net/docs/CG_AlphaShape.html>`__"
msgstr "Sedan PostGIS 3.5+ används `CG_AlphaShape <https://postgis.net/docs/CG_AlphaShape.html>`__"

msgid "For PostGIS 3.5+ use the old name ``ST_AlphaShape``"
msgstr "För PostGIS 3.5+ använd det gamla namnet ``ST_AlphaShape``"

msgid "Other PostGIS options are"
msgstr "Andra PostGIS-alternativ är"

msgid "`ST_ConvexHull <https://postgis.net/docs/ST_ConvexHull.html>`__"
msgstr "`ST_ConvevexHull <https://postgis.net/docs/ST_ConvexHull.html>`__"

msgid "`ST_ConcaveHull <https://postgis.net/docs/ST_ConcaveHull.html>`__"
msgstr "`ST_ConcaveHull <https://postgis.net/docs/ST_ConcaveHull.html>`__"

msgid "Migration of ``pgr_nodeNetwork``"
msgstr "Migrering av ``pgr_nodeNetwork``"

msgid "**Before Deprecation:** A table with `<edges>_nodded` was created. with split edges."
msgstr "**Before Deprecation:** En tabell med `<edges>_nodded` skapades. med delade kanter."

msgid "**Migration**"
msgstr "**Migration**"

msgid "Use :doc:`pgr_separateTouching` and/or use :doc:`pgr_separateCrossing`"
msgstr "Använd :doc:`pgr_separateTouching` och/eller använd :doc:`pgr_separateCrossing`"

msgid "Migration of ``pgr_createTopology``"
msgstr "Migrering av ``pgr_createTopology``"

msgid "A table with `<edges>_vertices_pgr` was created."
msgstr "En tabell med `<edges>_vertices_pgr` skapades."

msgid "**After Deprecation:** The user is responsible to create the complete topology."
msgstr "**Efter Deprecation:** Användaren är ansvarig för att skapa den kompletta topologin."

msgid "Build a routing topology"
msgstr "Bygga upp en routingtopologi"

msgid "The basic information to use the majority of the pgRouting functions ``id, source, target, cost, [reverse_cost]`` is what in pgRouting is called the routing topology."
msgstr "Den grundläggande informationen för att använda de flesta av pgRouting-funktionerna ``id, source, target, cost, [reverse_cost]`` är vad som i pgRouting kallas routingtopologin."

msgid "``reverse_cost`` is optional but strongly recommended to have in order to reduce the size of the database due to the size of the geometry columns. Having said that, in this documentation ``reverse_cost`` is used in this documentation."
msgstr "``reverse_cost`` är valfritt men rekommenderas starkt för att minska databasens storlek på grund av storleken på geometrikolumnerna. I den här dokumentationen används dock ``reverse_cost`` i den här dokumentationen."

msgid "When the data comes with geometries and there is no routing topology, then this step is needed."
msgstr "När data levereras med geometrier och det inte finns någon routningstopologi behövs det här steget."

msgid "All the start and end vertices of the geometries need an identifier that is to be stored in a ``source`` and ``target`` columns of the table of the data. Likewise, ``cost`` and ``reverse_cost`` need to have the value of traversing the edge in both directions."
msgstr "Alla geometriernas start- och slutpunkter behöver en identifierare som ska lagras i kolumnerna ``källa`` och ``mål`` i datatabellen. På samma sätt måste ``cost`` och ``reverse_cost`` ha värdet för att korsa kanten i båda riktningarna."

msgid "If the columns do not exist they need to be added to the table in question. (see `ALTER TABLE <https://www.postgresql.org/docs/current/sql-altertable.html>`__)"
msgstr "Om kolumnerna inte finns måste de läggas till i tabellen i fråga. (se `ALTER TABLE <https://www.postgresql.org/docs/current/sql-altertable.html>`__)"

msgid "The function :doc:`pgr_extractVertices` is used to create a vertices table based on the edge identifier and the geometry of the edge of the graph."
msgstr "Funktionen :doc:`pgr_extractVertices` används för att skapa en vertices-tabell baserad på kantidentifieraren och geometrin för kanten i grafen."

msgid "Finally using the data stored on the vertices tables the ``source`` and ``target`` are filled up."
msgstr "Slutligen fylls ``källan`` och ``målet`` på med hjälp av de data som finns lagrade i topparnas tabeller."

msgid "Migration of ``pgr_createVerticesTable``"
msgstr "Migrering av ``pgr_createVerticesTable``"

msgid "**After Deprecation:** The user is responsible to create the vertices table, indexes, etc. They may use :doc:`pgr_extractVertices` for that purpose."
msgstr "**Efter deprecation:** Användaren är ansvarig för att skapa vertices-tabellen, index, etc. De kan använda :doc:`pgr_extractVertices` för det ändamålet."

msgid "Migration of ``pgr_analyzeOneWay``"
msgstr "Migrering av ``pgr_analyzeOneWay``"

msgid "Number of potential problems in directionality"
msgstr "Antal potentiella problem med riktverkan"

msgid "WHERE"
msgstr "VAR"

msgid "Directionality problems were calculated based on codes."
msgstr "Riktningsproblem beräknades baserat på koder."

msgid "Dead ends."
msgstr "Dödlägen."

msgid "A routing problem can arise when from a vertex there is only a way on or a way out but not both:"
msgstr "Ett routingproblem kan uppstå när det från ett toppunkt bara finns en väg in eller en väg ut, men inte båda:"

msgid "Either saving or using directly :doc:`pgr_extractVertices` get the dead ends information and determine if the adjacent edge is one way or not."
msgstr "Antingen genom att spara eller direkt använda :doc:`pgr_extractVertices` får du information om återvändsgränder och avgör om den intilliggande kanten är enkelriktad eller inte."

msgid "In this example :doc:`pgr_extractVertices` has already been applied."
msgstr "I detta exempel har :doc:`pgr_extractVertices` redan tillämpats."

msgid "Bridges."
msgstr "Broar."

msgid "Another routing problem can arise when there is an edge of an undirected graph whose deletion increases its number of connected components, and the bridge is only one way."
msgstr "Ett annat routningsproblem kan uppstå när det finns en kant i en odelad graf vars borttagning ökar antalet anslutna komponenter, och bron bara går åt ett håll."

msgid "To determine if the bridges are or not one way."
msgstr "För att avgöra om broarna är enkelriktade eller inte."

msgid "Migration of ``pgr_analyzeGraph``"
msgstr "Migrering av ``pgr_analyzeGraph``"

msgid "Number of isolated segments."
msgstr "Antal isolerade segment."

msgid "Number of dead ends."
msgstr "Antal återvändsgränder."

msgid "Number of potential gaps found near dead ends."
msgstr "Antal potentiella luckor som hittats nära återvändsgränder."

msgid "Number of intersections. (between 2 edges)"
msgstr "Antal skärningspunkter. (mellan 2 kanter)"

msgid "Graph component"
msgstr "Grafkomponent"

msgid "A connected subgraph that is not part of any larger connected subgraph."
msgstr "En sammanhängande delgraf som inte är en del av någon större sammanhängande delgraf."

msgid "Isolated segment"
msgstr "Isolerat segment"

msgid "A graph component with only one segment."
msgstr "En grafkomponent med endast ett segment."

msgid "Dead ends"
msgstr "Döda ändar"

msgid "A vertex that participates in only one edge."
msgstr "En vertex som bara deltar i en kant."

msgid "gaps"
msgstr "luckor"

msgid "Space between two geometries."
msgstr "Utrymme mellan två geometrier."

msgid "Intersection"
msgstr "Korsningar"

msgid "Is a topological relationship between two geometries."
msgstr "Är ett topologiskt förhållande mellan två geometrier."

msgid "Migration."
msgstr "Migration."

msgid "Components."
msgstr "Komponenter."

msgid "Instead of counting only isolated segments, determine all the components of the graph."
msgstr "Istället för att bara räkna isolerade segment kan du bestämma alla komponenter i grafen."

msgid "Depending of the final application requirements use:"
msgstr "Beroende på de slutliga kraven för applikationen:"

msgid ":doc:`pgr_connectedComponents`"
msgstr ":doc:`pgr_connectedComponents`"

msgid ":doc:`pgr_strongComponents`"
msgstr ":doc:`pgr_strongComponents`"

msgid ":doc:`pgr_biconnectedComponents`"
msgstr ":doc:`pgr_biconnectedComponents`"

msgid "For example:"
msgstr "Till exempel:"

msgid "Instead of counting the dead ends, determine all the dead ends of the graph using :doc:`pgr_degree`."
msgstr "I stället för att räkna återvändsgränderna kan du bestämma alla återvändsgränder i grafen med hjälp av :doc:`pgr_degree`."

msgid "Potential gaps near dead ends."
msgstr "Potentiella luckor nära återvändsgränder."

msgid "Instead of counting potential gaps between geometries, determine the geometric gaps in the graph using :doc:`pgr_findCloseEdges`."
msgstr "Istället för att räkna potentiella mellanrum mellan geometrier, bestäm de geometriska mellanrummen i grafen med hjälp av :doc:`pgr_findCloseEdges`."

msgid "Topological relationships."
msgstr "Topologiska relationer."

msgid "Instead of counting intersections, determine topological relationships between geometries."
msgstr "Istället för att räkna korsningar, bestäm topologiska relationer mellan geometrier."

msgid "Several PostGIS functions can be used: `ST_Intersects <https://postgis.net/docs/ST_Intersects.html>`__, `ST_Crosses <https://postgis.net/docs/ST_Crosses.html>`__, `ST_Overlaps <https://postgis.net/docs/ST_Overlaps.html>`__, etc."
msgstr "Flera PostGIS-funktioner kan användas: `ST_Intersects <https://postgis.net/docs/ST_Intersects.html>`__, `ST_Crosses <https://postgis.net/docs/ST_Crosses.html>`__, `ST_Overlaps <https://postgis.net/docs/ST_Overlaps.html>`__, etc."

msgid "Migration of ``pgr_trsp`` (Vertices)"
msgstr "Migrering av ``pgr_trsp`` (toppar)"

msgid "Signature:"
msgstr "Underskrift:"

msgid "`v3.4.0 <https://docs.pgrouting.org/3.4>`__"
msgstr "`v3.4.0 <https://docs.pgrouting.org/3.4>`__"

msgid ":doc:`pgr_trsp`"
msgstr ":doc:`pgr_trsp`"

msgid "`Migration of restrictions`_"
msgstr "`Flyttning av restriktioner`_"

msgid "Use ``pgr_dijkstra`` when there are no restrictions."
msgstr "Använd ``pgr_dijkstra`` när det inte finns några begränsningar."

msgid "Use :doc:`pgr_dijkstra` instead."
msgstr "Använd :doc:`pgr_dijkstra` istället."

msgid "To get the original column names:"
msgstr "För att få de ursprungliga kolumnnamnen:"

msgid "``id1`` is the node"
msgstr "``id1`` är noden"

msgid "``id2`` is the edge"
msgstr "``id2`` är kanten"

msgid "Use ``pgr_trsp`` when there are restrictions."
msgstr "Använd ``pgr_trsp`` när det finns begränsningar."

msgid "Use :doc:`pgr_trsp` (One to One) instead."
msgstr "Använd :doc:`pgr_trsp` (One to One) istället."

msgid "Migration of ``pgr_trsp`` (Edges)"
msgstr "Migrering av ``pgr_trsp`` (kanter)"

msgid ":doc:`pgr_trsp_withPoints`"
msgstr ":doc:`pgr_trsp_withPoints`"

msgid "Migration of ``pgr_trspViaVertices``"
msgstr "Migrering av ``pgr_trspViaVertices``"

msgid ":doc:`pgr_dijkstraVia`"
msgstr ":doc:`pgr_dijkstraVia`"

msgid ":doc:`pgr_trspVia`"
msgstr ":doc:`pgr_trspVia`"

msgid "Use ``pgr_dijkstraVia`` when there are no restrictions"
msgstr "Använd ``pgr_dijkstraVia`` när det inte finns några begränsningar"

msgid "Use :doc:`pgr_dijkstraVia` instead."
msgstr "Använd :doc:`pgr_dijkstraVia` istället."

msgid "``id1`` is the path identifier"
msgstr "``id1`` är identifieraren för sökvägen"

msgid "``id2`` is the node"
msgstr "``id2`` är noden"

msgid "``id3`` is the edge"
msgstr "``id3`` är kanten"

msgid "Use ``pgr_trspVia`` when there are restrictions"
msgstr "Använd ``pgr_trspVia`` när det finns begränsningar"

msgid "Use :doc:`pgr_trspVia` instead."
msgstr "Använd :doc:`pgr_trspVia` istället."

msgid "Migration of ``pgr_trspViaEdges``"
msgstr "Migrering av ``pgr_trspViaEdges``"

msgid ":doc:`pgr_withPointsVia`"
msgstr ":doc:`pgr_withPointsVia`"

msgid ":doc:`pgr_trspVia_withPoints`"
msgstr ":doc:`pgr_trspVia_withPoints`"

msgid "Use ``pgr_withPointsVia`` when there are no restrictions"
msgstr "Använd ``pgr_withPointsVia`` när det inte finns några begränsningar"

msgid "Use :doc:`pgr_withPointsVia` instead."
msgstr "Använd :doc:`pgr_withPointsVia` istället."

msgid "Use ``pgr_trspVia_withPoints`` when there are restrictions"
msgstr "Använd ``pgr_trspVia_withPoints`` när det finns begränsningar"

msgid "Use :doc:`pgr_trspVia_withPoints` instead."
msgstr "Använd :doc:`pgr_trspVia_withPoints` istället."

msgid "Not yet classified migrations"
msgstr "Ännu ej klassificerade migrationer"

msgid "Migration of ``pgr_withPointsKSP``"
msgstr "Migrering av ``pgr_withPointsKSP``"

msgid "Starting from `v3.6.0 <https://docs.pgrouting.org/3.6/en/migration.html>`__ :doc:`pgr_withPointsKSP` result columns are being standardized."
msgstr "Från och med `v3.6.0 <https://docs.pgrouting.org/3.6/en/migration.html>`__ :doc:`pgr_withPointsKSP` standardiseras resultatkolumnerna."

msgid "|ksp-result|"
msgstr "|ksp-result|"

msgid "|generic-result|"
msgstr "|generic-result|"

msgid "And ``driving side`` parameter changed from named optional to unnamed **driving side** and its validity differ for directed and undirected graphs."
msgstr "Och parametern ``driving side`` ändrades från namngiven valfri till icke namngiven **driving side** och dess giltighet skiljer sig åt för riktade och oriktade grafer."

msgid "``pgr_withPointsKSP`` (`One to One`)"
msgstr "``pgr_withPointsKSP`` (`En till en`)"

msgid "Before Migration"
msgstr "Före migration"

msgid "Output columns were |old-pid-result|"
msgstr "Utgångskolumnerna var |old-pid-result|"

msgid "the columns ``start_vid`` and ``end_vid`` do not exist."
msgstr "kolumnerna ``start_vid`` och ``end_vid`` finns inte."

msgid "Migration"
msgstr "Migrering"

msgid "Be aware of the existence of the additional result Columns."
msgstr "Var medveten om att det finns ytterligare resultat Kolumner."

msgid "New output columns are |generic-result|"
msgstr "Nya utdatakolumner är |generic-result|"

msgid "Using `this <https://docs.pgrouting.org/3.5/en/pgr_withPointsKSP.html#signatures>`__ example."
msgstr "Använda `det här <https://docs.pgrouting.org/3.5/en/pgr_withPointsKSP.html#signatures>`__ exemplet."

msgid "``start_vid`` contains the **start vid** parameter value."
msgstr "``start_vid`` innehåller parametervärdet **start vid**."

msgid "``end_vid`` contains the **end vid** parameter value."
msgstr "``end_vid`` innehåller parametervärdet **end vid**."

msgid "If needed filter out the additional columns, for example, to return the original columns:"
msgstr "Vid behov kan du filtrera bort de extra kolumnerna, t.ex. för att få tillbaka de ursprungliga kolumnerna:"

msgid "Use ``pgr_withPoints`` when there are no restrictions."
msgstr "Använd ``pgr_withPoints`` när det inte finns några begränsningar."

msgid "Use :doc:`pgr_withPoints` (One to One) instead."
msgstr "Använd :doc:`pgr_withPoints` (One to One) istället."

msgid "Use ``pgr_trsp_withPoints`` when there are restrictions."
msgstr "Använd ``pgr_trsp_withPoints`` när det finns begränsningar."

msgid "Use :doc:`pgr_trsp_withPoints` instead."
msgstr "Använd :doc:`pgr_trsp_withPoints` istället."

msgid "Migration of ``pgr_maxCardinalityMatch``"
msgstr "Migrering av ``pgr_maxCardinalityMatch``"

msgid ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed."
msgstr ":doc:`pgr_maxCardinalityMatch` works only for undirected graphs, therefore the ``directed`` flag has been removed."

msgid "Starting from `v3.4.0 <https://docs.pgrouting.org/3.4/en/migration.html>`__"
msgstr "Startar från `v3.4.0 <https://docs.pgrouting.org/3.4/en/migration.html>`__"

msgid "Signature to be migrated:"
msgstr "Signatur som ska migreras:"

msgid "Migration is needed, because:"
msgstr "Migration behövs, eftersom:"

msgid "Use ``cost`` and ``reverse_cost`` on the inner query"
msgstr "Använd ``cost`` och ``reverse_cost`` på den inre frågan"

msgid "Results are ordered"
msgstr "Resultaten är ordnade"

msgid "Works for undirected graphs."
msgstr "Fungerar för oledade grafer."

msgid "New signature"
msgstr "Ny signatur"

msgid "``pgr_maxCardinalityMatch(text)`` returns only ``edge`` column."
msgstr "``pgr_maxCardinalityMatch(text)`` returnerar endast ``kant`` kolumnen."

msgid "The optional flag ``directed`` is removed."
msgstr "Den valfria flaggan ``directed`` tas bort."

msgid "Before migration"
msgstr "Före migration"

msgid "Columns used are ``going`` and ``coming`` to represent the existence of an edge."
msgstr "Kolumner som används är \"utgående\" och \"kommande\" för att representera existensen av en kant."

msgid "Flag ``directed`` was used to indicate if it was for a **directed** or **undirected** graph."
msgstr "Flaggan ``directed`` användes för att ange om det var för en **directed** eller **undirected** graf."

msgid "The flag ``directed`` is ignored."
msgstr "Flaggan ``directed`` ignoreras."

msgid "Regardless of it's value it gives the result considering the graph as **undirected**."
msgstr "Oavsett dess värde ger det resultatet med tanke på grafen som **undirected**."

msgid "Use the columns ``cost`` and ``reverse_cost`` to represent the existence of an edge."
msgstr "Använd kolumnerna ``cost`` och ``reverse_cost`` för att representera existensen av en kant."

msgid "Do not use the flag ``directed``."
msgstr "Använd inte flaggan ``directed``."

msgid "In the query returns only ``edge`` column."
msgstr "I frågan returneras endast kolumnen ``edge``."

msgid "Migration of restrictions"
msgstr "Överföring av restriktioner"

msgid "The structure of the restrictions have changed:"
msgstr "Strukturen på restriktionerna har förändrats:"

msgid "Old restrictions structure"
msgstr "Gammal begränsningsstruktur"

msgid "On the deprecated signatures:"
msgstr "På de föråldrade signaturerna:"

msgid "Column ``rid`` is ignored"
msgstr "Kolumnen ``rid`` ignoreras"

msgid "``via_path``"
msgstr "``via_path``"

msgid "Must be in reverse order."
msgstr "Måste vara i omvänd ordning."

msgid "Is of type ``TEXT``."
msgstr "Är av typen ``TEXT``."

msgid "When more than one via edge must be separated with ``,``."
msgstr "När mer än en via edge måste separeras med ``,``."

msgid "``target_id``"
msgstr "``target_id``"

msgid "Is the last edge of the forbidden path."
msgstr "Är den sista kanten av den förbjudna vägen."

msgid "Is of type ``INTEGER``."
msgstr "Är av typen ``INTEGER``."

msgid "``to_cost``"
msgstr "``to_cost``"

msgid "Is of type ``FLOAT``."
msgstr "Är av typen ``FLOAT``."

msgid "Creation of the old restrictions table"
msgstr "Skapande av den gamla restriktionstabellen"

msgid "Old restrictions fill up"
msgstr "Gamla restriktioner fylls på"

msgid "Old restrictions contents"
msgstr "Gamla restriktioner innehåll"

msgid "The restriction with ``rid = 2`` is representing :math:`3 \\rightarrow 5 \\rightarrow9`"
msgstr "Begränsningen med ``rid = 2`` representerar :math:`3 \\rightarrow 5 \\rightarrow9``"

msgid ":math:`3\\rightarrow5`"
msgstr ":math:`3\\rightarrow5`"

msgid "is on column ``via_path`` in reverse order"
msgstr "är på kolumn ``via_path`` i omvänd ordning"

msgid "is of type ``TEXT``"
msgstr "är av typen ``TEXT``"

msgid ":math:`9`"
msgstr ":math:`9`"

msgid "is on column ``target_id``"
msgstr "är på kolumn ``target_id``"

msgid "is of type ``INTEGER``"
msgstr "är av typen ``INTEGER``"

msgid "New restrictions structure"
msgstr "Ny struktur för restriktioner"

msgid "Column ``id`` is ignored"
msgstr "Kolumnen ``id`` ignoreras"

msgid "Column ``path``"
msgstr "Kolumn \"sökväg"

msgid "Is of type ``ARRAY[ANY-INTEGER]``."
msgstr "Är av typen ``ARRAY[ANY-INTEGER]``."

msgid "Contains all the edges involved on the restriction."
msgstr "Innehåller alla kanter som är involverade i begränsningen."

msgid "The array has the ordered edges of the restriction."
msgstr "Arrayen har restriktionens ordnade kanter."

msgid "Column ``cost``"
msgstr "Kolumn ``kostnad``"

msgid "Is of type ``ANY-NUMERICAL``"
msgstr "Är av typen ``ANY-NUMERICAL``"

msgid "The creation of the restrictions table"
msgstr "Skapandet av begränsningstabellen"

msgid "Adding the restrictions"
msgstr "Lägga till begränsningar"

msgid "Restrictions data"
msgstr "Begränsningar data"

msgid "The restriction with ``rid = 2`` represents the path :math:`3 \\rightarrow5 \\rightarrow9`."
msgstr "Restriktionen med ``rid = 2`` representerar sökvägen :math:`3 \\rightarrow5 \\rightarrow9``."

msgid "By inspection the path is clear."
msgstr "Vid inspektion är vägen tydlig."

msgid "To transform the old restrictions table to the new restrictions structure,"
msgstr "Att omvandla den gamla begränsningstabellen till den nya begränsningsstrukturen,"

msgid "Create a new table with the new restrictions structure."
msgstr "Skapa en ny tabell med den nya begränsningsstrukturen."

msgid "In this migration guide ``new_restrictions`` is been used."
msgstr "I den här migreringsguiden används ``new_restrictions``."

msgid "For this migration pgRouting supplies an auxiliary function for reversal of an array ``_pgr_array_reverse`` needed for the migration."
msgstr "För denna migrering tillhandahåller pgRouting en hjälpfunktion för reversering av en array ``_pgr_array_reverse`` som behövs för migreringen."

msgid "``_pgr_array_reverse``:"
msgstr "``_pgr_array_reverse``:"

msgid "Was created temporally for this migration"
msgstr "Skapades temporärt för denna migration"

msgid "Is not documented."
msgstr "Är inte dokumenterad."

msgid "Will be removed on the next mayor version 4.0.0"
msgstr "Kommer att tas bort i nästa borgmästarversion 4.0.0"

msgid "The migrated table contents:"
msgstr "Det migrerade tabellinnehållet:"

msgid ":doc:`pgRouting-concepts`"
msgstr ":doc:`pgRouting-concepts`"

msgid "Ordering - Family of functions"
msgstr "Beställning - Familj av funktioner"

msgid "pgRouting Concepts"
msgstr "pgRouting-koncept"

msgid "This is a simple guide that go through some of the steps for getting started with pgRouting. This guide covers:"
msgstr "Det här är en enkel guide som går igenom några av stegen för att komma igång med pgRouting. Den här guiden täcker:"

msgid "Graphs"
msgstr "Diagram"

msgid "A graph is an ordered pair :math:`G = (V ,E)` where:"
msgstr "En graf är ett ordnat par :math:`G = (V ,E)` där:"

msgid ":math:`V` is a set of vertices, also called nodes."
msgstr ":math:`V` is a set of vertices, also called nodes."

msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`"
msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V \\}`"

msgid "There are different kinds of graphs:"
msgstr "Det finns olika typer av grafer:"

msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`"
msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V\\}`"

msgid "Undirected simple graph"
msgstr "Ogirigerad enkel graf"

msgid ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`"
msgstr ":math:`E \\subseteq \\{( u, v ) \\mid u , v \\in V, u \\neq v\\}`"

msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`"
msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V) \\}`"

msgid "Directed simple graph"
msgstr "Riktad enkel graf"

msgid ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`"
msgstr ":math:`E \\subseteq \\{( u, v ) \\mid (u , v) \\in (V X V), u \\neq v\\}`"

msgid "Graphs:"
msgstr "Diagram:"

msgid "Do not have geometries."
msgstr "Har inte geometrier."

msgid "Some graph theory problems require graphs to have weights, called **cost** in pgRouting."
msgstr "Vissa grafteoretiska problem kräver att graferna har vikter, som kallas **kostnad** i pgRouting."

msgid "In pgRouting there are several ways to represent a graph on the database:"
msgstr "I pgRouting finns det flera sätt att representera en graf i databasen:"

msgid "With ``cost``"
msgstr "Med ``kostnad``"

msgid "(``id``, ``source``, ``target``, ``cost``)"
msgstr "(``id``, ``source``, ``target``, ``cost``)"

msgid "With ``cost`` and ``reverse_cost``"
msgstr "Med ``kostnad`` och ``omvänd_kostnad``"

msgid "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)"
msgstr "(``id``, ``source``, ``target``, ``cost``, ``reverse_cost``)"

msgid "Identifier of the edge. Requirement to use the database in a consistent. manner."
msgstr "Identifierare av kanten. Krav på att använda databasen på ett konsekvent sätt."

msgid "Identifier of a vertex."
msgstr "Identifierare för en vertex."

msgid "Weight of the edge (``source``, ``target``):"
msgstr "Kantvikt (``källa``, ``mål``):"

msgid "When negative the edge (``source``, ``target``) do not exist on the graph."
msgstr "När den är negativ finns inte kanten (``källa``, ``mål``) i grafen."

msgid "``cost`` must exist in the query."
msgstr "``cost`` måste finnas i frågan."

msgid "When negative the edge (``target``, ``source``) do not exist on the graph."
msgstr "När den är negativ finns inte kanten (``mål``, ``källa``) i grafen."

msgid "The decision of the graph to be **directed** or **undirected** is done when executing a pgRouting algorithm."
msgstr "Beslutet om grafen ska vara **directed** eller **undirected** fattas när en pgRouting-algoritm körs."

msgid "Graph with ``cost``"
msgstr "Graf med ``kostnad``"

msgid "The weighted directed graph, :math:`G_d(V,E)`:"
msgstr "Den viktade riktade grafen, :math:`G_d(V,E)`:"

msgid "Graph data is obtained with a query"
msgstr "Grafdata erhålls med en fråga"

msgid "``SELECT id, source, target, cost FROM edges``"
msgstr "``Välj id, källa, mål, kostnad från kanter``"

msgid ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`"
msgstr ":math:`E = \\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} \\ge 0 \\}`"

msgid "Edges where ``cost`` is non negative are part of the graph."
msgstr "Kanter där ``kostnad`` inte är negativ är en del av grafen."

msgid ":math:`V = \\{source_{id} \\cup target_{id}\\}`"
msgstr ":math:`V = \\{source_{id} \\cup target_{id}\\}`"

msgid "All vertices in ``source`` and ``target`` are part of the graph."
msgstr "Alla hörn i ``källa`` och ``mål`` är en del av grafen."

msgid "In a directed graph the edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`"
msgstr "I en riktad graf har kanten :math:`(source_{id}, target_{id}, cost_{id})` riktning: :math:`source_{id} \\rightarrow target_{id}`"

msgid "For the following data:"
msgstr "För följande uppgifter:"

msgid "Edge :math:`2` (:math:`1 \\rightarrow 3`) is not part of the graph."
msgstr "Edge :math:`2` (:math:`1 \\rightarrow 3`) är inte en del av grafen."

msgid "The data is representing the following graph:"
msgstr "Uppgifterna representeras av följande graf:"

msgid "In an undirected graph the edge :math:`(source_{id}, target_{id}, cost_{id})` does not have directionality: :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`"
msgstr "I en ostyrd graf har kanten :math:`(källa_{id}, mål_{id}, kostnad_{id})` inte riktning: :math:`källa_{id} \\frac{\\;\\;\\;\\;\\;}{} mål_{id}`"

msgid "In terms of a directed graph is like having two edges: :math:`source_{id} \\leftrightarrow target_{id}`"
msgstr "I termer av en riktad graf är det som att ha två kanter: :math:`source_{id} \\leftrightarrow target_{id}`"

msgid "Edge :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) is not part of the graph."
msgstr "Kanten :math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`) är inte en del av grafen."

msgid "Graph with ``cost`` and ``reverse_cost``"
msgstr "Graf med ``kostnad`` och ``omvända_kostnader``"

msgid "``SELECT id, source, target, cost, reverse_cost FROM edges``"
msgstr "``SELECT id, källa, mål, kostnad, omvänd_kostnad FROM kanter``"

msgid "The set of edges :math:`E`:"
msgstr "Mängden kanter :math:`E`:"

msgid ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`"
msgstr ":math:`E = \\begin{split} \\begin{align} & {\\{(source_{id}, target_{id}, cost_{id}) \\text{ when } cost_{id} >=0 \\}} \\\\ & \\cup \\\\ & {\\{(target_{id}, source_{id}, reverse\\_cost_{id}) \\text{ when } reverse\\_cost_{id} >=0 \\}} \\end{align} \\end{split}`"

msgid "Edges :math:`(source \\rightarrow target)` where ``cost`` is non negative are part of the graph."
msgstr "Edges :math:`(source \\rightarrow target)` där ``cost`` är icke-negativ är en del av grafen."

msgid "Edges :math:`(target \\rightarrow source)` where ``reverse_cost`` is non negative are part of the graph."
msgstr "Edges :math:`(target \\rightarrow source)` där ``reverse_cost`` är icke-negativ är en del av grafen."

msgid "The set of vertices :math:`V`:"
msgstr "Mängden hörn :math:`V`:"

msgid "In a directed graph both edges have directionality"
msgstr "I en riktad graf har båda kanterna riktning"

msgid "edge :math:`(source_{id}, target_{id}, cost_{id})` has directionality: :math:`source_{id} \\rightarrow target_{id}`"
msgstr "kanten :math:`(källa_{id}, mål_{id}, kostnad_{id})` har riktning: :math:`källa_{id} \\rightarrow mål_{id}`"

msgid "edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` has directionality: :math:`target_{id} \\rightarrow source_{id}`"
msgstr "kanten :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` har riktning: :math:`target_{id} \\rightarrow source_{id}`"

msgid "Edges not part of the graph:"
msgstr "Kanter som inte är en del av grafen:"

msgid ":math:`2` (:math:`1 \\rightarrow 3`)"
msgstr ":math:`2` (:math:`1 \\rightarrow 3`)"

msgid ":math:`3` (:math:`3 \\rightarrow 2`)"
msgstr ":math:`3` (:math:`3 \\rightarrow 2`)"

msgid "In a directed graph both edges do not have directionality"
msgstr "I en riktad graf har inte båda kanterna riktning"

msgid "Edge :math:`(source_{id}, target_{id}, cost_{id})` is :math:`source_{id} \\frac{\\;\\;\\;\\;\\;}{} target_{id}`"
msgstr "Kant :math:`(källa_{id}, mål_{id}, kostnad_{id})` är :math:`källa_{id} \\frac{\\;\\;\\;\\;\\;}{} mål_{id}`"

msgid "Edge :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` is :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`"
msgstr "Kant :math:`(target_{id}, source_{id}, reverse\\_cost_{id})` är :math:`target_{id} \\frac{\\;\\;\\;\\;\\;}{} source_{id}`"

msgid "In terms of a directed graph is like having four edges:"
msgstr "I termer av en riktad graf är det som att ha fyra kanter:"

msgid ":math:`source_i \\leftrightarrow target_i`"
msgstr ":math:`source_i \\leftrightarrow target_i`"

msgid ":math:`target_i \\leftrightarrow source_i`"
msgstr ":math:`target_i \\leftrightarrow source_i`"

msgid ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)"
msgstr ":math:`2` (:math:`1 \\frac{\\;\\;\\;\\;\\;}{} 3`)"

msgid ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)"
msgstr ":math:`3` (:math:`3 \\frac{\\;\\;\\;\\;\\;}{} 2`)"

msgid "Graphs without geometries"
msgstr "Grafer utan geometrier"

msgid "Personal relationships, genealogy, file dependency problems can be solved using pgRouting. Those problems, normally, do not come with geometries associated with the graph."
msgstr "Problem med personliga relationer, släktforskning och filberoende kan lösas med hjälp av pgRouting. Dessa problem har normalt inte geometrier som är kopplade till grafen."

msgid "Wiki example"
msgstr "Wiki-exempel"

msgid "Solve the example problem taken from `wikipedia <https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm>`__):"
msgstr "Lös exempelproblemet hämtat från `wikipedia <https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm>`__):"

msgid "Problem is to find the shortest path from :math:`1` to :math:`5`."
msgstr "Problemet är att hitta den kortaste vägen från :math:`1` till :math:`5`."

msgid "Is an undirected graph."
msgstr "Är en odelad graf."

msgid "Although visually looks like to have geometries, the drawing is not to scale."
msgstr "Även om det visuellt ser ut att finnas geometrier är ritningen inte skalenlig."

msgid "No geometries associated to the vertices or edges"
msgstr "Inga geometrier associerade till hörn eller kanter"

msgid "Has 6 vertices :math:`\\{1,2,3,4,5,6\\}`"
msgstr "Har 6 hörn :math:`\\{1,2,3,4,5,6\\}`"

msgid "Has 9 edges:"
msgstr "Har 9 kanter:"

msgid ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`"
msgstr ":math:`\\begin{split} \\begin{align} E = & \\{(1,2,7), (1,3,9), (1,6,14), \\\\ & (2,3,10), (2,4,13), \\\\ & (3,4,11), (3,6,2), \\\\ & (4,5,6), \\\\ & (5,6,9) \\} \\end{align} \\end{split}`"

msgid "The graph can be represented in many ways for example:"
msgstr "Grafen kan representeras på många olika sätt, t.ex:"

msgid "Prepare the database"
msgstr "Förbereda databasen"

msgid "Create a database for the example, access the database and install pgRouting: ::"
msgstr "Skapa en databas för exemplet, gå in i databasen och installera pgRouting: ::"

msgid "Create a table"
msgstr "Skapa en tabell"

msgid "The basic elements needed to perform basic routing on an undirected graph are:"
msgstr "De grundläggande element som behövs för att utföra grundläggande routing på en odelad graf är:"

msgid "SMALLINT, INTEGER, BIGINT, REAL, FLOAT"
msgstr "SMALLINT, INTEGER, BIGINT, REAL, FLOAT"

msgid "Using this table design for this example:"
msgstr "Använd denna bordsdesign för detta exempel:"

msgid "Insert the data"
msgstr "Infoga data"

msgid "Find the shortest path"
msgstr "Hitta den kortaste vägen"

msgid "To solve this example :doc:`pgr_dijkstra` is used:"
msgstr "För att lösa detta exempel används :doc:`pgr_dijkstra`:"

msgid "To go from :math:`1` to :math:`5` the path goes thru the following vertices: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`"
msgstr "För att gå från :math:`1` till :math:`5` går vägen genom följande hörn: :math:`1 \\rightarrow 3 \\rightarrow 6 \\rightarrow 5`"

msgid "Vertex information"
msgstr "Information om toppunkt"

msgid "To obtain the vertices information, use :doc:`pgr_extractVertices`"
msgstr "För att få information om topparna, använd :doc:`pgr_extractVertices`"

msgid "Graphs with geometries"
msgstr "Grafer med geometrier"

msgid "Create a routing Database"
msgstr "Skapa en routningsdatabas"

msgid "The first step is to create a database and load pgRouting in the database."
msgstr "Det första steget är att skapa en databas och ladda pgRouting i databasen."

msgid "Typically create a database for each project."
msgstr "Vanligtvis skapas en databas för varje projekt."

msgid "Once having the database to work in, load your data and build the routing application in that database."
msgstr "När du väl har en databas att arbeta i laddar du dina data och bygger routingapplikationen i den databasen."

msgid "Load Data"
msgstr "Ladda data"

msgid "There are several ways to load your data into pgRouting."
msgstr "Det finns flera sätt att ladda dina data i pgRouting."

msgid "Manually creating a database."
msgstr "Skapa en databas manuellt."

msgid "`Graphs without geometries`_"
msgstr "`Grafer utan geometrier`_"

msgid ":doc:`sampledata`: a small graph used in the documentation examples"
msgstr ":doc:`sampledata`: a small graph used in the documentation examples"

msgid "Using `osm2pgrouting <https://workshop.pgrouting.org/latest/en/basic/data.html>`__"
msgstr "Använda `osm2pgrouting <https://workshop.pgrouting.org/latest/en/basic/data.html>`__"

msgid "There are various open source tools that can help, like:"
msgstr "Det finns olika verktyg med öppen källkod som kan hjälpa till, t.ex:"

msgid "shp2pgsql"
msgstr "shp2pgsql"

msgid "postgresql shapefile loader"
msgstr "postgresql shapefile-laddare"

msgid "ogr2ogr"
msgstr "ogr2ogr"

msgid "vector data conversion utility"
msgstr "verktyg för konvertering av vektordata"

msgid "osm2pgsql"
msgstr "osm2pgsql"

msgid "load OSM data into postgresql"
msgstr "ladda OSM-data till postgresql"

msgid "Please note that these tools will **not** import the data in a structure compatible with pgRouting and when this happens the topology needs to be adjusted."
msgstr "Observera att dessa verktyg **inte** kommer att importera data i en struktur som är kompatibel med pgRouting och när detta händer måste topologin justeras."

msgid "Breakup a segments on each segment-segment intersection"
msgstr "Dela upp ett segment på varje segment-segment intersektion"

msgid "When missing, add columns and assign values to ``source``, ``target``, ``cost``, ``reverse_cost``."
msgstr "Om de saknas, lägg till kolumner och tilldela värden för ``källa``, ``mål``, ``kostnad``, ``omvänd kostnad``."

msgid "Connect a disconnected graph."
msgstr "Anslut en frånkopplad graf."

msgid "Create the complete graph topology"
msgstr "Skapa den fullständiga grafens topologi"

msgid "Create one or more graphs based on the application to be developed."
msgstr "Skapa en eller flera grafer baserat på den applikation som ska utvecklas."

msgid "Create a contracted graph for the high speed roads"
msgstr "Skapa ett sammandraget diagram för höghastighetsvägarna"

msgid "Create graphs per state/country"
msgstr "Skapa grafer per stat/land"

msgid "In few words:"
msgstr "Med några få ord:"

msgid "Prepare the graph"
msgstr "Förbered grafen"

msgid "What and how to prepare the graph, will depend on the application and/or on the quality of the data and/or on how close the information is to have a topology usable by pgRouting and/or some other factors not mentioned."
msgstr "Vad och hur du ska förbereda grafen beror på applikationen och/eller på datakvaliteten och/eller på hur nära informationen är en topologi som kan användas av pgRouting och/eller på andra faktorer som inte nämns."

msgid "The steps to prepare the graph involve geometry operations using `PostGIS <https://postgis.net/>`__ and some others involve graph operations like :doc:`pgr_contraction` to contract a graph."
msgstr "Stegen för att förbereda grafen involverar geometriska operationer med hjälp av `PostGIS <https://postgis.net/>`__ och vissa andra involverar grafoperationer som :doc:`pgr_contraction` för att dra ihop en graf."

msgid "The `workshop <https://workshop.pgrouting.org/latest>`__ has a step by step on how to prepare a graph using Open Street Map data, for a small application."
msgstr "I workshopen <https://workshop.pgrouting.org/latest>`__ finns en steg-för-stegbeskrivning av hur man skapar en graf med hjälp av Open Street Map-data för en liten applikation."

msgid "The use of indexes on the database design in general:"
msgstr "Användningen av index på databasdesignen i allmänhet:"

msgid "Have the geometries indexed."
msgstr "Låt geometrierna vara indexerade."

msgid "Have the identifiers columns indexed."
msgstr "Låt kolumnerna med identifierare indexeras."

msgid "Please consult the `PostgreSQL <https://www.postgresql.org/docs/>`__ documentation and the `PostGIS <https://postgis.net/>`__ documentation."
msgstr "Vänligen se dokumentationen för `PostgreSQL <https://www.postgresql.org/docs/>`__ och dokumentationen för `PostGIS <https://postgis.net/>`__."

msgid "Data coming from OSM and using `osm2pgrouting <https://github.com/pgRouting/osm2pgrouting>`__ as an import tool, comes with the routing topology. See an example of using ``osm2pgrouting`` on the `workshop <https://workshop.pgrouting.org/latest/en/basic/data.html>`__."
msgstr "Data som kommer från OSM och använder `osm2pgrouting <https://github.com/pgRouting/osm2pgrouting>`__ som ett importverktyg, kommer med routingtopologin. Se ett exempel på användning av ``osm2pgrouting`` på `workshop <https://workshop.pgrouting.org/latest/en/basic/data.html>`__."

msgid "Adjust costs"
msgstr "Justera kostnader"

msgid "For this example the ``cost`` and ``reverse_cost`` values are going to be the double of the length of the geometry."
msgstr "I det här exemplet kommer värdena ``cost`` och ``reverse_cost`` att vara det dubbla av geometrins längd."

msgid "Update costs to length of geometry"
msgstr "Uppdatera kostnaderna till geometrins längd"

msgid "Suppose that ``cost`` and ``reverse_cost`` columns in the sample data represent:"
msgstr "Antag att kolumnerna ``kostnad`` och ``omvända_kostnader`` i urvalsdata representerar:"

msgid ":math:`1` when the edge exists in the graph"
msgstr ":math:`1` when the edge exists in the graph"

msgid ":math:`-1` when the edge does not exist in the graph"
msgstr ":math:`-1` when the edge does not exist in the graph"

msgid "Using that information updating to the length of the geometries:"
msgstr "Med hjälp av den informationen uppdateras geometriernas längd:"

msgid "Which gives the following results:"
msgstr "Vilket ger följande resultat:"

msgid "Note that to be able to follow the documentation examples, everything is based on the original graph."
msgstr "Observera att för att kunna följa dokumentationsexemplen är allt baserat på den ursprungliga grafen."

msgid "Returning to the original data:"
msgstr "Återgå till de ursprungliga uppgifterna:"

msgid "Update costs based on codes"
msgstr "Uppdatera kostnader baserat på koder"

msgid "Other datasets, can have a column with values like"
msgstr "Andra dataset kan ha en kolumn med värden som"

msgid "``FT`` vehicle flow on the direction of the geometry"
msgstr "``FT`` fordonsflöde i geometrins riktning"

msgid "``TF`` vehicle flow opposite of the direction of the geometry"
msgstr "``TF`` fordonsflöde motsatt geometrins riktning"

msgid "``B`` vehicle flow on both directions"
msgstr "``B`` fordonsflöde i båda riktningarna"

msgid "Preparing a code column for the example:"
msgstr "Förbereda en kodkolumn för exemplet:"

msgid "Adjusting the costs based on the codes:"
msgstr "Justering av kostnaderna baserat på koderna:"

msgid "Check the Routing Topology"
msgstr "Kontrollera routingtopologin"

msgid "There are lots of possible problems in a graph."
msgstr "Det finns många möjliga problem i en graf."

msgid "The data used may not have been designed with routing in mind."
msgstr "De data som används kanske inte har utformats med tanke på routing."

msgid "A graph has some very specific requirements."
msgstr "En graf har några mycket specifika krav."

msgid "The graph is disconnected."
msgstr "Grafen är frånkopplad."

msgid "There are unwanted intersections."
msgstr "Det finns oönskade korsningar."

msgid "The graph is too large and needs to be contracted."
msgstr "Grafen är för stor och behöver krympas."

msgid "A sub graph is needed for the application."
msgstr "En subgraf behövs för applikationen."

msgid "and many other problems that the pgRouting user, that is the application developer might encounter."
msgstr "och många andra problem som pgRouting-användaren, det vill säga applikationsutvecklaren, kan stöta på."

msgid "Crossing edges"
msgstr "Korsande kanter"

msgid "To get the crossing edges:"
msgstr "För att få de korsande kanterna:"

msgid "That information is correct, for example, when in terms of vehicles, is it a tunnel or bridge crossing over another road."
msgstr "Den informationen är korrekt, till exempel när det gäller fordon, är det en tunnel eller bro som korsar en annan väg."

msgid "It might be incorrect, for example:"
msgstr "Det kan till exempel vara felaktigt:"

msgid "When it is actually an intersection of roads, where vehicles can make turns."
msgstr "När det faktiskt är en korsning av vägar, där fordon kan svänga."

msgid "When in terms of electrical lines, the electrical line is able to switch roads even on a tunnel or bridge."
msgstr "När det gäller elektriska ledningar kan den elektriska ledningen byta väg även i en tunnel eller på en bro."

msgid "When it is incorrect, it needs fixing:"
msgstr "När den är felaktig behöver den åtgärdas:"

msgid "For vehicles and pedestrians"
msgstr "För fordon och fotgängare"

msgid "If the data comes from OSM and was imported to the database using ``osm2pgrouting``, the fix needs to be done in the `OSM portal <https://www.openstreetmap.org>`__ and the data imported again."
msgstr "Om data kommer från OSM och importerades till databasen med hjälp av ``osm2pgrouting``, måste korrigeringen göras i `OSM-portalen <https://www.openstreetmap.org>`__ och data importeras igen."

msgid "In general when the data comes from a supplier that has the data prepared for routing vehicles, and there is a problem, the data is to be fixed from the supplier"
msgstr "I allmänhet när data kommer från en leverantör som har förberett data för routing av fordon och det finns ett problem, ska data åtgärdas från leverantören"

msgid "For very specific applications"
msgstr "För mycket specifika tillämpningar"

msgid "The data is correct when from the point of view of routing vehicles or pedestrians."
msgstr "Uppgifterna är korrekta om de ses ur de dirigerande fordonens eller fotgängarnas synvinkel."

msgid "The data needs a local fix for the specific application."
msgstr "Uppgifterna behöver en lokal fix för den specifika applikationen."

msgid "Once analyzed one by one the crossings, for the ones that need a local fix, the edges need to be `split <https://postgis.net/docs/ST_Split.html>`__."
msgstr "När korsningarna har analyserats en efter en, för de som behöver en lokal fix, måste kanterna `delas <https://postgis.net/docs/ST_Split.html>`__."

msgid "The new edges need to be added to the edges table, the rest of the attributes need to be updated in the new edges, the old edges need to be removed and the routing topology needs to be updated."
msgstr "De nya kanterna måste läggas till i kanttabellen, resten av attributen måste uppdateras i de nya kanterna, de gamla kanterna måste tas bort och routingtopologin måste uppdateras."

msgid "Fixing an intersection"
msgstr "Fixa en korsning"

msgid "In this example the original edge table will be used to store the additional geometries."
msgstr "I detta exempel kommer den ursprungliga kanttabellen att användas för att lagra de extra geometrierna."

msgid "An example use without results"
msgstr "Ett exempel på användning utan resultat"

msgid "Routing from :math:`1` to :math:`18` gives no solution."
msgstr "Routning från :math:`1` till :math:`18` ger ingen lösning."

msgid "Analyze the network for intersections."
msgstr "Analysera nätverket för korsningar."

msgid "The analysis tell us that the network has an intersection."
msgstr "Analysen visar att nätverket har en korsning."

msgid "Prepare tables"
msgstr "Förbereda tabeller"

msgid "Additional columns to control the origin of the segments."
msgstr "Ytterligare kolumner för att styra segmentens ursprung."

msgid "Adding new segments."
msgstr "Lägga till nya segment."

msgid "Calling :doc:`pgr_separateCrossing` and adding the new segments to the edges table."
msgstr "Anropar :doc:`pgr_separateCrossing` och lägger till de nya segmenten i tabellen över kanter."

msgid "Update other values"
msgstr "Uppdatera andra värden"

msgid "In this example only ``cost`` and ``reverse_cost`` are updated, where they are based on the length of the geometry and the directionality is kept using the ``sign`` function."
msgstr "I det här exemplet uppdateras endast ``cost`` och ``reverse_cost``, där de baseras på geometrins längd och riktningen bibehålls med hjälp av funktionen ``sign``."

msgid "Update the topology"
msgstr "Uppdatera topologin"

msgid "Insert the new vertices if any."
msgstr "Infoga eventuella nya hörn."

msgid "Update source and target information on the edges table."
msgstr "Uppdatera käll- och målinformationen i kanttabellen."

msgid "The example has results"
msgstr "Exemplet har resultat"

msgid "Routing from :math:`1` to :math:`18` gives a solution."
msgstr "Routning från :math:`1` till :math:`18` ger en lösning."

msgid "Touching edges"
msgstr "Beröring av kanter"

msgid "Visually the edges seem to be connected, but internally they are not."
msgstr "Visuellt verkar kanterna vara sammankopplade, men internt är de inte det."

msgid "The validity of the information is application dependent."
msgstr "Informationens giltighet är applikationsberoende."

msgid "Maybe there is a small barrier for vehicles but not for pedestrians."
msgstr "Kanske finns det en liten barriär för fordon men inte för fotgängare."

msgid "Once analyzed one by one the touchings, for the ones that need a local fix, the edges need to be `split <https://postgis.net/docs/ST_Split.html>`__."
msgstr "När beröringarna har analyserats en efter en, för de som behöver en lokal fix, måste kanterna `delas <https://postgis.net/docs/ST_Split.html>`__."

msgid "Fixing a gap"
msgstr "Åtgärda en lucka"

msgid "Routing from :math:`1` to :math:`2` gives no solution."
msgstr "Routning från :math:`1` till :math:`2` ger ingen lösning."

msgid "Analyze the network for gaps."
msgstr "Analysera nätverket för att hitta luckor."

msgid "The analysis tell us that the network has a gap."
msgstr "Analysen visar att det finns en lucka i nätverket."

msgid "Calling :doc:`pgr_separateTouching` and adding the new segments to the edges table."
msgstr "Anropar :doc:`pgr_separateTouching` och lägger till de nya segmenten i tabellen över kanter."

msgid "Routing from :math:`1` to :math:`2` gives a solution."
msgstr "En routning från :math:`1` till :math:`2` ger en lösning."

msgid "Connecting components"
msgstr "Anslutning av komponenter"

msgid "To get the graph connectivity:"
msgstr "För att få grafens anslutningsmöjligheter:"

msgid "There are three basic ways to connect components:"
msgstr "Det finns tre grundläggande sätt att ansluta komponenter:"

msgid "From the vertex to the starting point of the edge"
msgstr "Från toppunkten till startpunkten för kanten"

msgid "From the vertex to the ending point of the edge"
msgstr "Från toppunkten till slutpunkten för kanten"

msgid "From the vertex to the closest vertex on the edge"
msgstr "Från toppunkten till den närmaste toppunkten på kanten"

msgid "This solution requires the edge to be split."
msgstr "Denna lösning kräver att kanten delas."

msgid "In this example :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` will be used."
msgstr "I detta exempel kommer :doc:`pgr_separateCrossing` och :doc:`pgr_separateTouching` att användas."

msgid "Get the connectivity"
msgstr "Få anslutningsmöjligheterna"

msgid "In this example: the edges table will need an additional column and the vertex table will be rebuilt completely."
msgstr "I det här exemplet behöver tabellen edges en extra kolumn och tabellen vertex byggs om helt och hållet."

msgid "Insert new edges"
msgstr "Infoga nya kanter"

msgid "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert the results into the edges table."
msgstr "Använd :doc:`pgr_separateCrossing` och :doc:`pgr_separateTouching` för att infoga resultaten i tabellen över kanter."

msgid "Create the vertices table"
msgstr "Skapa en tabell över hörnpunkter"

msgid "Using :doc:`pgr_extractVertices` create the table."
msgstr "Skapa tabellen med hjälp av :doc:`pgr_extractVertices`."

msgid "Contraction of a graph"
msgstr "Sammandragning av en graf"

msgid "The graph can be reduced in size using :doc:`contraction-family`"
msgstr "Grafen kan minskas i storlek med hjälp av :doc:`contraction-family`"

msgid "When to contract will depend on the size of the graph, processing times, correctness of the data, on the final application, or any other factor not mentioned."
msgstr "När kontrakt ska ingås beror på grafens storlek, behandlingstider, uppgifternas riktighet, den slutliga applikationen eller någon annan faktor som inte nämns."

msgid "A fairly good method of finding out if contraction can be useful is because of the number of dead ends and/or the number of linear edges."
msgstr "En ganska bra metod för att ta reda på om sammandragning kan vara användbart är på grund av antalet återvändsgränder och/eller antalet linjära kanter."

msgid "A complete method on how to contract and how to use the contracted graph is described on :doc:`contraction-family`"
msgstr "En fullständig metod för hur man kontraherar och hur man använder den kontraherade grafen beskrivs på :doc:`contraction-family`"

msgid "To get the dead ends:"
msgstr "För att få bort återvändsgränderna:"

msgid "A dead end happens when"
msgstr "En återvändsgränd uppstår när"

msgid "The vertex is the limit of a cul-de-sac, a no-through road or a no-exit road."
msgstr "Toppunkten är gränsen för en återvändsgränd, en väg med genomfartsförbud eller en väg med utfartsförbud."

msgid "The vertex is on the limit of the imported graph."
msgstr "Toppunkten ligger på gränsen för den importerade grafen."

msgid "If a larger graph is imported then the vertex might not be a dead end"
msgstr "Om en större graf importeras är det inte säkert att toppunkten är en återvändsgränd"

msgid "Node :math:`4`, is a dead end on the query, even that it visually looks like an end point of 3 edges."
msgstr "Noden :math:`4`, är en återvändsgränd i frågan, även om den visuellt ser ut som en slutpunkt för 3 kanter."

msgid "Is node :math:`4` a dead end or not?"
msgstr "Är noden :math:`4` en återvändsgränd eller inte?"

msgid "The answer to that question will depend on the application."
msgstr "Svaret på den frågan beror på vilken applikation det gäller."

msgid "Is there such a small curb:"
msgstr "Finns det en sådan liten trottoarkant:"

msgid "That does not allow a vehicle to use that visual intersection?"
msgstr "Som inte tillåter ett fordon att använda den visuella korsningen?"

msgid "Is the application for pedestrians and therefore the pedestrian can easily walk on the small curb?"
msgstr "Är applikationen för fotgängare och därför kan fotgängaren enkelt gå på den lilla trottoaren?"

msgid "Is the application for the electricity and the electrical lines than can easily be extended on top of the small curb?"
msgstr "Gäller applikationen el och elledningar som enkelt kan förlängas ovanpå den lilla trottoarkanten?"

msgid "Is there a big cliff and from eagles view look like the dead end is close to the segment?"
msgstr "Finns det en stor klippa och från örnens utsikt ser det ut som att återvändsgränden ligger nära segmentet?"

msgid "Depending on the answer, modification of the data might be needed."
msgstr "Beroende på svaret kan det bli nödvändigt att ändra uppgifterna."

msgid "When there are many dead ends, to speed up processing, the :doc:`contraction-family` functions can be used to contract the graph."
msgstr "När det finns många återvändsgränder kan funktionerna :doc:`contraction-family` användas för att dra ihop grafen för att påskynda bearbetningen."

msgid "Linear edges"
msgstr "Linjära kanter"

msgid "To get the linear edges:"
msgstr "För att få de linjära kanterna:"

msgid "These linear vertices are correct, for example, when those the vertices are speed bumps, stop signals and the application is taking them into account."
msgstr "Dessa linjära hörn är korrekta, till exempel när de hörnen är farthinder, stoppsignaler och applikationen tar hänsyn till dem."

msgid "When there are many linear vertices, that need not to be taken into account, to speed up the processing, the :doc:`contraction-family` functions can be used to contract the problem."
msgstr "När det finns många linjära toppar, som inte behöver beaktas, för att påskynda bearbetningen, kan funktionerna :doc:`contraction-family` användas för att kontrahera problemet."

msgid "Function's structure"
msgstr "Funktionens struktur"

msgid "Once the graph preparation work has been done above, it is time to use a"
msgstr "När förberedelserna för grafen har gjorts ovan är det dags att använda en"

msgid "The general form of a pgRouting function call is:"
msgstr "Den allmänna formen för ett pgRouting-funktionsanrop är:"

msgid "\\ \\"
msgstr "\\ \\"

msgid "pgr_<name>(`Inner queries`_, **parameters**, [ ``Optional parameters``)"
msgstr "pgr_<name>(`Inner queries`_, **parameters**, [ ``Optional parameters``)"

msgid "`Inner queries`_: Are compulsory parameters that are ``TEXT`` strings containing SQL queries."
msgstr "`Innerfrågor`_: Är obligatoriska parametrar som är ``TEXT``-strängar som innehåller SQL-frågor."

msgid "**parameters**: Additional compulsory parameters needed by the function."
msgstr "**parametrar**: Ytterligare obligatoriska parametrar som behövs för funktionen."

msgid "``Optional parameters``: Are non compulsory **named** parameters that have a default value when omitted."
msgstr "``Optionella parametrar``: Är icke obligatoriska **namngivna** parametrar som har ett standardvärde när de utelämnas."

msgid "The compulsory parameters are positional parameters, the optional parameters are named parameters."
msgstr "De obligatoriska parametrarna är positionsparametrar och de valfria parametrarna är namnparametrar."

msgid "For example, for this :doc:`pgr_dijkstra` signature:"
msgstr "Till exempel, för denna :doc:`pgr_dijkstra` signatur:"

msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_dijkstra(`Edges SQL`_, **start vids**, **slut vids**, [``directed``])"

msgid "`Edges SQL`_:"
msgstr "`Kanter SQL`_:"

msgid "Is the first parameter."
msgstr "Är den första parametern."

msgid "It is compulsory."
msgstr "Det är obligatoriskt."

msgid "It is an inner query."
msgstr "Det är en inre frågeställning."

msgid "It has no name, so **Edges SQL** gives an idea of what kind of inner query needs to be used"
msgstr "Den har inget namn, så **Edges SQL** ger en uppfattning om vilken typ av inre fråga som måste användas"

msgid "**start vid**:"
msgstr "**start vid**:"

msgid "Is the second parameter."
msgstr "Är den andra parametern."

msgid "It has no name, so **start vid** gives an idea of what the second parameter's value should contain."
msgstr "Den har inget namn, så **start vid** ger en uppfattning om vad den andra parameterns värde ska innehålla."

msgid "Is the third parameter."
msgstr "Är den tredje parametern."

msgid "It has no name, so **end vid** gives an idea of what the third parameter's value should contain"
msgstr "Den har inget namn, så **slut vid** ger en uppfattning om vad den tredje parameterns värde ska innehålla"

msgid "Is the fourth parameter."
msgstr "Är den fjärde parametern."

msgid "It is optional."
msgstr "Det är valfritt."

msgid "It has a name."
msgstr "Den har ett namn."

msgid "The full description of the parameters are found on the `Parameters`_ section of each function."
msgstr "En fullständig beskrivning av parametrarna finns i avsnittet `Parametrar`_ för varje funktion."

msgid "Function's overloads"
msgstr "Funktionens överbelastningar"

msgid "A function might have different overloads. The most common are called:"
msgstr "En funktion kan ha olika överbelastningar. De vanligaste kallas:"

msgid "`One to One`_"
msgstr "`En till en`_"

msgid "`One to Many`_"
msgstr "`En till många`_"

msgid "`Many to One`_"
msgstr "`Många till en`_"

msgid "`Many to Many`_"
msgstr "`Många till många`_"

msgid "`Combinations`_"
msgstr "`Kombinationer`_"

msgid "Depending on the overload the parameters types change."
msgstr "Beroende på överbelastningen ändras parametertyperna."

msgid "**One**: **ANY-INTEGER**"
msgstr "**One**: **ANY-INTEGER**"

msgid "**Many**: ``ARRAY`` [**ANY-INTEGER**]"
msgstr "**Många**: ``ARRAY`` [**ANY-INTEGER**]"

msgid "Depending of the function the overloads may vary. But the concept of parameter type change remains the same."
msgstr "Beroende på funktion kan överbelastningarna variera. Men konceptet med ändring av parametertyp förblir detsamma."

msgid "When routing from:"
msgstr "När du dirigerar från:"

msgid "From **one** starting vertex"
msgstr "Från **en** startpunkt"

msgid "to **one** ending vertex"
msgstr "till **en** avslutande toppunkt"

msgid "to **many** ending vertices"
msgstr "till **många** avslutande hörn"

msgid "From **many** starting vertices"
msgstr "Från **många** startpunkter"

msgid "From **many** different starting vertices"
msgstr "Från **många** olika startpunkter"

msgid "to **many** different ending vertices"
msgstr "till **många** olika slutpunkter"

msgid "Every tuple specifies a pair of a start vertex and an end vertex"
msgstr "Varje tupel specificerar ett par av en startvertex och en slutvertex"

msgid "Users can define the combinations as desired."
msgstr "Användarna kan definiera kombinationerna som de vill."

msgid "Needs a `Combinations SQL`_"
msgstr "Behöver en `Combinations SQL`_"

msgid "There are several kinds of valid inner queries and also the columns returned are depending of the function. Which kind of inner query will depend on the function's requirements. To simplify the variety of types, **ANY-INTEGER** and **ANY-NUMERICAL** is used."
msgstr "Det finns flera olika typer av giltiga inre frågor och de kolumner som returneras beror också på funktionen. Vilken typ av inner query som används beror på funktionens krav. För att förenkla de många olika typerna används **ANY-INTEGER** och **ANY-NUMERICAL**."

msgid "Edges SQL for"
msgstr "Edges SQL för"

msgid "Some uncategorised functions"
msgstr "Vissa okategoriserade funktioner"

msgid "General without ``id``"
msgstr "Allmänt utan ``id``"

msgid "General with (X,Y)"
msgstr "Allmänt med (X,Y)"

msgid "When negative: edge (``source``, ``target``) does not exist, therefore it's not part of the graph."
msgstr "När den är negativ: kanten (``källa``, ``mål``) existerar inte, därför är den inte en del av grafen."

msgid "Weight of the edge (``target``, ``source``),"
msgstr "Kantvikt (``mål``, ``källa``),"

msgid "``x1``"
msgstr "``x1``"

msgid "X coordinate of ``source`` vertex."
msgstr "X-koordinat för ``källans`` toppunkt."

msgid "``y1``"
msgstr "``y1``"

msgid "Y coordinate of ``source`` vertex."
msgstr "Y-koordinat för ``källans`` toppunkt."

msgid "``x2``"
msgstr "``x2``"

msgid "X coordinate of ``target`` vertex."
msgstr "X-koordinat för ``mål`` vertex."

msgid "``y2``"
msgstr "``y2``"

msgid "Y coordinate of ``target`` vertex."
msgstr "Y-koordinat för \"målets\" toppunkt."

msgid "Flow"
msgstr "Flöde"

msgid "Edges SQL for :doc:`flow-family`"
msgstr "Edges SQL för :doc:`flow-family`"

msgid "Edges SQL for the following functions of :doc:`flow-family`"
msgstr "Edges SQL för följande funktioner i :doc:`flow-family`"

msgid "Used in combination signatures"
msgstr "Används i kombinationssignaturer"

msgid "Points SQL for"
msgstr "Punkt SQL för"

msgid "The main parameter of the majority of the pgRouting functions is a query that selects the edges of the graph."
msgstr "Huvudparametern för de flesta pgRouting-funktioner är en fråga som väljer ut kanterna i grafen."

msgid "Depending on the family or category of a function it will have additional parameters, some of them are compulsory and some are optional."
msgstr "Beroende på vilken familj eller kategori en funktion tillhör kommer den att ha ytterligare parametrar, varav vissa är obligatoriska och andra valfria."

msgid "The compulsory parameters are nameless and must be given in the required order. The optional parameters are named parameters and will have a default value."
msgstr "De obligatoriska parametrarna är namnlösa och måste anges i den ordning som krävs. De valfria parametrarna är namngivna parametrar och kommer att ha ett standardvärde."

msgid "Parameters for the Via functions"
msgstr "Parametrar för Via-funktionerna"

msgid "SQL query as described."
msgstr "SQL-fråga enligt beskrivning."

msgid "When ``true`` Graph is considered `Directed`"
msgstr "När en \"sann\" graf anses vara \"riktad"

msgid "When ``false`` the graph is considered as Undirected."
msgstr "När ``false`` betraktas grafen som Undirected."

msgid "``strict``"
msgstr "``strict``"

msgid "``false``"
msgstr "``false``"

msgid "When ``true`` if a path is missing stops and returns **EMPTY SET**"
msgstr "När ``true`` om en sökväg saknas stoppar och returnerar **EMPTY SET**"

msgid "When ``false`` ignores missing paths returning all paths found"
msgstr "När ``false`` ignorerar saknade sökvägar returneras alla sökvägar som hittats"

msgid "``U_turn_on_edge``"
msgstr "``U_turn_on_edge``"

msgid "When ``true`` departing from a visited vertex will not try to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is allowed."
msgstr "När ``true`` avgår från ett besökt toppunkt kommer inte att försöka undvika att använda den kant som användes för att nå det. Med andra ord är det tillåtet att använda kanten med samma identifierare i U-svängen."

msgid "When ``false`` when a departing from a visited vertex tries to avoid using the edge used to reach it. In other words, U turn using the edge with same identifier is used when no other path is found."
msgstr "När ``false`` när en avgång från en besökt topp försöker undvika att använda den kant som användes för att nå den. Med andra ord, U-sväng med kanten med samma identifierare används när ingen annan väg hittas."

msgid "For the TRSP functions"
msgstr "För TRSP-funktionerna"

msgid "Array of identifiers of destination vertices."
msgstr "Array med identifierare för målpunkter."

msgid "There are several kinds of columns returned are depending of the function."
msgstr "Det finns flera olika typer av kolonner som returneras beroende på funktion."

msgid "Result columns for single path functions"
msgstr "Resultatkolumner för funktioner med enkel sökväg"

msgid "Used in functions that return one path solution per departure and destination."
msgstr "Används i funktioner som returnerar en lösning per avgång och destination."

msgid ":doc:`pgr_dijkstraNear`"
msgstr ":doc:`pgr_dijkstraNear`"

msgid "Returns |short-generic-result|"
msgstr "Returnerar |short-generic-result|"

msgid "``path_seq``"
msgstr "``path_seq``"

msgid "Relative position in the path. Has value **1** for the beginning of a path."
msgstr "Relativ position i tågläget. Har värdet **1** för början av ett tågläge."

msgid "Identifier of the starting vertex of the current path."
msgstr "Identifierar startpunkten för den aktuella banan."

msgid "Identifier of the ending vertex of the current path."
msgstr "Identifierare för den aktuella banans slutpunkt."

msgid "Identifier of the node in the path from ``start_vid`` to ``end_vid``."
msgstr "Identifierare av noden i sökvägen från ``start_vid`` till ``slut_vid``."

msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. **-1** for the last node of the path."
msgstr "Identifierare av den kant som används för att gå från ``node`` till nästa nod i sökvägssekvensen. **-1** för den sista noden i sökvägen."

msgid "Cost to traverse from ``node`` using ``edge`` to the next node in the path sequence."
msgstr "Kostnad för att gå från ``nod`` med hjälp av ``edge`` till nästa nod i vägsekvensen."

msgid "When ``start_vid`` or ``end_vid`` columns have negative values, the identifier is for a Point."
msgstr "När kolumnerna ``start_vid`` eller ``end_vid`` har negativa värden är identifieraren för en Point."

msgid "Result columns for multiple paths functions"
msgstr "Resultatkolumner för funktioner med flera sökvägar"

msgid "Used in functions that return many paths solutions per departure and destination."
msgstr "Används i funktioner som returnerar många banlösningar per avgång och destination."

msgid ":doc:`pgr_KSP`"
msgstr ":doc:`pgr_KSP`"

msgid ":doc:`pgr_withPointsKSP`"
msgstr ":doc:`pgr_withPointsKSP`"

msgid "Returns set of |generic-result|"
msgstr "Returnerar uppsättning av |generic-result|"

msgid "``path_id``"
msgstr "``path_id``"

msgid "Path identifier."
msgstr "Identifierare för sökväg."

msgid "Has value **1** for the first of a path from ``start_vid`` to ``end_vid``."
msgstr "Har värdet **1** för den första i en sökväg från ``start_vid`` till ``slut_vid``."

msgid "Result columns for cost functions"
msgstr "Resultatkolumner för kostnadsfunktioner"

msgid "Used by:"
msgstr "Används av:"

msgid "When start_vid or end_vid columns have negative values, the identifier is for a Point."
msgstr "När kolumnerna start_vid eller end_vid har negativa värden är identifieraren för en Point."

msgid "Result columns for flow functions"
msgstr "Resultatkolumner för flödesfunktioner"

msgid "Result columns for spanning tree functions"
msgstr "Resultatkolumner för funktioner för spännträd"

msgid "Used in functions that return a tree solution per departure."
msgstr "Används i funktioner som returnerar en trädlösning per avgång."

msgid "Result columns for simple spanning tree functions"
msgstr "Resultatkolumner för funktioner för enkla spännträd"

msgid "Returns set of ``(edge, cost)``"
msgstr "Returnerar uppsättning av ``(kant, kostnad)``"

msgid "Cost to traverse the edge."
msgstr "Kostnad för att korsa kanten."

msgid "Performance Tips"
msgstr "Tips om prestanda"

msgid "For the Routing functions"
msgstr "För Routing-funktionerna"

msgid "To get faster results bound the queries to an area of interest of routing."
msgstr "För att få snabbare resultat avgränsar du frågorna till ett intresseområde för routning."

msgid "In this example Use an inner query SQL that does not include some edges in the routing function and is within the area of the results."
msgstr "I det här exemplet Använd en inre fråga SQL som inte innehåller några kanter i routningsfunktionen och som ligger inom resultatområdet."

msgid "Given this area:"
msgstr "Med tanke på detta område:"

msgid "Calculate a route:"
msgstr "Beräkna en rutt:"

msgid "How to contribute"
msgstr "Hur du bidrar"

msgid "Wiki"
msgstr "Wiki"

msgid "Edit an existing `pgRouting Wiki <https://github.com/pgRouting/pgrouting/wiki>`__ page."
msgstr "Redigera en befintlig sida i `pgRouting Wiki <https://github.com/pgRouting/pgrouting/wiki>`__."

msgid "Or create a new Wiki page"
msgstr "Eller skapa en ny Wiki-sida"

msgid "Create a page on the `pgRouting Wiki <https://github.com/pgRouting/pgrouting/wiki>`__"
msgstr "Skapa en sida på `pgRouting Wiki <https://github.com/pgRouting/pgrouting/wiki>`__"

msgid "Give the title an appropriate name"
msgstr "Ge titeln ett lämpligt namn"

msgid "`Example <https://github.com/pgRouting/pgrouting/wiki/How-to:-Handle-parallel-edges-(KSP)>`__"
msgstr "exempel <https://github.com/pgRouting/pgrouting/wiki/How-to:-Handle-parallel-edges-(KSP)>`__"

msgid "Adding Functionality to pgRouting"
msgstr "Lägga till funktionalitet i pgRouting"

msgid "Consult the `developer's documentation <https://docs.pgrouting.org/doxy/2.4/index.html>`__"
msgstr "Se dokumentationen för utvecklare <https://docs.pgrouting.org/doxy/2.4/index.html>`__"

msgid "Installation"
msgstr "Installation"

msgid "Instructions for downloading and installing binaries for different operating systems, additional notes and corrections not included in this documentation can be found in `Installation wiki <https://github.com/pgRouting/pgrouting/wiki/Notes-on-Download%2C-Installation-and-building-pgRouting>`__"
msgstr "Instruktioner för nedladdning och installation av binärfiler för olika operativsystem, ytterligare anmärkningar och korrigeringar som inte ingår i denna dokumentation finns i `Installation wiki <https://github.com/pgRouting/pgrouting/wiki/Notes-on-Download%2C-Installation-and-building-pgRouting>`__"

msgid "To use pgRouting, PostGIS needs to be installed, please read the information about installation in this `Install Guide <https://www.postgis.us/presentations/postgis_install_guide_22.html>`__"
msgstr "För att använda pgRouting måste PostGIS vara installerat, läs informationen om installation i denna installationsguide <https://www.postgis.us/presentations/postgis_install_guide_22.html>`__"

msgid "Short Version"
msgstr "Kort version"

msgid "Extracting the tar ball"
msgstr "Extrahera tar-bollen"

msgid "To compile assuming you have all the dependencies in your search path:"
msgstr "För att kompilera förutsatt att du har alla beroenden i din sökväg:"

msgid "Once pgRouting is installed, it needs to be enabled in each individual database you want to use it in."
msgstr "När pgRouting har installerats måste det aktiveras i varje enskild databas som du vill använda det i."

msgid "Get the sources"
msgstr "Hämta källorna"

msgid "The pgRouting latest release can be found in https://github.com/pgRouting/pgrouting/releases/latest"
msgstr "Den senaste versionen av pgRouting finns på https://github.com/pgRouting/pgrouting/releases/latest"

msgid "To download this release:"
msgstr "För att ladda ner denna release:"

msgid "Go to :ref:`install-short` for more instructions on extracting tar ball and compiling pgRouting."
msgstr "Gå till :ref:`install-short` för mer instruktioner om hur du extraherar tar ball och kompilerar pgRouting."

msgid "git"
msgstr "git"

msgid "To download the repository"
msgstr "Så här laddar du ner arkivet"

msgid "Go to :ref:`install-short` for more instructions on compiling pgRouting (there is no tar ball involved while downloading pgRouting repository from GitHub)."
msgstr "Gå till :ref:`install-short` för mer instruktioner om hur du kompilerar pgRouting (det finns ingen tarball inblandad när du laddar ner pgRouting-arkivet från GitHub)."

msgid "Enabling and upgrading in the database"
msgstr "Aktivering och uppgradering i databasen"

msgid "Enabling the database"
msgstr "Aktivering av databasen"

msgid "pgRouting is a PostgreSQL extension and depends on PostGIS to provide functionalities to end user. Below given code demonstrates enabling PostGIS and pgRouting in the database."
msgstr "pgRouting är en PostgreSQL-förlängning och beror på PostGIS för att tillhandahålla funktioner till slutanvändaren. Nedanstående kod demonstrerar aktivering av PostGIS och pgRouting i databasen."

msgid "Checking PostGIS and pgRouting version after enabling them in the database."
msgstr "Kontroll av PostGIS- och pgRouting-version efter att de har aktiverats i databasen."

msgid "Upgrading the database"
msgstr "Uppgradering av databasen"

msgid "To upgrade pgRouting in the database to version 4.1.0 use the following command:"
msgstr "Använd följande kommando för att uppgradera pgRouting i databasen till version 4.1.0:"

msgid "More information can be found in https://www.postgresql.org/docs/current/sql-createextension.html"
msgstr "Mer information finns på https://www.postgresql.org/docs/current/sql-createextension.html"

msgid "Dependencies"
msgstr "Beroenden"

msgid "Compilation Dependencies"
msgstr "Beroenden för kompilering"

msgid "To be able to compile pgRouting, make sure that the following dependencies are met:"
msgstr "För att kunna kompilera pgRouting måste du se till att följande beroenden är uppfyllda:"

msgid "C and C++0x compilers"
msgstr "C- och C++0x-kompilatorer"

msgid "Compiling with Boost 1.56 up to Boost 1.74 requires C++ Compiler with C++03 or C++11 standard support"
msgstr "Kompilering med Boost 1.56 upp till Boost 1.74 kräver C++-kompilator med standardstöd för C++03 eller C++11"

msgid "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 "Postgresql version >= 13"
msgstr "Postgresql-version >= 13"

msgid "The Boost Graph Library (BGL) >= 1.56.0"
msgstr "Boost Graph Library (BGL) >= 1.56.0"

msgid "CMake >= 3.12"
msgstr "CMake >= 3.12"

msgid "For user's documentation"
msgstr "För användardokumentation"

msgid "Sphinx >= 4.0"
msgstr "Sphinx >= 4.0"

msgid "For developer's documentation"
msgstr "För dokumentation för utvecklare"

msgid "Doxygen >= 1.7"
msgstr "Doxygen >= 1.7"

msgid "For testing"
msgstr "För testning"

msgid "pgtap"
msgstr "pgtap"

msgid "pg_prove"
msgstr "pg_prove"

msgid "For using:"
msgstr "För användning:"

msgid "PostGIS version >= 3.0.0"
msgstr "PostGIS version >= 3.0.0"

msgid "Example: Installing dependencies on linux"
msgstr "Exempel: Installera beroenden på Linux"

msgid "Installing the compilation dependencies"
msgstr "Installera kompileringsberoendena"

msgid "Build dependencies"
msgstr "Bygg beroenden"

msgid "Optional dependencies"
msgstr "Valfria beroenden"

msgid "For documentation"
msgstr "För dokumentation"

msgid "Configuring"
msgstr "Konfigurering"

msgid "pgRouting uses the `cmake` system to do the configuration."
msgstr "pgRouting använder `cmake`-systemet för att göra konfigurationen."

msgid "Configurable variables"
msgstr "Konfigurerbara variabler"

msgid "To see the variables that can be configured"
msgstr "För att se vilka variabler som kan konfigureras"

msgid "The build directory is different from the source directory"
msgstr "Byggkatalogen skiljer sig från källkatalogen"

msgid "Configuring The Documentation"
msgstr "Konfigurera dokumentationen"

msgid "User and developers documentation are not build if prerequisites are not found."
msgstr "Användar- och utvecklardokumentation byggs inte om förutsättningarna inte hittas."

msgid "Most of the effort of the documentation has been on the HTML files. Some variables for building documentation:"
msgstr "Det mesta av arbetet med dokumentationen har lagts på HTML-filerna. Några variabler för att bygga dokumentation:"

msgid "Variable"
msgstr "Variabel"

msgid "Comment"
msgstr "Kommentar"

msgid "BUILD_HTML"
msgstr "BUILD_HTML"

msgid "BOOL=ON"
msgstr "BOOL=ON"

msgid "If ON, turn on/off building HTML for user's documentation"
msgstr "Om ON, aktivera/avaktivera HTML-skapande för användardokumentation"

msgid "BUILD_DOXY"
msgstr "BYGG_DOXY"

msgid "If ON, turn on/off building HTML for developer's documentation"
msgstr "Om ON, aktivera/avaktivera HTML-skapande för utvecklarens dokumentation"

msgid "BUILD_LATEX"
msgstr "BUILD_LATEX"

msgid "BOOL=OFF"
msgstr "BOOL=OFF"

msgid "If ON, turn on/off building PDF"
msgstr "Om ON, slå på/av byggnad PDF"

msgid "BUILD_MAN"
msgstr "BYGGHANDLARE"

msgid "If ON, turn on/off building MAN pages"
msgstr "Om ON, aktivera/avaktivera byggnadens MAN-sidor"

msgid "DOC_USE_BOOTSTRAP"
msgstr "DOC_ANVÄNDA_BOOTSTRAP"

msgid "If ON, use sphinx-bootstrap for HTML pages of the users documentation"
msgstr "Om PÅ, använd sphinx-bootstrap för HTML-sidor i användardokumentationen"

msgid "EN"
msgstr "EN"

msgid "if OFF the English documentation will no be built"
msgstr "om OFF den engelska dokumentationen kommer inte att byggas"

msgid "ES"
msgstr "ES"

msgid "if OFF the Spanish documentation will no be built"
msgstr "om OFF den spanska dokumentationen kommer inte att byggas"

msgid "SV"
msgstr "SV"

msgid "if OFF the Swedish documentation will no be built"
msgstr "om OFF kommer den svenska dokumentationen inte att byggas"

msgid "ZH_HANS"
msgstr "ZH_HANS"

msgid "if OFF the Chinese simplified documentation will no be built"
msgstr "om OFF den kinesiska förenklade dokumentationen kommer inte att byggas"

msgid "Building"
msgstr "Byggnad"

msgid "Using ``make`` to build the code and the documentation"
msgstr "Använda ``make`` för att bygga koden och dokumentationen"

msgid "The following instructions start from ``path/to/pgrouting/build``"
msgstr "Följande instruktioner startar från ``stigen/till/pgrouting/build``"

msgid "We have tested on several platforms, For installing or reinstalling all the steps are needed."
msgstr "Vi har testat på flera plattformar, För installation eller ominstallation behövs alla steg."

msgid "Linux"
msgstr "Linux"

msgid "The following instructions start from ``path/to/pgrouting``"
msgstr "Följande instruktioner börjar från ``path/to/pgrouting``"

msgid "Testing"
msgstr "Testar"

msgid "Currently there is no :code:`make test` and testing is done as follows"
msgstr "För närvarande finns det ingen :code:`make test` och testning görs på följande sätt"

msgid "pgRouting is an extension of `PostGIS <https://postgis.net>`__ and `PostgreSQL <https://www.postgresql.org>`__ geospatial database and adds routing and other network analysis functionality. A predecessor of pgRouting – pgDijkstra, written by Sylvain Pasche from `Camptocamp <https://camptocamp.com>`__, was later extended by Orkney and renamed to pgRouting. The project is now supported and maintained by `Georepublic <https://georepublic.info>`__, `Paragon Corporation <https://www.paragoncorporation.com/>`__ and a broad user community."
msgstr "pgRouting är en förlängning av `PostGIS <https://postgis.net>`__ och `PostgreSQL <https://www.postgresql.org>`__ geospatial databas och lägger till routing och annan nätverksanalysfunktionalitet. En föregångare till pgRouting - pgDijkstra, skriven av Sylvain Pasche från `Camptocamp <https://camptocamp.com>`__, utökades senare av Orkney och döptes om till pgRouting. Projektet stöds och underhålls nu av `Georepublic <https://georepublic.info>`__, `Paragon Corporation <https://www.paragoncorporation.com/>`__ och en bred användargrupp."

msgid "pgRouting is part of `OSGeo Community Projects <https://wiki.osgeo.org/wiki/OSGeo_Community_Projects>`__ from the `OSGeo Foundation <https://www.osgeo.org>`__ and included on `OSGeoLive <http://live.osgeo.org/>`__."
msgstr "pgRouting är en del av `OSGeo Community Projects <https://wiki.osgeo.org/wiki/OSGeo_Community_Projects>`__ från `OSGeo Foundation <https://www.osgeo.org>`__ och ingår i `OSGeoLive <http://live.osgeo.org/>`__."

msgid "Licensing"
msgstr "Licens"

msgid "The following licenses can be found in pgRouting:"
msgstr "Följande licenser finns i pgRouting:"

msgid "**License**"
msgstr "**Licens**"

msgid "GNU General Public License v2.0 or later"
msgstr "GNU General Public License v2.0 eller senare"

msgid "Most features of pgRouting are available under `GNU General Public License v2.0 or later <https://spdx.org/licenses/GPL-2.0-or-later.html>`_."
msgstr "De flesta funktioner i pgRouting är tillgängliga under `GNU General Public License v2.0 eller senare <https://spdx.org/licenses/GPL-2.0-or-later.html>`_."

msgid "Boost Software License - Version 1.0"
msgstr "Licens för Boost-programvara - Version 1.0"

msgid "Some Boost extensions are available under `Boost Software License - Version 1.0 <https://www.boost.org/LICENSE_1_0.txt>`_."
msgstr "Vissa Boost-tillägg är tillgängliga under `Boost Software License - Version 1.0 <https://www.boost.org/LICENSE_1_0.txt>`_."

msgid "MIT-X License"
msgstr "MIT-X-licens"

msgid "Some code contributed by iMaptools.com is available under MIT-X license."
msgstr "Viss kod som tillhandahålls av iMaptools.com är tillgänglig under MIT-X-licens."

msgid "The pgRouting Manual is licensed under a `Creative Commons Attribution-Share Alike 3.0 License <https://creativecommons.org/licenses/by-sa/3.0/>`_."
msgstr "Manualen för pgRouting är licensierad under en `Creative Commons Attribution-Share Alike 3.0 License <https://creativecommons.org/licenses/by-sa/3.0/>`_."

msgid "In general license information should be included in the header of each source file."
msgstr "I allmänhet bör licensinformation inkluderas i sidhuvudet för varje källfil."

msgid "Contributors"
msgstr "Medverkande"

msgid "This Release Contributors"
msgstr "Medverkande i denna utgåva"

msgid "Individuals in this release |release| (in alphabetical order)"
msgstr "Personer i denna utgåva |release| (i alfabetisk ordning)"

msgid "Mohit Rawat, Regina Obe, Vicky Vergara"
msgstr "Mohit Rawat, Regina Obe, Vicky Vergara"

msgid "And all the people that give us a little of their time making comments, finding issues, making pull requests etc. in any of our products: osm2pgrouting, pgRouting, pgRoutingLayer, workshop."
msgstr "Och alla de människor som ger oss lite av sin tid genom att kommentera, hitta problem, göra pull requests etc. i någon av våra produkter: osm2pgrouting, pgRouting, pgRoutingLayer, workshop."

msgid "Translators (in alphabetical order)"
msgstr "Översättare (i alfabetisk ordning)"

msgid "Chinese:"
msgstr "Kinesiska:"

msgid "Dapeng Wang"
msgstr "Dapeng Wang"

msgid "Spanish:"
msgstr "Spanska:"

msgid "Vicky Vergara"
msgstr "Vicky Vergara"

msgid "Swedish:"
msgstr "Svenska:"

msgid "Daniel Nylander"
msgstr "Daniel Nylander"

msgid "Corporate Sponsors in this release (in alphabetical order)"
msgstr "Företagssponsorer i denna utgåva (i alfabetisk ordning)"

msgid "These are corporate entities that have contributed developer time, hosting, or direct monetary funding to the pgRouting project:"
msgstr "Dessa är företagsenheter som har bidragit med utvecklingstid, hosting eller direkt monetär finansiering till pgRouting-projektet:"

msgid "`OSGeo <https://www.osgeo.org>`__"
msgstr "`OSGeo <https://www.osgeo.org>`__"

msgid "`OSGeo UK <https://uk.osgeo.org>`__"
msgstr "oSGeo Storbritannien <https://uk.osgeo.org>`__"

msgid "`Google Summer of Code <https://summerofcode.withgoogle.com>`__"
msgstr "googles sommarprogram för kodning <https://summerofcode.withgoogle.com>`__"

msgid "`HighGo Software <https://www.highgo.com/>`__"
msgstr "`HighGo-programvara <https://www.highgo.com/>`__"

msgid "`Paragon Corporation <https://www.paragoncorporation.com/>`__"
msgstr "`Paragon Corporation <https://www.paragoncorporation.com/>`__"

msgid "Contributors Past & Present:"
msgstr "Tidigare och nuvarande bidragsgivare:"

msgid "Individuals (in alphabetical order)"
msgstr "Enskilda personer (i alfabetisk ordning)"

msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mohit Rawat, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"
msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mohit Rawat, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"

msgid "Corporate Sponsors (in alphabetical order)"
msgstr "Företagssponsorer (i alfabetisk ordning)"

msgid "Camptocamp"
msgstr "Camptocamp"

msgid "CSIS (University of Tokyo)"
msgstr "CSIS (Universitetet i Tokyo)"

msgid "Georepublic"
msgstr "Georepublik"

msgid "Google Summer of Code"
msgstr "Google Summer of Code"

msgid "HighGo Software"
msgstr "HighGo programvara"

msgid "iMaptools"
msgstr "iMaptools"

msgid "Leopark"
msgstr "Leopark"

msgid "Orkney"
msgstr "Orkney"

msgid "OSGeo"
msgstr "OSGeo"

msgid "OSGeo UK"
msgstr "OSGeo Storbritannien"

msgid "Paragon Corporation"
msgstr "Paragon Corporation"

msgid "Versaterm Inc."
msgstr "Versaterm Inc."

msgid "More Information"
msgstr "Mer information"

msgid "The latest software, documentation and news items are available at the pgRouting web site https://pgrouting.org."
msgstr "Den senaste programvaran, dokumentationen och nyheter finns tillgängliga på pgRoutings webbplats https://pgrouting.org."

msgid "PostgreSQL database server at the PostgreSQL main site https://www.postgresql.org."
msgstr "PostgreSQL-databasserver på PostgreSQL-huvudwebbplatsen https://www.postgresql.org."

msgid "PostGIS extension at the PostGIS project web site https://postgis.net."
msgstr "PostGIS-tillägg på PostGIS-projektets webbplats https://postgis.net."

msgid "Boost C++ source libraries at https://www.boost.org."
msgstr "Boost C++-källbibliotek på https://www.boost.org."

msgid ":doc:`migration`"
msgstr ":doc:`migration`"

msgid "``pgr_KSP`` — Yen's algorithm for K shortest paths using Dijkstra."
msgstr "``pgr_KSP`` - Yen's algoritm för K kortaste vägar med hjälp av Dijkstra."

msgid "Availability"
msgstr "Tillgänglighet"

msgid "Version 4.0.0"
msgstr "Version 4.0.0"

msgid "Version 3.6.0"
msgstr "Version 3.6.0"

msgid "Standardizing output columns to |nksp-result|"
msgstr "Standardisering av utdatakolumner till |nksp-result|"

msgid "pgr_ksp(One to One)"
msgstr "pgr_ksp(One to One)"

msgid "Added ``start_vid`` and ``end_vid`` result columns."
msgstr "Lagt till resultatkolumnerna ``start_vid`` och ``end_vid``."

msgid "New proposed signatures:"
msgstr "Nya föreslagna signaturer:"

msgid "pgr_ksp(One to Many)"
msgstr "pgr_ksp(One to Many)"

msgid "pgr_ksp(Many to One)"
msgstr "pgr_ksp(Many to One)"

msgid "pgr_ksp(Many to Many)"
msgstr "pgr_ksp(Many to Many)"

msgid "pgr_ksp(Combinations)"
msgstr "pgr_ksp(Combinations)"

msgid "Version 2.1.0"
msgstr "Version 2.1.0"

msgid "Signature change"
msgstr "Ändring av signatur"

msgid "Old signature no longer supported"
msgstr "Gammal signatur stöds inte längre"

msgid "Version 2.0.0"
msgstr "Version 2.0.0"

msgid "Official function."
msgstr "Officiell funktion."

msgid "The K shortest path routing algorithm based on Yen's algorithm. \"K\" is the number of shortest paths desired."
msgstr "Algoritmen K för kortaste vägen baseras på Yens algoritm. \"K\" är antalet önskade kortaste vägar."

msgid "|Boost| Boost Graph Inside"
msgstr "|Boost| Boost-graf inuti"

msgid "Boost Graph inside"
msgstr "Öka grafen inuti"

msgid "Signatures"
msgstr "Underskrifter"

msgid "Summary"
msgstr "Sammanfattning"

msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vid**, **K**, [**options**])"
msgstr "pgr_KSP(`Kanter SQL`_, **start vid**, **end vid**, **K**, [**options**])"

msgid "pgr_KSP(`Edges SQL`_, **start vid**, **end vids**, **K**, [**options**])"
msgstr "pgr_KSP(`Kanter SQL`_, **start vid**, **end vids**, **K**, [**options**])"

msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vid**, **K**, [**options**])"
msgstr "pgr_KSP(`Kanter SQL`_, **start vids**, **end vid**, **K**, [**options**])"

msgid "pgr_KSP(`Edges SQL`_, **start vids**, **end vids**, **K**, [**options**])"
msgstr "pgr_KSP(`Kanter SQL`_, **start vids**, **end vids**, **K**, [**options**])"

msgid "pgr_KSP(`Edges SQL`_, `Combinations SQL`_, **K**, [**options**])"
msgstr "pgr_KSP(`Kanter SQL`_, `Combinations SQL`_, **K**, [**options**])"

msgid "**options:** ``[directed, heap_paths]``"
msgstr "**options:** ``[directed, heap_paths]``"

msgid "Returns set of |nksp-result|"
msgstr "Returnerar uppsättning av |nksp-result|"

msgid "OR EMPTY SET"
msgstr "ELLER TOM UPPSÄTTNING"

msgid "Example"
msgstr "Exempel"

msgid "Get 2 paths from :math:`6` to :math:`17` on a directed graph."
msgstr "Hämta 2 vägar från :math:`6` till :math:`17` på en riktad graf."

msgid "Get 2 paths from vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph."
msgstr "Hämta 2 vägar från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` i en riktad graf."

msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph."
msgstr "Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till toppunkten :math:`17` i en riktad graf."

msgid "Get 2 paths vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on a directed graph."
msgstr "Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till topparna :math:`\\{10, 17\\}` i en riktad graf."

msgid "Using a combinations table on an directed graph"
msgstr "Använda en kombinationstabell på en riktad graf"

msgid "The combinations table:"
msgstr "Kombinationsbordet:"

msgid "The query:"
msgstr "Frågeställningen:"

msgid "Identifier of the destination vertex."
msgstr "Identifierare för målvertexen."

msgid "**K**"
msgstr "**K**"

msgid "Number of required paths."
msgstr "Antal nödvändiga sökvägar."

msgid "KSP Optional parameters"
msgstr "KSP Valfria parametrar"

msgid "``heap_paths``"
msgstr "``heap_paths``"

msgid "When ``false`` Returns at most K paths."
msgstr "När ``false`` Returnerar högst K sökvägar."

msgid "When ``true`` all the calculated paths while processing are returned."
msgstr "När ``true`` returneras alla beräknade banor under bearbetningen."

msgid "Roughly, when the shortest path has ``N`` edges, the heap will contain about than ``N * K`` paths for small value of ``K`` and ``K > 5``."
msgstr "Grovt sett, när den kortaste vägen har ``N`` kanter, kommer högen att innehålla ungefär än ``N * K`` vägar för litet värde av ``K`` och ``K > 5``."

msgid "Additional Examples"
msgstr "Ytterligare exempel"

msgid "Get 2 paths from :math:`6` to :math:`17` on an undirected graph"
msgstr "Hämta 2 vägar från :math:`6` till :math:`17` på en odelad graf"

msgid "Also get the paths in the heap."
msgstr "Hämta även sökvägarna i högen."

msgid "Get 2 paths using combinations table on an undirected graph"
msgstr "Få 2 vägar med hjälp av kombinationstabell på en oriktad graf"

msgid "Get 2 paths from vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a undirected graph."
msgstr "Hämta 2 vägar från topparna :math:`\\{6, 1\\}` till toppunkten :math:`17` i en odelad graf."

msgid "https://en.wikipedia.org/wiki/K_shortest_path_routing"
msgstr "https://en.wikipedia.org/wiki/K_shortest_path_routing"

msgid "``pgr_TSP``"
msgstr "``pgr_TSP``"

msgid "``pgr_TSP`` - Approximation using *metric* algorithm."
msgstr "``pgr_TSP`` - Approximation med hjälp av *metrisk* algoritm."

msgid "Availability:"
msgstr "Tillgänglighet:"

msgid "Version 3.2.1"
msgstr "Version 3.2.1"

msgid "Metric Algorithm from `Boost library <https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"
msgstr "Metrisk algoritm från `Boost-biblioteket <https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"

msgid "Simulated Annealing Algorithm no longer supported"
msgstr "Simulated Annealing Algorithm stöds inte längre"

msgid "The Simulated Annealing Algorithm related parameters are ignored: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`"
msgstr "Parametrar relaterade till Simulated Annealing Algorithm ignoreras: `max_processing_time`, `tries_per_temperature`, `max_changes_per_temperature`, `max_consecutive_non_changes`, `initial_temperature`, `final_temperature`, `cooling_factor`, `randomize`"

msgid "Version 2.3.0"
msgstr "Version 2.3.0"

msgid "Results change depending on input order of the `Matrix SQL`_"
msgstr "Resultaten ändras beroende på inmatningsordningen för `Matrix SQL`_"

msgid "Negative costs are ignored."
msgstr "Negativa kostnader ignoreras."

msgid "Can be Used with :doc:`costMatrix-category` functions preferably with `directed => false`."
msgstr "Kan användas med :doc:`costMatrix-category` funktioner helst med `directed => false`."

msgid "With ``directed => false``"
msgstr "Med ``riktad => falsk``"

msgid "Will generate a graph that:"
msgstr "Kommer att generera en graf som:"

msgid "is undirected"
msgstr "är ostyrd"

msgid "is fully connected (As long as the graph has one component)"
msgstr "är helt sammanhängande (så länge grafen har en komponent)"

msgid "all traveling costs on edges obey the triangle inequality."
msgstr "alla resekostnader på kanter följer triangelolikheten."

msgid "When ``start_vid = 0 OR end_vid = 0``"
msgstr "När ``start_vid = 0 OR end_vid = 0``"

msgid "The solutions generated are guaranteed to be *twice as long as the optimal tour in the worst case*"
msgstr "De lösningar som genereras är garanterat * dubbelt så långa som den optimala turen i värsta fall*"

msgid "When ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``"
msgstr "När ``start_vid != 0 AND end_vid != 0 AND start_vid != end_vid``"

msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour, due to the fact that `end_vid` is forced to be in a fixed position."
msgstr "Det är **inte garanterat** att lösningen i värsta fall kommer att vara dubbelt så lång som den optimala turen, eftersom `end_vid` tvingas vara i en fast position."

msgid "With ``directed => true``"
msgstr "Med ``riktad => sann``"

msgid "It is **not guaranteed** that the solution will be, in the worst case, twice as long as the optimal tour"
msgstr "Det är **inte garanterat** att lösningen i värsta fall kommer att vara dubbelt så lång som den optimala turen"

msgid "is directed"
msgstr "är riktad"

msgid "some (or all) traveling costs on edges might not obey the triangle inequality."
msgstr "vissa (eller alla) resekostnader på kanter kanske inte följer triangelolikheten."

msgid "As an undirected graph is required, the directed graph is transformed as follows:"
msgstr "Eftersom det krävs en oriktad graf, omvandlas den riktade grafen enligt följande:"

msgid "edges `(u, v)` and `(v, u)` is considered to be the same edge (denoted `(u, v)`"
msgstr "kanterna `(u, v)` och `(v, u)` anses vara samma kant (betecknas `(u, v)`)"

msgid "if ``agg_cost`` differs between one or more instances of edge `(u, v)`"
msgstr "om ``agg_cost`` skiljer sig mellan en eller flera instanser av kant `(u, v)``"

msgid "The minimum value of the ``agg_cost`` all instances of edge `(u, v)` is going to be considered as the ``agg_cost`` of edge `(u, v)`"
msgstr "Det lägsta värdet av ``agg_cost`` för alla instanser av kanten `(u, v)`` kommer att betraktas som ``agg_cost`` för kanten `(u, v)``"

msgid "Some (or all) traveling costs on edges will still might not obey the triangle inequality."
msgstr "Vissa (eller alla) resekostnader på kanter kommer kanske ändå inte att följa triangelolikheten."

msgid "When the data does not come from an undirected graph or its not fully connected:"
msgstr "När data inte kommer från en odelad graf eller om den inte är helt sammanhängande:"

msgid "Missing values will be calculated with dijkstra algorithm."
msgstr "Saknade värden kommer att beräknas med dijkstra-algoritmen."

msgid "When the graph has more than one component:"
msgstr "När grafen har mer än en komponent:"

msgid "``start_vid`` or ``end_vid`` are defined and are on the same component: the TSP tour will happen on that component."
msgstr "``start_vid`` eller ``slut_vid`` är definierade och finns på samma komponent: TSP-turen kommer att äga rum på den komponenten."

msgid "``start_vid`` or ``end_vid`` are defined and are not on the same component: the TSP tour will propose a tour that has both components where connecting costs are estimated."
msgstr "``start_vid`` eller ``slut_vid`` definieras och inte finns på samma komponent: TSP-turen kommer att föreslå en tur som har båda komponenterna där anslutningskostnaderna beräknas."

msgid "``start_vid`` or ``end_vid`` are not defined: the starting point could be on any component and will include data only from that component."
msgstr "``start_vid`` eller ``end_vid`` är inte definierade: startpunkten kan vara på vilken komponent som helst och kommer endast att innehålla data från den komponenten."

msgid "One cycle attempt to remove crossing edges is done to the TSP results."
msgstr "Ett cykelförsök för att ta bort korsande kanter görs på TSP-resultaten."

msgid "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)"
msgstr "pgr_TSP(`Matrix SQL`_, ``[start_id, end_id]``)"

msgid "Returns set of |tsp-result|"
msgstr "Returnerar uppsättning av |tsp-result|"

msgid "Using :doc:`pgr_dijkstraCostMatrix` to generate the matrix information"
msgstr "Använd :doc:`pgr_dijkstraCostMatrix` för att generera matrisinformationen"

msgid "**Line 4** Vertices :math:`\\{2, 4, 13, 14\\}` are not included because they are not connected."
msgstr "**Linje 4** Punkterna :math:`{\\{2, 4, 13, 14\\\\}` är inte inkluderade eftersom de inte är anslutna."

msgid "`Matrix SQL`_ as described below"
msgstr "`Matrix SQL`_ enligt beskrivningen nedan"

msgid "``ANY-INTEGER``"
msgstr "``ANY-INTEGER``"

msgid "``ANY-NUMERICAL``"
msgstr "``ANY-NUMERICAL``"

msgid "Cost for going from start_vid to end_vid"
msgstr "Kostnad för att gå från start_vid till slut_vid"

msgid "Returns SET OF ``(seq, node, cost, agg_cost)``"
msgstr "Returnerar SET OF ``(seq, nod, kostnad, agg_cost)``"

msgid "Row sequence."
msgstr "Radsekvens."

msgid "**node**"
msgstr "**node**"

msgid "Identifier of the node/coordinate/point."
msgstr "Identifierare av nod/koordinat/punkt."

msgid "Cost to traverse from the current ``node`` to the next ``node`` in the path sequence."
msgstr "Kostnad för att gå från aktuell ``nod`` till nästa ``nod`` i sökvägssekvensen."

msgid "``0`` for the last row in the tour sequence."
msgstr "``0`` för den sista raden i turordningssekvensen."

msgid "Aggregate cost from the ``node`` at ``seq = 1`` to the current node."
msgstr "Sammanlagd kostnad från ``noden`` vid ``seq = 1`` till den aktuella noden."

msgid "``0`` for the first row in the tour sequence."
msgstr "``0`` för den första raden i turordningen."

msgid "Start from vertex :math:`1`"
msgstr "Start från toppunkten :math:`1`"

msgid "**Line 6** ``start_vid => 1``"
msgstr "**Linje 6** ``start_vid => 1``"

msgid "Using points of interest to generate an asymmetric matrix."
msgstr "Använda intressepunkter för att generera en asymmetrisk matris."

msgid "To generate an asymmetric matrix:"
msgstr "För att generera en asymmetrisk matris:"

msgid "**Line 4** The ``side`` information of ``pointsOfInterset`` is ignored by not including it in the query"
msgstr "**Linje 4** Informationen om ``sidan`` av ``pointsOfInterset`` ignoreras genom att inte inkludera den i frågan"

msgid "**Line 6** Generating an asymmetric matrix with ``directed => true``"
msgstr "**Linje 6** Generering av en asymmetrisk matris med ``directed => true``"

msgid ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``"
msgstr ":math:`min(agg\\_cost(u, v), agg\\_cost(v, u))` is going to be considered as the ``agg_cost``"

msgid "The solution that can be larger than *twice as long as the optimal tour* because:"
msgstr "Lösningen som kan vara större än *dubbelt så lång som den optimala turen* eftersom:"

msgid "Triangle inequality might not be satisfied."
msgstr "Triangelns ojämlikhet kanske inte uppfylls."

msgid "``start_id != 0 AND end_id != 0``"
msgstr "``start_id != 0 AND end_id != 0``"

msgid "Connected incomplete data"
msgstr "Anslutna ofullständiga data"

msgid "Using selected edges :math:`\\{2, 4, 5, 8, 9, 15\\}` the matrix is not complete."
msgstr "Med hjälp av valda kanter :math:`\\{2, 4, 5, 8, 9, 15\\}` är matrisen inte komplett."

msgid "Cost value for :math:`17 \\rightarrow 10` do not exist on the matrix, but the value used is taken from :math:`10 \\rightarrow 17`."
msgstr "Kostnadsvärdet för :math:`17 \\rightarrow 10` finns inte i matrisen, men det värde som används hämtas från :math:`10 \\rightarrow 17`."

msgid "``pgr_TSPeuclidean``"
msgstr "``pgr_TSPeuclidean``"

msgid "``pgr_TSPeuclidean`` - Approximation using *metric* algorithm."
msgstr "``pgr_TSPeuclidean`` - Approximation med hjälp av *metrisk* algoritm."

msgid "Using `Boost: metric TSP approx <https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"
msgstr "Använda `Boost: metrisk TSP ca <https://www.boost.org/libs/graph/doc/metric_tsp_approx.html>`__"

msgid "Name change from pgr_eucledianTSP"
msgstr "Namnändring från pgr_eucledianTSP"

msgid "New official function."
msgstr "Ny officiell funktion."

msgid "Results change depending on input order of the `Coordinates SQL`_"
msgstr "Resultaten ändras beroende på inmatningsordningen för `Koordinater SQL`_"

msgid "Any duplicated identifier will be ignored. The coordinates that will be kept is arbitrarily."
msgstr "Alla duplicerade identifierare kommer att ignoreras. De koordinater som kommer att behållas är godtyckliga."

msgid "The coordinates are quite similar for the same identifier, for example ::"
msgstr "Koordinaterna är ganska lika för samma identifierare, till exempel ::"

msgid "The coordinates are quite different for the same identifier, for example ::"
msgstr "Koordinaterna är helt olika för samma identifierare, till exempel ::"

msgid "pgr_TSPeuclidean(`Coordinates SQL`_, ``[start_id, end_id]``)"
msgstr "pgr_TSPeuclidean(`koordinater SQL`_, ``[start_id, end_id]``)"

msgid "With default values"
msgstr "Med standardvärden"

msgid "`Coordinates SQL`_"
msgstr "`Koordinater SQL`_"

msgid "`Coordinates SQL`_ as described below"
msgstr "`Koordinater SQL`_ enligt beskrivningen nedan"

msgid "Coordinates SQL"
msgstr "Koordinater SQL"

msgid "``x``"
msgstr "``x``"

msgid "X value of the coordinate."
msgstr "X-värde för koordinaten."

msgid "``y``"
msgstr "``y``"

msgid "Y value of the coordinate."
msgstr "Y-värde för koordinaten."

msgid "Test 29 cities of Western Sahara"
msgstr "Test 29 städer i Västsahara"

msgid "This example shows how to make performance tests using University of Waterloo's `example data <https://www.math.uwaterloo.ca/tsp/world/countries.html>`__ using the 29 cities of `Western Sahara dataset <https://www.math.uwaterloo.ca/tsp/world/wi29.tsp>`__"
msgstr "I det här exemplet visas hur man gör prestandatester med hjälp av University of Waterloos \"exempeldata\" <https://www.math.uwaterloo.ca/tsp/world/countries.html>`__ med hjälp av de 29 städerna i \"Västsaharas dataset\" <https://www.math.uwaterloo.ca/tsp/world/wi29.tsp>`__"

msgid "Creating a table for the data and storing the data"
msgstr "Skapa en tabell för data och lagra data"

msgid "Adding a geometry (for visual purposes)"
msgstr "Lägga till en geometri (för visuella ändamål)"

msgid "Total tour cost"
msgstr "Total kostnad för resan"

msgid "Getting a total cost of the tour, compare the value with the length of an optimal tour is 27603, given on the dataset"
msgstr "Få en total kostnad för turnén, jämför värdet med längden på en optimal turné är 27603, givet på datasetet"

msgid "Getting a geometry of the tour"
msgstr "Att få en geometri av turen"

msgid "Visual results"
msgstr "Visuella resultat"

msgid "Visually, The first image is the `optimal solution <https://www.math.uwaterloo.ca/tsp/world/witour.html>`__ and the second image is the solution obtained with ``pgr_TSPeuclidean``."
msgstr "Visuellt, Den första bilden är den `optimala lösningen <https://www.math.uwaterloo.ca/tsp/world/witour.html>`__ och den andra bilden är den lösning som erhållits med ``pgr_TSPeuclidean``."

msgid "``pgr_aStar`` — Shortest path using the A* algorithm."
msgstr "``pgr_aStar`` - Kortaste vägen med hjälp av A*-algoritmen."

msgid "Standardizing output columns to |short-generic-result|"
msgstr "Standardisering av utdatakolumner till |short-generic-result|"

msgid "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns."
msgstr "pgr_aStar(One to One) added ``start_vid`` and ``end_vid`` columns."

msgid "pgr_aStar(One to Many) added ``end_vid`` column."
msgstr "pgr_aStar(One to Many) added ``end_vid`` column."

msgid "pgr_aStar(Many to One) added ``start_vid`` column."
msgstr "pgr_aStar(Many to One) added ``start_vid`` column."

msgid "New proposed signature:"
msgstr "Nytt förslag till signatur:"

msgid "pgr_aStar(Combinations)"
msgstr "pgr_aStar(Combinations)"

msgid "Version 2.4.0"
msgstr "Version 2.4.0"

msgid "pgr_aStar(One to Many)"
msgstr "pgr_aStar(One to Many)"

msgid "pgr_aStar(Many to One)"
msgstr "pgr_aStar(Many to One)"

msgid "pgr_aStar(Many to Many)"
msgstr "pgr_aStar(Many to Many)"

msgid "Signature change on pgr_aStar(One to One)"
msgstr "Ändring av signatur på pgr_aStar(One to One)"

msgid "The results are equivalent to the union of the results of the `pgr_aStar(` `One to One`_ `)` on the:"
msgstr "Resultaten är likvärdiga med sammanslagningen av resultaten från `pgr_aStar(` `One to One`_ `)` på :"

msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vid**, [**options**])"
msgstr "pgr_aStar(`Kanter SQL`_, **start vid**, **end vid**, [**options**])"

msgid "pgr_aStar(`Edges SQL`_, **start vid**, **end vids**, [**options**])"
msgstr "pgr_aStar(`Kanter SQL`_, **start vid**, **end vids**, [**options**])"

msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vid**, [**options**])"
msgstr "pgr_aStar(`Kanter SQL`_, **start vids**, **end vid**, [**options**])"

msgid "pgr_aStar(`Edges SQL`_, **start vids**, **end vids**, [**options**])"
msgstr "pgr_aStar(`Kanter SQL`_, **start vids**, **end vids**, [**options**])"

msgid "pgr_aStar(`Edges SQL`_, `Combinations SQL`_, [**options**])"
msgstr "pgr_aStar(`Kanter SQL`_, `Combinations SQL`_, [**options**])"

msgid "**options:** ``[directed, heuristic, factor, epsilon]``"
msgstr "**options:** ``[directed, heuristic, factor, epsilon]``"

msgid "Returns set of |short-generic-result|"
msgstr "Returnerar uppsättning av |short-generic-result|"

msgid "Optional parameters are `named parameters` and have a default value."
msgstr "Valfria parametrar är \"namngivna parametrar\" och har ett standardvärde."

msgid "From vertex :math:`6` to vertex :math:`12` on a **directed** graph with heuristic :math:`2`"
msgstr "Från toppunkt :math:`6` till toppunkt :math:`12` på en **riktad** graf med heuristik :math:`2`"

msgid "From vertex :math:`6` to vertices :math:`\\{10, 12\\}` on a **directed** graph with heuristic :math:`3` and factor :math:`3.5`"
msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 12\\}` på en **riktad** graf med heuristiken :math:`3` och faktorn :math:`3.5`"

msgid "From vertices :math:`\\{6, 8\\}` to vertex :math:`10` on an **undirected** graph with heuristic :math:`4`"
msgstr "Från topparna :math:`\\{6, 8\\}` till topp :math:`10` på en **omdirigerad** graf med heuristiken :math:`4`"

msgid "From vertices :math:`\\{6, 8\\}` to vertices :math:`\\{10, 12\\}` on a **directed** graph with factor :math:`0.5`"
msgstr "Från topparna :math:`\\{6, 8\\}` till topparna :math:`\\{10, 12\\}` på en **riktad** graf med faktorn :math:`0.5`"

msgid "Using a combinations table on a **directed** graph with factor :math:`0.5`."
msgstr "Använda en kombinationstabell på en **riktad** graf med faktor :math:`0.5`."

msgid "Example 1"
msgstr "Exempel 1"

msgid "Demonstration of repeated values are ignored, and result is sorted."
msgstr "Demonstration av upprepade värden ignoreras och resultatet sorteras."

msgid "Example 2"
msgstr "Exempel 2"

msgid "Making **start vids** the same as **end vids**."
msgstr "Att göra **start vids** samma som **slut vids**."

msgid "Example 3"
msgstr "Exempel 3"

msgid "Manually assigned vertex combinations."
msgstr "Manuellt tilldelade toppunktskombinationer."

msgid "``pgr_aStarCost``"
msgstr "``pgr_aStarCost``"

msgid "``pgr_aStarCost`` - Total cost of the shortest path using the A* algorithm."
msgstr "``pgr_aStarCost`` - Totalkostnad för den kortaste vägen med A*-algoritmen."

msgid "pgr_aStarCost(Combinations)"
msgstr "pgr_aStarCost(Combinations)"

msgid "New proposed function."
msgstr "Ny föreslagen funktion."

msgid "The ``pgr_aStarCost`` function summarizes the cost of the shortest path using the A* algorithm."
msgstr "Funktionen ``pgr_aStarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av A*-algoritmen."

msgid "Let be the case the values returned are stored in a table, so the unique index would be the pair: `(start_vid, end_vid)`"
msgstr "Låt oss anta att de returnerade värdena lagras i en tabell, så det unika indexet skulle vara paret: `(start_vid, end_vid)`"

msgid "For undirected graphs, the results are symmetric."
msgstr "För oriktade grafer är resultaten symmetriska."

msgid "The returned values are ordered in ascending order:"
msgstr "De returnerade värdena sorteras i stigande ordning:"

msgid "`start_vid` ascending"
msgstr "`start_vid` stigande"

msgid "`end_vid` ascending"
msgstr "`end_vid` stigande"

msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])"
msgstr "pgr_aStarCost(`Kanter SQL`_, **start vid**, **end vid**, [**options**])"

msgid "pgr_aStarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])"
msgstr "pgr_aStarCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])"

msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])"
msgstr "pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])"

msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])"
msgstr "pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])"

msgid "pgr_aStarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])"
msgstr "pgr_aStarCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])"

msgid "Returns set of |matrix-result|"
msgstr "Returnerar uppsättning av |matrix-result|"

msgid "pgr_aStarCost(`Edges SQL`_, **start vids**, **end vids**, [options])"
msgstr "pgr_aStarCost(`Kanter SQL`_, **start vids**, **end vids**, [options])"

msgid "``pgr_aStarCostMatrix``"
msgstr "``pgr_aStarCostMatrix``"

msgid "``pgr_aStarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`."
msgstr "``pgr_aStarCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_aStar`."

msgid "Using internally the :doc:`pgr_aStar` algorithm"
msgstr "Intern användning av :doc:`pgr_aStar`-algoritmen"

msgid "Returns a cost matrix."
msgstr "Returnerar en kostnadsmatris."

msgid "No ordering is performed"
msgstr "Ingen beställning utförs"

msgid "let `v` and `u` are nodes on the graph:"
msgstr "låt `v` och `u` vara noder i grafen:"

msgid "when there is no path from `v` to `u`:"
msgstr "när det inte finns någon väg från `v` till `u`:"

msgid "cost from `v` to `u` is :math:`\\inf`"
msgstr "kostnaden från `v` till `u` är :math:`\\inf`"

msgid "when :math:`v = u` then"
msgstr "när :math:`v = u` då"

msgid "cost from `v` to `u` is :math:`0`"
msgstr "kostnaden från `v` till `u` är :math:`0`"

msgid "When the graph is **undirected** the cost matrix is symmetric"
msgstr "När grafen är **icke-riktad** är kostnadsmatrisen symmetrisk"

msgid "pgr_aStarCostMatrix(`Edges SQL`_, **start vids**, [**options**])"
msgstr "pgr_aStarCostMatrix(`Kanter SQL`_, **start vids**, [**options**])"

msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph using heuristic :math:`2`"
msgstr "Symmetrisk kostnadsmatris för topparna :math:`\\{5, 6, 10, 15\\}` på en **omdirigerad** graf med heuristiken :math:`2`"

msgid "Use with :doc:`pgr_TSP`"
msgstr "Använd med :doc:`pgr_TSP`"

msgid "``pgr_articulationPoints``"
msgstr "``pgr_articulationPoints``"

msgid "``pgr_articulationPoints`` - Return the articulation points of an undirected graph."
msgstr "``pgr_articulationPoints`` - Returnerar artikulationspunkterna i en odränerad graf."

msgid "Result columns change: ``seq`` is removed"
msgstr "Ändring av resultatkolumner: ``seq`` tas bort"

msgid "Version 2.5.0"
msgstr "Version 2.5.0"

msgid "Those vertices that belong to more than one biconnected component are called articulation points or, equivalently, cut vertices. Articulation points are vertices whose removal would increase the number of connected components in the graph. This implementation can only be used with an undirected graph."
msgstr "De hörn som tillhör mer än en biconnected komponent kallas artikulationspunkter eller, på motsvarande sätt, cut vertices. Artikulationspunkter är hörn vars borttagning skulle öka antalet anslutna komponenter i grafen. Denna implementation kan endast användas med en odelad graf."

msgid "Works for **undirected** graphs."
msgstr "Fungerar för **undirected** grafer."

msgid "``node`` ascending"
msgstr "``nod`` stigande"

msgid "Running time: :math:`O(V + E)`"
msgstr "Speltid: :math:`O(V + E)`"

msgid "pgr_articulationPoints(`Edges SQL`_)"
msgstr "pgr_articulationPoints(`Kanter SQL`_)"

msgid "Returns set of |result-node|"
msgstr "Returnerar uppsättning av |result-node|"

msgid "The articulation points of the graph"
msgstr "Diagrammets artikulationspunkter"

msgid "Nodes in red are the articulation points."
msgstr "Rödmarkerade noder är artikulationspunkterna."

msgid "Identifier of the vertex."
msgstr "Identifierare för toppunkten."

msgid "`Boost: Biconnected components & articulation points <https://www.boost.org/libs/graph/doc/biconnected_components.html>`__"
msgstr "`Boost: Biconnected komponenter & ledpunkter <https://www.boost.org/libs/graph/doc/biconnected_components.html>`__"

msgid "wikipedia: `Biconnected component <https://en.wikipedia.org/wiki/Biconnected_component>`__"
msgstr "wikipedia: `Sammankopplad komponent <https://en.wikipedia.org/wiki/Biconnected_component>`__"

msgid "``pgr_bandwidth`` - Experimental"
msgstr "``pgr_bandbredd`` - Experimentell"

msgid "``pgr_bandwidth`` - Calculates the bandwidth of the graph"
msgstr "``pgr_bandwidth`` - Beräknar grafens bandbredd"

msgid "Bandwidth measures how \"spread out\" the connections are in a graph when vertices are arranged in a linear order (like numbering them 1, 2, 3, etc.)."
msgstr "Bandbredden mäter hur \"utspridda\" kopplingarna är i en graf när hörnen är ordnade i en linjär ordning (som att numrera dem 1, 2, 3 osv.)."

msgid "For each edge in the graph, calculate the distance between the vertex numbers it connects"
msgstr "För varje kant i grafen, beräkna avståndet mellan de toppunktsnummer som den ansluter till"

msgid "The bandwidth is the maximum of all these distances"
msgstr "Bandbredden är den maximala av alla dessa avstånd"

msgid "The implementation is for undirected graphs"
msgstr "Implementationen är för undirected grafer"

msgid "Run time is 0.160789 seconds"
msgstr "Körtiden är 0,160789 sekunder"

msgid "pgr_bandwidth(`Edges SQL`_)"
msgstr "pgr_bandbredd(`Edges SQL`_)"

msgid "Returns ``BIGINT``"
msgstr "Returnerar ``BIGINT``"

msgid "For an undirected graph with edges."
msgstr "För en enkelriktad graf med kanter."

msgid "Returns a bigint ``(pgr_bandwidth)``"
msgstr "Returnerar en bigint ``(pgr_bandwidth)``"

msgid "``pgr_bandwidth``"
msgstr "``pgr_bandwidth``"

msgid "gives the bandwidth of the graph."
msgstr "ger grafens bandbredd."

msgid "Undirected graph with edges before optimization."
msgstr "Oriktad graf med kanter före optimering."

msgid "Undirected graph with edges after optimization."
msgstr "Oriktad graf med kanter efter optimering."

msgid "`Boost: bandwidth <https://www.boost.org/libs/graph/doc/bandwidth.html>`_"
msgstr "`Boost: bandbredd <https://www.boost.org/libs/graph/doc/bandwidth.html>`_"

msgid "``pgr_bdAstar``"
msgstr "``pgr_bdAstar``"

msgid "``pgr_bdAstar`` — Shortest path using the bidirectional A* algorithm."
msgstr "``pgr_bdAstar`` - Kortaste vägen med hjälp av den dubbelriktade A*-algoritmen."

msgid "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns."
msgstr "pgr_bdAstar(One to One) added ``start_vid`` and ``end_vid`` columns."

msgid "pgr_bdAstar(One to Many) added ``end_vid`` column."
msgstr "pgr_bdAstar(One to Many) added ``end_vid`` column."

msgid "pgr_bdAstar(Many to One) added ``start_vid`` column."
msgstr "pgr_bdAstar(Many to One) added ``start_vid`` column."

msgid "pgr_bdAstar(Combinations)"
msgstr "pgr_bdAstar(Combinations)"

msgid "pgr_bdAstar(One to Many)"
msgstr "pgr_bdAstar(One to Many)"

msgid "pgr_bdAstar(Many to One)"
msgstr "pgr_bdAstar(Many to One)"

msgid "pgr_bdAstar(Many to Many)"
msgstr "pgr_bdAstar(Many to Many)"

msgid "Signature change on pgr_bdAstar(One to One)"
msgstr "Ändring av signatur på pgr_bdAstar(One to One)"

msgid "The results are equivalent to the union of the results of pgr_bdAStar(One to One) on the:"
msgstr "Resultaten är likvärdiga med sammanslagningen av resultaten av pgr_bdAStar(One to One) på:"

msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vid**, [**options**])"
msgstr "pgr_bdAstar(`Kanter SQL`_, **start vid**, **end vid**, [**options**])"

msgid "pgr_bdAstar(`Edges SQL`_, **start vid**, **end vids**, [**options**])"
msgstr "pgr_bdAstar(`Kanter SQL`_, **start vid**, **end vids**, [**options**])"

msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vid**, [**options**])"
msgstr "pgr_bdAstar(`Kanter SQL`_, **start vids**, **end vid**, [**options**])"

msgid "pgr_bdAstar(`Edges SQL`_, **start vids**, **end vids**, [**options**])"
msgstr "pgr_bdAstar(`Kanter SQL`_, **start vids**, **end vids**, [**options**])"

msgid "pgr_bdAstar(`Edges SQL`_, `Combinations SQL`_, [**options**])"
msgstr "pgr_bdAstar(`Kanter SQL`_, `Combinations SQL`_, [**options**])"

msgid "``pgr_bdAstarCost``"
msgstr "``pgr_bdAstarCost``"

msgid "``pgr_bdAstarCost`` - Total cost of the shortest path using the bidirectional A* algorithm."
msgstr "``pgr_bdAstarCost`` - Totalkostnad för den kortaste vägen med hjälp av den dubbelriktade A*-algoritmen."

msgid "pgr_bdAstarCost(Combinations)"
msgstr "pgr_bdAstarCost(Combinations)"

msgid "The ``pgr_bdAstarCost`` function summarizes the cost of the shortest path using the bidirectional A* algorithm."
msgstr "Funktionen ``pgr_bdAstarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade A*-algoritmen."

msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vid**, [**options**])"
msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vid**, **end vid**, [**options**])"

msgid "pgr_bdAstarCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])"
msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])"

msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])"
msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])"

msgid "pgr_bdAstarCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])"
msgstr "pgr_bdAstarCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])"

msgid "pgr_bdAstarCost(`Edges SQL`_, `Combinations SQL`_, [**options**])"
msgstr "pgr_bdAstarCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])"

msgid "``pgr_bdAstarCostMatrix``"
msgstr "``pgr_bdAstarCostMatrix``"

msgid "``pgr_bdAstarCostMatrix`` - Calculates the cost matrix using :doc:`pgr_bdAstar`."
msgstr "``pgr_bdAstarCostMatrix`` - Beräknar kostnadsmatrisen med hjälp av :doc:`pgr_bdAstar`."

msgid "Internally uses the :doc:`pgr_bdAstar` algorithm."
msgstr "Internt används algoritmen :doc:`pgr_bdAstar`."

msgid "pgr_bdAstarCostMatrix(`Edges SQL`_, **start vids**, [**options**])"
msgstr "pgr_bdAstarCostMatrix(`Kanter SQL`_, **start vids**, [**options**])"

msgid "``pgr_bdDijkstra`` — Returns the shortest path using Bidirectional Dijkstra algorithm."
msgstr "``pgr_bdDijkstra`` - Returnerar den kortaste vägen med hjälp av Bidirectional Dijkstra-algoritmen."

msgid "pgr_bdDijkstra(Combinations)"
msgstr "pgr_bdDijkstra(Combinations)"

msgid "pgr_bdDijkstra(One to Many)"
msgstr "pgr_bdDijkstra(One to Many)"

msgid "pgr_bdDijkstra(Many to One)"
msgstr "pgr_bdDijkstra(Many to One)"

msgid "pgr_bdDijkstra(Many to Many)"
msgstr "pgr_bdDijkstra(Many to Many)"

msgid "Signature change on pgr_bdDijkstra(One to One)"
msgstr "Ändring av signatur på pgr_bdDijkstra(One to One)"

msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])"

msgid "pgr_bdDijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])"

msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])"

msgid "pgr_bdDijkstra(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_bdDijkstra(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])"

msgid "pgr_bdDijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_bdDijkstra(`Kanter SQL`_, `Combinations SQL`_, [``directed``])"

msgid "From vertex :math:`6` to vertex :math:`10` on a **directed** graph"
msgstr "Från toppunkten :math:`6` till toppunkten :math:`10` på en **riktad** graf"

msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a **directed** graph"
msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` i en **riktad** graf"

msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a **directed** graph"
msgstr "Från topparna :math:`\\{6, 1\\}` till topp :math:`17` på en **riktad** graf"

msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an **undirected** graph"
msgstr "Från topparna :math:`{6, 1\\}` till topparna :math:`{10, 17\\}` på en **omdirigerad** graf"

msgid "Using a combinations table on an **undirected** graph"
msgstr "Använda en kombinationstabell i en **icke-riktad** graf"

msgid "https://en.wikipedia.org/wiki/Bidirectional_search"
msgstr "https://en.wikipedia.org/wiki/Bidirectional_search"

msgid "``pgr_bdDijkstraCost``"
msgstr "``pgr_bdDijkstraCost``"

msgid "``pgr_bdDijkstraCost`` — Returns the shortest path's cost using Bidirectional Dijkstra algorithm."
msgstr "``pgr_bdDijkstraCost`` - Returnerar den kortaste vägens kostnad med hjälp av Bidirectional Dijkstra-algoritmen."

msgid "pgr_bdDijkstraCost(Combinations)"
msgstr "pgr_bdDijkstraCost(Combinations)"

msgid "The ``pgr_bdDijkstraCost`` function summarizes the cost of the shortest path using the bidirectional Dijkstra Algorithm."
msgstr "Funktionen ``pgr_bdDijkstraCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade Dijkstra-algoritmen."

msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vid** , [``directed``])"
msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vid**, **end vid** , [``directed``])"

msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])"

msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vid** , [``directed``])"
msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vids**, **end vid** , [``directed``])"

msgid "pgr_bdDijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])"

msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [ ``directed``])"
msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [ ``directed``])"

msgid "pgr_bdDijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_bdDijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [``directed``])"

msgid "``pgr_bdDijkstraCostMatrix``"
msgstr "``pgr_bdDijkstraCostMatrix``"

msgid "``pgr_bdDijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_bdDijkstra`."
msgstr "``pgr_bdDijkstraCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_bdDijkstra`."

msgid "Using bidirectional Dijkstra algorithm, calculate and return a cost matrix."
msgstr "Beräkna och returnera en kostnadsmatris med hjälp av den dubbelriktade Dijkstra-algoritmen."

msgid "pgr_bdDijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])"
msgstr "pgr_bdDijkstraCostMatrix(`Kanter SQL`_, **start vids**, [``directed``])"

msgid "Symmetric cost matrix for vertices :math:`\\{5, 6, 10, 15\\}` on an **undirected** graph"
msgstr "Symmetrisk kostnadsmatris för toppar :math:`{\\5, 6, 10, 15\\}` på en **omdirigerad** graf"

msgid "Use with :doc:`pgr_TSP`."
msgstr "Använd med :doc:`pgr_TSP`."

msgid "``pgr_bellmanFord`` - Experimental"
msgstr "``pgr_bellmanFord`` - Experimentell"

msgid "``pgr_bellmanFord`` — Shortest path using Bellman-Ford algorithm."
msgstr "``pgr_bellmanFord`` - Kortaste vägen med Bellman-Ford algoritm."

msgid "pgr_bellmanFord(Combinations)"
msgstr "pgr_bellmanFord(Combinations)"

msgid "Bellman-Ford's algorithm, is named after Richard Bellman and Lester Ford, who first published it in 1958 and 1956, respectively.It is a graph search algorithm that computes shortest paths from a starting vertex (``start_vid``) to an ending vertex (``end_vid``) in a graph where some of the edge weights may be negative. Though it is more versatile, it is slower than Dijkstra's algorithm.This implementation can be used with a directed graph and an undirected graph."
msgstr "Bellman-Fords algoritm är uppkallad efter Richard Bellman och Lester Ford, som först publicerade den 1958 respektive 1956. Det är en algoritm för grafsökning som beräknar kortaste vägar från en startpunkt (``start_vid``) till en slutpunkt (``end_vid``) i en graf där vissa av kantvikterna kan vara negativa. Även om den är mer mångsidig är den långsammare än Dijkstras algoritm. Den här implementeringen kan användas med en riktad graf och en oriktad graf."

msgid "Process is valid for edges with both positive and negative edge weights."
msgstr "Processen är giltig för kanter med både positiva och negativa kantvikter."

msgid "When the start vertex and the end vertex are the same, there is no path. The agg_cost would be :math:`0`."
msgstr "När startvertex och slutvertex är desamma finns det ingen väg. Agg_cost skulle vara :math:`0`."

msgid "When the start vertex and the end vertex are different, and there exists a path between them without having a *negative cycle*. The agg_cost would be some finite value denoting the shortest distance between them."
msgstr "När startvertex och slutvertex är olika, och det finns en väg mellan dem utan att ha en *negativ cykel*. Agg_cost skulle vara ett ändligt värde som anger det kortaste avståndet mellan dem."

msgid "When the start vertex and the end vertex are different, and there exists a path between them, but it contains a *negative cycle*. In such case, agg_cost for those vertices keep on decreasing furthermore, Hence agg_cost can’t be defined for them."
msgstr "När startpunkten och slutpunkten är olika, och det finns en väg mellan dem, men den innehåller en *negativ cykel*. I sådana fall fortsätter agg_cost för dessa toppar att minska och därför kan agg_cost inte definieras för dem."

msgid "When the start vertex and the end vertex are different, and there is no path. The agg_cost is :math:`\\infty`."
msgstr "När startvertex och slutvertex är olika och det inte finns någon väg. Agg_cost är :math:`\\infty`."

msgid "For optimization purposes, any duplicated value in the `start_vids` or `end_vids` are ignored."
msgstr "För optimeringsändamål ignoreras alla duplicerade värden i `start_vids` eller `end_vids`."

msgid "Running time: :math:`O(| start\\_vids | * ( V * E))`"
msgstr "Speltid: :math:`O(| start\\_vids | * ( V * E))`"

msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])"

msgid "pgr_bellmanFord(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])"

msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])"

msgid "pgr_bellmanFord(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_bellmanFord(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])"

msgid "pgr_bellmanFord(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_bellmanFord(`Kanter SQL`_, `Combinations SQL`_, [``directed``])"

msgid "From vertex :math:`6` to vertices :math:`\\{10, 17\\}` on a directed graph"
msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 17\\}` i en riktad graf"

msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`17` on a directed graph"
msgstr "Från topparna :math:`\\{6, 1\\}` till topparna :math:`17` i en riktad graf"

msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 17\\}` on an undirected graph"
msgstr "Från hörn :math:`\\{6, 1\\}` till hörn :math:`\\{10, 17\\}` på en odelad graf"

msgid "Using a combinations table on an undirected graph"
msgstr "Använda en kombinationstabell på en ostyrd graf"

msgid "`Boost: Bellman Ford <https://www.boost.org/libs/graph/doc/bellman_ford_shortest.html>`__"
msgstr "`Boost: Bellman Ford <https://www.boost.org/libs/graph/doc/bellman_ford_shortest.html>`__"

msgid "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm"
msgstr "https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm"

msgid "``pgr_betweennessCentrality`` - Experimental"
msgstr "``pgr_betweennessCentrality`` - Experimentell"

msgid "``pgr_betweennessCentrality`` - Calculates the relative betweenness centrality using Brandes Algorithm"
msgstr "``pgr_betweennessCentrality`` - Beräknar den relativa betweenness-centraliteten med hjälp av Brandes-algoritmen"

msgid "Version 3.7.0"
msgstr "Version 3.7.0"

msgid "The Brandes Algorithm takes advantage of the sparse graphs for evaluating the betweenness centrality score of all vertices."
msgstr "Brandes-algoritmen utnyttjar de glesa graferna för att utvärdera betweenness centrality-punkten för alla hörn."

msgid "Betweenness centrality measures the extent to which a vertex lies on the shortest paths between all other pairs of vertices. Vertices with a high betweenness centrality score may have considerable influence in a network by the virtue of their control over the shortest paths passing between them."
msgstr "Betweenness centrality mäter i vilken utsträckning en toppunkt ligger på de kortaste vägarna mellan alla andra par av toppunkter. Toppar med en hög betweenness centrality-punkt kan ha ett betydande inflytande i ett nätverk genom att de kontrollerar de kortaste vägarna mellan dem."

msgid "The removal of these vertices will affect the network by disrupting the it, as most of the shortest paths between vertices pass through them."
msgstr "Om dessa toppar tas bort påverkas nätverket genom att det störs, eftersom de flesta av de kortaste vägarna mellan topparna passerar genom dem."

msgid "This implementation work for both directed and undirected graphs."
msgstr "Denna implementering fungerar för både riktade och oriktade grafer."

msgid "Running time:  :math:`\\Theta(VE)`"
msgstr "Speltid: :math:`\\Theta(VE)`"

msgid "Running space: :math:`\\Theta(VE)`"
msgstr "Driftutrymme: :math:`\\Theta(VE)``"

msgid "Throws when there are no edges in the graph"
msgstr "Kastar när det inte finns några kanter i grafen"

msgid "pgr_betweennessCentrality(`Edges SQL`_, [``directed``])"
msgstr "pgr_betweennessCentrality(`Kanter SQL`_, [``directed``])"

msgid "Returns set of ``(vid, centrality)``"
msgstr "Returnerar uppsättning av ``(vid, centralitet)``"

msgid "For a directed graph with edges :math:`\\{1, 2, 3, 4\\}`."
msgstr "För en riktad graf med kanter :math:`\\{1, 2, 3, 4\\}`."

msgid "Explanation"
msgstr "Förklaring"

msgid "The betweenness centrality are between parenthesis."
msgstr "Betweenness Centrality anges inom parentes."

msgid "The leaf vertices have betweenness centrality :math:`0`."
msgstr "Bladkärnorna har betweenness centrality :math:`0`."

msgid "Betweenness centrality of vertex :math:`6` is higher than of vertex :math:`10`."
msgstr "Betweenness centrality för toppunkten :math:`6` är högre än för toppunkten :math:`10`."

msgid "Removing vertex :math:`6` will create three graph components."
msgstr "Om du tar bort toppunkten :math:`6` skapas tre grafkomponenter."

msgid "Removing vertex :math:`10` will create two graph components."
msgstr "Om du tar bort toppunkten :math:`10` skapas två grafkomponenter."

msgid "``vid``"
msgstr "``vid``"

msgid "``centrality``"
msgstr "``centrality``"

msgid "Relative betweenness centrality score of the vertex (will be in range [0,1])"
msgstr "Relativ betweenness centrality-punkt för vertexet (kommer att ligga inom intervallet [0,1])"

msgid "`Boost: betweenness centrality <https://www.boost.org/libs/graph/doc/betweenness_centrality.html>`_"
msgstr "`Boost: betweenness centrality <https://www.boost.org/libs/graph/doc/betweenness_centrality.html>`_"

msgid "``pgr_biconnectedComponents``"
msgstr "``pgr_biconnectedComponents``"

msgid "``pgr_biconnectedComponents`` — Biconnected components of an undirected graph."
msgstr "``pgr_biconnectedComponents`` - Biconnected-komponenter i en odränerad graf."

msgid "Result columns change:"
msgstr "Resultatkolumnerna ändras:"

msgid "``n_seq`` is removed"
msgstr "``n_seq`` tas bort"

msgid "``seq`` changed type to ``BIGINT``"
msgstr "``seq`` har ändrat typ till ``BIGINT``"

msgid "The biconnected components of an undirected graph are the maximal subsets of vertices such that the removal of a vertex from particular component will not disconnect the component. Unlike connected components, vertices may belong to multiple biconnected components. Vertices can be present in multiple biconnected components, but each edge can only be contained in a single biconnected component."
msgstr "De biconnected komponenterna i en odelad graf är de maximala delmängderna av hörnpunkter så att borttagandet av en hörnpunkt från en viss komponent inte kommer att koppla bort komponenten. Till skillnad från anslutna komponenter kan toppar tillhöra flera biconnected components. Toppar kan förekomma i flera biconnected components, men varje kant kan bara ingå i en enda biconnected component."

msgid "Components are described by edges."
msgstr "Komponenterna beskrivs med kanter."

msgid "``component`` ascending."
msgstr "``komponent`` stigande."

msgid "``edge`` ascending."
msgstr "``edge`` stigande."

msgid "pgr_biconnectedComponents(`Edges SQL`_)"
msgstr "pgr_biconnectedComponents(`Kanter SQL`_)"

msgid "Returns set of |result-component-E|"
msgstr "Returnerar uppsättning av |result-component-E|"

msgid "The biconnected components of the graph"
msgstr "De biconnected komponenterna i grafen"

msgid "``component``"
msgstr "``component``"

msgid "Component identifier."
msgstr "Komponentens identifierare."

msgid "Has the value of the minimum edge identifier in the component."
msgstr "Har värdet för den minsta kantidentifieraren i komponenten."

msgid "Identifier of the edge that belongs to the ``component``."
msgstr "Identifierare av den kant som tillhör ``komponenten``."

msgid "``pgr_binaryBreadthFirstSearch`` - Experimental"
msgstr "``pgr_binaryBreadthFirstSearch`` - Experimentell"

msgid "``pgr_binaryBreadthFirstSearch`` — Returns the shortest path in a binary graph."
msgstr "``pgr_binaryBreadthFirstSearch`` - Returnerar den kortaste vägen i en binär graf."

msgid "Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative integer, is termed as a 'binary graph'."
msgstr "En graf vars kantvikter tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt heltal, kallas för en \"binär graf\"."

msgid "pgr_binaryBreadthFirstSearch(Combinations)"
msgstr "pgr_binaryBreadthFirstSearch(Combinations)"

msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, then we a more general algorithm is needed, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time."
msgstr "Det är välkänt att de kortaste vägarna mellan en enda källa och alla andra toppar kan hittas med hjälp av Breadth First Search på :math:`O(|E|)` i en oviktad graf, dvs. avståndet är det minsta antalet kanter som du behöver korsa från källan till en annan topp. Vi kan också tolka en sådan graf som en viktad graf, där varje kant har vikten :math:`1`. Om inte alla kanter i grafen har samma vikt behövs en mer generell algoritm, som Dijkstras algoritm som går på :math:`O(|E|log|V|)` tid."

msgid "However if the weights are more constrained, we can use a faster algorithm. This algorithm, termed as 'Binary Breadth First Search' as well as '0-1 BFS', is a variation of the standard Breadth First Search problem to solve the SSSP (single-source shortest path) problem in :math:`O(|E|)`, if the weights of each edge belongs to the set {0,X}, where 'X' is any non-negative real integer."
msgstr "Men om vikterna är mer begränsade kan vi använda en snabbare algoritm. Den här algoritmen, som kallas \"Binary Breadth First Search\" eller \"0-1 BFS\", är en variant av standardproblemet Breadth First Search för att lösa SSSP-problemet (kortaste vägen med en källa) på :math:`O(|E|)`, om vikterna för varje kant tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt heltal."

msgid "Process is done only on 'binary graphs'. ('Binary Graph': Any graph whose edge-weights belongs to the set {0,X}, where 'X' is any non-negative real integer.)"
msgstr "Processen görs endast på \"binära grafer\". ('Binär graf': En graf vars kantvikter tillhör uppsättningen {0,X}, där \"X\" är ett icke-negativt reellt heltal)"

msgid "Running time: :math:`O(| start\\_vids | * |E|)`"
msgstr "Speltid: :math:`O(| start\\_vids | * |E|)``"

msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **slut vid**, [``directed``])"

msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vid**, **slut vids**, [``directed``])"

msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **slut vid**, [``directed``])"

msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, **start vids**, **slut vids**, [``directed``])"

msgid "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_binaryBreadthFirstSearch(`Edges SQL`_, `Combinations SQL`_, [``directed``])"

msgid "**Note:** Using the :doc:`sampledata` Network as all weights are same (i.e :math:`1``)"
msgstr "**Anmärkning:** Använda :doc:`sampledata` Network eftersom alla vikter är desamma (dvs :math:`1``)"

msgid "`Boost: Breadth First Search <https://www.boost.org/libs/graph/doc/breadth_first_search.html>`__"
msgstr "`Boost: Bredd först Sök <https://www.boost.org/libs/graph/doc/breadth_first_search.html>`__"

msgid "https://cp-algorithms.com/graph/01_bfs.html"
msgstr "https://cp-algorithms.com/graph/01_bfs.html"

msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants"
msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Specialized_variants"

msgid "``pgr_bipartite`` - Experimental"
msgstr "``pgr_bipartite`` - Experimentell"

msgid "``pgr_bipartite`` — Disjoint sets of vertices such that no two vertices within the same set are adjacent."
msgstr "``pgr_bipartite`` - Disjunkta uppsättningar av hörnpunkter så att inga två hörnpunkter inom samma uppsättning är angränsande."

msgid "A bipartite graph is a graph with two sets of vertices which are connected to each other, but not within themselves. A bipartite graph is possible if the graph coloring is possible using two colors such that vertices in a set are colored with the same color."
msgstr "En bipartitisk graf är en graf med två uppsättningar av hörn som är kopplade till varandra, men inte inom sig själva. En bipartitisk graf är möjlig om grafen kan färgläggas med två färger så att topparna i en uppsättning färgas med samma färg."

msgid "The algorithm works in undirected graph only."
msgstr "Algoritmen fungerar endast i ostyrda grafer."

msgid "The returned values are not ordered."
msgstr "De returnerade värdena är inte ordnade."

msgid "The algorithm checks graph is bipartite or not. If it is bipartite then it returns the node along with two colors `0` and `1` which represents two different sets."
msgstr "Algoritmen kontrollerar om grafen är tvådelad eller inte. Om den är bipartite returnerar den noden tillsammans med två färger `0` och `1` som representerar två olika uppsättningar."

msgid "If graph is not bipartite then algorithm returns empty set."
msgstr "Om grafen inte är bipartitisk returnerar algoritmen en tom uppsättning."

msgid "pgr_bipartite(`Edges SQL`_)"
msgstr "pgr_bipartite(`Kanter SQL`_)"

msgid "When the graph is bipartite"
msgstr "När grafen är tvådelad"

msgid "Additional Example"
msgstr "Ytterligare exempel"

msgid "The odd length cyclic graph can not be bipartite."
msgstr "Den cykliska grafen med udda längd kan inte vara bipartit."

msgid "The edge :math:`5 \\rightarrow 1` will make subgraph with vertices :math:`\\{1, 3, 7, 6, 5\\}` an odd length cyclic graph, as the cycle has 5 vertices."
msgstr "Kanten :math:`5 \\rightarrow 1` kommer att göra undergrafen med hörn :math:`\\{1, 3, 7, 6, 5\\}` till en cyklisk graf med udda längd, eftersom cykeln har 5 hörn."

msgid "Edges in blue represent odd length cycle subgraph."
msgstr "Kanter i blått representerar cykelundergraf med udda längd."

msgid "`Boost: is_bipartite <https://www.boost.org/libs/graph/doc/is_bipartite.html>`__"
msgstr "`Boost: is_bipartite <https://www.boost.org/libs/graph/doc/is_bipartite.html>`__"

msgid "`Wikipedia: bipartite graph <https://en.wikipedia.org/wiki/Bipartite_graph>`__"
msgstr "`Wikipedia: bipartitgraf <https://en.wikipedia.org/wiki/Bipartite_graph>`__"

msgid "``pgr_boykovKolmogorov``"
msgstr "``pgr_boykovKolmogorov``"

msgid "``pgr_boykovKolmogorov`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Boykov Kolmogorov algorithm."
msgstr "``pgr_boykovKolmogorov`` - Beräknar flödet på grafens kanter som maximerar flödet från källorna till målen med hjälp av Boykov Kolmogorov-algoritmen."

msgid "pgr_boykovKolmogorov(Combinations)"
msgstr "pgr_boykovKolmogorov(Combinations)"

msgid "Renamed from ``pgr_maxFlowBoykovKolmogorov``"
msgstr "Borttagen från ``pgr_maxFlowBoykovKolmogorov``"

msgid "Function promoted to proposed."
msgstr "Funktion befordrad till föreslagen."

msgid "Running time: Polynomial"
msgstr "Drifttid: Polynom"

msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vid**)"
msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, **start vid**, **end vid**)"

msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vid**, **end vids**)"
msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, **start vid**, **end vids**)"

msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vid**)"
msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, **start vids**, **end vid**)"

msgid "pgr_boykovKolmogorov(`Edges SQL`_, **start vids**, **end vids**)"
msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, **start vids**, **end vids**)"

msgid "pgr_boykovKolmogorov(`Edges SQL`_, `Combinations SQL`_)"
msgstr "pgr_boykovKolmogorov(`Kanter SQL`_, `Combinations SQL`_)"

msgid "Returns set of |result-flow|"
msgstr "Returnerar uppsättning av |result-flow|"

msgid "From vertex :math:`11` to vertex :math:`12`"
msgstr "Från toppunkten :math:`11` till toppunkten :math:`12`"

msgid "From vertex :math:`11` to vertices :math:`\\{5, 10, 12\\}`"
msgstr "Från toppunkten :math:`11` till toppunkterna :math:`{\\5, 10, 12\\}`"

msgid "From vertices :math:`\\{11, 3, 17\\}` to vertex :math:`12`"
msgstr "Från topparna :math:`\\{11, 3, 17\\}` till topp :math:`12`"

msgid "From vertices :math:`\\{11, 3, 17\\}` to vertices :math:`\\{5, 10, 12\\}`"
msgstr "Från topparna :math:`{11, 3, 17\\}` till topparna :math:`{5, 10, 12\\}`"

msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}`."
msgstr "Att använda en kombinationstabell motsvarar att beräkna resultatet från topparna :math:`\\{5, 6\\}` till topparna :math:`\\{10, 15, 14\\}`."

msgid "`Boost: Boykov Kolmogorov max flow <https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html>`__"
msgstr "`Boost: Boykov Kolmogorov maxflöde <https://www.boost.org/libs/graph/doc/boykov_kolmogorov_max_flow.html>`__"

msgid "``pgr_breadthFirstSearch`` - Experimental"
msgstr "``pgr_breadthFirstSearch`` - Experimentell"

msgid "``pgr_breadthFirstSearch`` — Returns the traversal order(s) using Breadth First Search algorithm."
msgstr "``pgr_breadthFirstSearch`` - Returnerar traverseringsordning(ar) med algoritmen Breadth First Search."

msgid "Version 4.0.0:"
msgstr "Version 4.0.0:"

msgid "Provides the Breadth First Search traversal order from a root vertex to a particular depth."
msgstr "Ger genomgångsordningen Breadth First Search från en rotvertex till ett visst djup."

msgid "The implementation will work on any type of graph."
msgstr "Implementeringen kommer att fungera på alla typer av grafer."

msgid "Provides the Breadth First Search traversal order from a source node to a target depth level."
msgstr "Ger traverseringsordningen Breadth First Search från en källnod till en måldjupnivå."

msgid "Running time: :math:`O(E + V)`"
msgstr "Speltid: :math:`O(E + V)`"

msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vid**, [**options**])"
msgstr "pgr_breadthFirstSearch(`Kanter SQL`_, **root vid**, [**options**])"

msgid "pgr_breadthFirstSearch(`Edges SQL`_, **root vids**, [**options**])"
msgstr "pgr_breadthFirstSearch(`Kanter SQL`_, **root vids**, [**options**])"

msgid "**options:** ``[max_depth, directed]``"
msgstr "**options:** ``[max_depth, directed]``"

msgid "From root vertex :math:`6` on a **directed** graph with edges in ascending order of ``id``"
msgstr "Från rotpunkten :math:`6` på en **riktad** graf med kanter i stigande ordning efter ``id``"

msgid "From root vertices :math:`\\{12, 6\\}` on an **undirected** graph with **depth** :math:`<= 2` and edges in ascending order of ``id``"
msgstr "Från rotkärnor :math:`{12, 6\\}` på en **omdirigerad** graf med **djup** :math:`<= 2` och kanter i stigande ordning efter `id``"

msgid "DFS optional parameters"
msgstr "DFS valfria parametrar"

msgid "Same as `Single vertex`_ with edges in ascending order of ``id``."
msgstr "Samma som `Single vertex`_ med kanter i stigande ordning efter ``id``."

msgid "Same as `Single vertex`_ with edges in descending order of ``id``."
msgstr "Samma som `Single vertex`_ med kanter i fallande ordning efter ``id``."

msgid "The resulting traversal is different."
msgstr "Den resulterande traversalen är annorlunda."

msgid "The left image shows the result with ascending order of ids and the right image shows with descending order of the edge identifiers."
msgstr "Den vänstra bilden visar resultatet med stigande ordning av id:n och den högra bilden visar med fallande ordning av kantidentifierarna."

msgid "|ascending| |descending|"
msgstr "|ascending| |descending|"

msgid "ascending"
msgstr "stigande"

msgid "descending"
msgstr "fallande"

msgid "`Wikipedia: Breadth First Search algorithm <https://en.wikipedia.org/wiki/Breadth-first_search>`__"
msgstr "`Wikipedia: Algoritmen för bred första sökning <https://en.wikipedia.org/wiki/Breadth-first_search>`__"

msgid "``pgr_bridges``"
msgstr "``pgr_bridges``"

msgid "``pgr_bridges`` - Return the bridges of an undirected graph."
msgstr "``pgr_bridges`` - Returnerar broarna i en odränerad graf."

msgid "A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph."
msgstr "En bro är en kant i en odelad graf vars borttagning ökar dess antal anslutna komponenter. Denna implementation kan endast användas med en odelad graf."

msgid "``edge`` ascending"
msgstr "``edge`` stigande"

msgid "Running time: :math:`O(E * (V + E))`"
msgstr "Speltid: :math:`O(E * (V + E))`"

msgid "pgr_bridges(`Edges SQL`_)"
msgstr "pgr_bridges(`Kanter SQL`_)"

msgid "Returns set of |result-edge|"
msgstr "Returnerar uppsättning av |result-edge|"

msgid "The bridges of the graph"
msgstr "Bryggorna i grafen"

msgid "Identifier of the edge that is a bridge."
msgstr "Identifierar den kant som är en bro."

msgid "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29"
msgstr "https://en.wikipedia.org/wiki/Bridge_%28graph_theory%29"

msgid "`Boost: Connected components <https://www.boost.org/libs/graph/doc/connected_components.html>`__"
msgstr "`Boost: Anslutna komponenter <https://www.boost.org/libs/graph/doc/connected_components.html>`__"

msgid "``pgr_chinesePostman`` - Experimental"
msgstr "``pgr_chinesePostman`` - Experimentell"

msgid "``pgr_chinesePostman`` — Calculates the shortest circuit path which contains every edge in a directed graph and starts and ends on the same vertex."
msgstr "``pgr_chinesePostman`` - Beräknar den kortaste kretsvägen som innehåller varje kant i en riktad graf och som börjar och slutar på samma toppunkt."

msgid "Returns ``EMPTY SET`` on a disconnected graph"
msgstr "Returnerar ``EMPTY SET`` på en frånkopplad graf"

msgid "pgr_chinesePostman(`Edges SQL`_)"
msgstr "pgr_chinesePostman(`Kanter SQL`_)"

msgid "Returns set of |result-1-1-no-seq|"
msgstr "Returnerar uppsättning av |result-1-1-no-seq|"

msgid "Returns set of ``(seq, node, edge, cost, agg_cost)``"
msgstr "Returnerar uppsättning av ``(seq, nod, kant, kostnad, agg_cost)``"

msgid "Sequential value starting from ``1``"
msgstr "Sekventiellt värde med början från ``1``"

msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence. ``-1`` for the last node of the path."
msgstr "Identifierar den kant som används för att gå från ``node`` till nästa nod i bansekvensen. ``-1`` för den sista noden i sökvägen."

msgid "Aggregate cost from ``start_v`` to ``node``."
msgstr "Sammanlagd kostnad från ``start_v`` till ``node``."

msgid "``pgr_chinesePostmanCost`` - Experimental"
msgstr "``pgr_chinesePostmanCost`` - Experimentell"

msgid "``pgr_chinesePostmanCost`` — Calculates the minimum costs of a circuit path which contains every edge in a directed graph and starts and ends on the same vertex."
msgstr "``pgr_chinesePostmanCost`` - Beräknar minimikostnaderna för en kretsbana som innehåller varje kant i en riktad graf och som börjar och slutar på samma vertex."

msgid "Return value when the graph if disconnected"
msgstr "Returvärde när grafen är frånkopplad"

msgid "pgr_chinesePostmanCost(`Edges SQL`_)"
msgstr "pgr_chinesePostmanCost(`Kanter SQL`_)"

msgid "RETURNS ``FLOAT``"
msgstr "RETURNERAR ``FLÖDE``"

msgid "``pgr_chinesepostmancost``"
msgstr "``pgr_chinesepostmancost``"

msgid "Minimum costs of a circuit path."
msgstr "Minimikostnader för en kretsbana."

msgid "``pgr_connectedComponents``"
msgstr "``pgr_connectedComponents``"

msgid "``pgr_connectedComponents`` — Connected components of an undirected graph using a DFS-based approach."
msgstr "``pgr_connectedComponents`` - Anslutna komponenter i en odelad graf med hjälp av en DFS-baserad metod."

msgid "A connected component of an undirected graph is a set of vertices that are all reachable from each other."
msgstr "En kopplad komponent i en odelad graf är en uppsättning hörn som alla är nåbara från varandra."

msgid "Components are described by vertices"
msgstr "Komponenterna beskrivs av hörn"

msgid "``component`` ascending"
msgstr "``komponent`` stigande"

msgid "pgr_connectedComponents(`Edges SQL`_)"
msgstr "pgr_connectedComponents(`Kanter SQL`_)"

msgid "Returns set of |result-component-V|"
msgstr "Returnerar uppsättning av |result-component-V|"

msgid "The connected components of the graph"
msgstr "De anslutna komponenterna i grafen"

msgid "Has the value of the minimum node identifier in the component."
msgstr "Har värdet för den minsta nodidentifieraren i komponenten."

msgid "Identifier of the vertex that belongs to the ``component``."
msgstr "Identifierare av den toppunkt som tillhör ``komponenten``."

msgid "Connecting disconnected components"
msgstr "Anslutning av frånkopplade komponenter"

msgid "wikipedia: `Connected component <https://en.wikipedia.org/wiki/Connected_component_(graph_theory)>`__"
msgstr "wikipedia: `sammanhängande komponent <https://en.wikipedia.org/wiki/Connected_component_(graph_theory)>`__"

msgid "``pgr_contraction``"
msgstr "``pgr_contraction``"

msgid "``pgr_contraction`` — Performs graph contraction and returns the contracted vertices and edges."
msgstr "``pgr_contraction`` - Utför grafkontraktion och returnerar de kontraherade topparna och kanterna."

msgid "Version 3.8.0"
msgstr "Version 3.8.0"

msgid "New signature:"
msgstr "Ny signatur:"

msgid "Previously compulsory parameter **Contraction order** is now optional with name ``methods``."
msgstr "Den tidigare obligatoriska parametern **Contraction order** är nu valfri med namnet ``methods``."

msgid "New name and order of optional parameters."
msgstr "Nytt namn och ordning på valfria parametrar."

msgid "Deprecated signature pgr_contraction(text,bigint[],integer,bigint[],boolean)"
msgstr "Föråldrad signatur pgr_contraction(text,bigint[],integer,bigint[],boolean)"

msgid "Name change from ``pgr_contractGraph``"
msgstr "Namnändring från ``pgr_contractGraph``"

msgid "Bug fixes"
msgstr "Buggfixar"

msgid "Contraction reduces the size of the graph by removing some of the vertices and edges and, for example, might add edges that represent a sequence of original edges decreasing the total time and space used in graph algorithms."
msgstr "Kontraktion minskar storleken på grafen genom att ta bort några av topparna och kanterna och till exempel lägga till kanter som representerar en sekvens av ursprungliga kanter, vilket minskar den totala tid och det utrymme som används i grafalgoritmer."

msgid "Does not return the full contracted graph."
msgstr "Returnerar inte hela den kontraherade grafen."

msgid "Only changes on the graph are returned."
msgstr "Endast ändringar i diagrammet returneras."

msgid "The returned values include:"
msgstr "De returnerade värdena inkluderar:"

msgid "The new edges generated by linear contraction."
msgstr "De nya kanterna som genereras av linjär sammandragning."

msgid "The modified vertices generated by dead end contraction."
msgstr "De modifierade topparna som genereras av sammandragning av återvändsgränder."

msgid "The returned values are ordered as follows:"
msgstr "De returnerade värdena är ordnade enligt följande:"

msgid "column ``id`` ascending when its a modified vertex."
msgstr "kolumn ``id`` stigande när det är en modifierad vertex."

msgid "column ``id`` with negative numbers descending when its a new edge."
msgstr "kolumn ``id`` med negativa tal fallande när det är en ny kant."

msgid "Currently there are two types of contraction methods included in this function:"
msgstr "För närvarande finns det två typer av sammandragningsmetoder som ingår i denna funktion:"

msgid "Dead End Contraction. See :doc:`pgr_contractionDeadEnd`."
msgstr "Kontraktion för återvändsgränd. Se :doc:`pgr_contractionDeadEnd`."

msgid "Linear Contraction. See :doc:`pgr_contractionLinear`."
msgstr "Linjär sammandragning. Se :doc:`pgr_contractionLinear`."

msgid "pgr_contraction(`Edges SQL`_, [**options**])"
msgstr "pgr_contraction(`Kanter SQL`_, [**options**])"

msgid "**options:** ``[directed, methods, cycles, forbidden]``"
msgstr "**options:** ``[directed, methods, cycles, forbidden]``"

msgid "Returns set of |result-contract|"
msgstr "Returnerar uppsättning av |result-contract|"

msgid "Dead end and linear contraction in that order on an undirected graph."
msgstr "Dead end och linjär sammandragning i den ordningen på en odelad graf."

msgid "Contraction optional parameters"
msgstr "Sammandragning valfria parametrar"

msgid "``methods``"
msgstr "``methods``"

msgid "``INTEGER[]``"
msgstr "``INTEGER[]``"

msgid "``ARRAY[1,2]``"
msgstr "``ARRAY[1,2]``"

msgid "Ordered contraction operations."
msgstr "Beställde sammandragningsoperationer."

msgid "1 = Dead end contraction"
msgstr "1 = Kontraktion i återvändsgränd"

msgid "2 = Linear contraction"
msgstr "2 = Linjär sammandragning"

msgid "``cycles``"
msgstr "``cycles``"

msgid ":math:`1`"
msgstr ":math:`1`"

msgid "Number of times the contraction methods will be performed."
msgstr "Antal gånger som sammandragningsmetoderna ska utföras."

msgid "``forbidden``"
msgstr "``forbidden``"

msgid "``BIGINT[]``"
msgstr "``BIGINT[]``"

msgid "``ARRAY[]::BIGINT[]``"
msgstr "``ARRAY[]::BIGINT[]```"

msgid "Identifiers of vertices forbidden for contraction."
msgstr "Identifierare av hörn som är förbjudna för sammandragning."

msgid "The function returns a single row. The columns of the row are:"
msgstr "Funktionen returnerar en enda rad. Kolumnerna i raden är:"

msgid "``type``"
msgstr "``type``"

msgid "Type of the row."
msgstr "Typ av rad."

msgid "``v`` when the row is a vertex."
msgstr "``v`` när raden är en vertex."

msgid "Column ``id`` has a positive value."
msgstr "Kolumnen ``id`` har ett positivt värde."

msgid "``e`` when the row is an edge."
msgstr "``e`` när raden är en kant."

msgid "Column ``id`` has a negative value."
msgstr "Kolumnen ``id`` har ett negativt värde."

msgid "All numbers on this column are ``DISTINCT``"
msgstr "Alla siffror i denna kolumn är ``DISTINCT``"

msgid "When ``type`` = **'v'**."
msgstr "När ``typ`` = **'v'**."

msgid "Identifier of the modified vertex."
msgstr "Identifierare för det modifierade toppunktet."

msgid "When ``type`` = **'e'**."
msgstr "När ``typ`` = **'e'**."

msgid "Decreasing sequence starting from **-1**."
msgstr "Minskande sekvens med början från **-1**."

msgid "Representing a pseudo `id` as is not incorporated in the set of original edges."
msgstr "Representerar ett pseudo-id som inte ingår i uppsättningen av ursprungliga kanter."

msgid "``contracted_vertices``"
msgstr "``contracted_vertices``"

msgid "Array of contracted vertex identifiers."
msgstr "Array med identifierare för kontrakterade vertex."

msgid "When ``type`` = **'v'**: :math:`-1`"
msgstr "När ``typ`` = **'v'**: :math:`-1`"

msgid "When ``type`` = **'e'**: Identifier of the source vertex of the current edge (``source``, ``target``)."
msgstr "När ``typ`` = **'e'**: Identifierare av källvertexen för den aktuella kanten (``källa``, ``mål``)."

msgid "When ``type`` = **'e'**: Identifier of the target vertex of the current edge (``source``, ``target``)."
msgstr "När ``typ`` = **'e'**: Identifierare av målvertexen för den aktuella kanten (``källa``, ``mål``)."

msgid "When ``type`` = **'e'**: Weight of the current edge (``source``, ``target``)."
msgstr "När ``typ`` = **'e'**: Vikt för den aktuella kanten (``källa``, ``mål``)."

msgid "Only dead end contraction"
msgstr "Endast återvändsgränd kontraktion"

msgid "Only linear contraction"
msgstr "Endast linjär sammandragning"

msgid "The cycle"
msgstr "Cykeln"

msgid "Contracting a graph can be done with more than one operation. The order of the operations affect the resulting contracted graph, after applying one operation, the set of vertices that can be contracted by another operation changes."
msgstr "Kontrahering av en graf kan göras med mer än en operation. Ordningen på operationerna påverkar den resulterande kontraherade grafen, efter att ha tillämpat en operation ändras uppsättningen toppar som kan kontraheras med en annan operation."

msgid "This implementation cycles ``cycles`` times through the ``methods`` ."
msgstr "Denna implementation cyklar ``cyklar`` gånger genom ``metoderna`` ."

msgid "Contracting sample data"
msgstr "Upphandling av provdata"

msgid "In this section, building and using a contracted graph will be shown by example."
msgstr "I det här avsnittet visas exempel på hur man bygger upp och använder en kontraherad graf."

msgid "The :doc:`sampledata` for an undirected graph is used"
msgstr ":doc:`sampledata` för en enkelriktad graf används"

msgid "a dead end operation first followed by a linear operation."
msgstr "först en operation i en återvändsgränd och därefter en linjär operation."

msgid "Construction of the graph in the database"
msgstr "Konstruktion av grafen i databasen"

msgid "The original graph:"
msgstr "Den ursprungliga grafen:"

msgid "The results do not represent the contracted graph. They represent the changes that need to be done to the graph after applying the contraction methods."
msgstr "Resultaten representerar inte den sammandragna grafen. De representerar de ändringar som måste göras i grafen efter att man har tillämpat sammandragningsmetoderna."

msgid "Observe that vertices, for example, :math:`6` do not appear in the results because it was not affected by the contraction algorithm."
msgstr "Observera att toppar, till exempel :math:`6`, inte visas i resultaten eftersom de inte påverkades av sammandragningsalgoritmen."

msgid "After doing the dead end contraction operation:"
msgstr "Efter att ha gjort den återvändsgränd sammandragning operation:"

msgid "After doing the linear contraction operation to the graph above:"
msgstr "Efter att ha gjort den linjära sammandragningsoperationen på grafen ovan:"

msgid "The process to create the contraction graph on the database:"
msgstr "Processen för att skapa sammandragningsgrafen i databasen:"

msgid "Add additional columns"
msgstr "Lägg till ytterligare kolumner"

msgid "Adding extra columns to the edges and vertices tables. In this documentation the following will be used:"
msgstr "Lägga till extra kolumner i tabellerna edges och vertices. I denna dokumentation kommer följande att användas:"

msgid "Column."
msgstr "Kolumn."

msgid "The vertices set belonging to the vertex/edge"
msgstr "Uppsättningen av toppar som hör till toppen/kanten"

msgid "``is_contracted``"
msgstr "``is_contracted``"

msgid "On the vertex table"
msgstr "På toppunktstabellen"

msgid "when ``true`` the vertex is contracted, its not part of the contracted graph."
msgstr "när ``true`` vertexen är kontraherad, är den inte en del av den kontraherade grafen."

msgid "when ``false`` the vertex is not contracted, its part of the contracted graph."
msgstr "när ``false`` är vertexen inte kontraherad, den är en del av den kontraherade grafen."

msgid "``is_new``"
msgstr "``is_new``"

msgid "On the edge table"
msgstr "På kanten av bordet"

msgid "when ``true`` the edge was generated by the contraction algorithm. its part of the contracted graph."
msgstr "när ``true`` kanten genererades av sammandragningsalgoritmen. dess del av den sammandragna grafen."

msgid "when ``false`` the edge is an original edge, might be or not part of the contracted graph."
msgstr "när ``false`` är kanten en originalkant, som kan vara eller inte vara en del av den kontraherade grafen."

msgid "Store contraction information"
msgstr "Lagra information om sammandragning"

msgid "Store the contraction results in a table."
msgstr "Spara sammandragningsresultaten i en tabell."

msgid "Update the edges and vertices tables"
msgstr "Uppdatera tabellerna för kanter och toppar"

msgid "Use ``is_contracted`` column to indicate the vertices that are contracted."
msgstr "Använd kolumnen ``is_contracted`` för att ange de toppar som är kontraherade."

msgid "Fill ``contracted_vertices`` with the information from the results that belong to the vertices."
msgstr "Fyll i ``contracted_vertices`` med informationen från de resultat som hör till topparna."

msgid "Insert the new edges generated by pgr_contraction."
msgstr "Infoga de nya kanterna som genererats av pgr_contraction."

msgid "The contracted graph"
msgstr "Den kontraherade grafen"

msgid "Vertices that belong to the contracted graph."
msgstr "Punkter som hör till den kontraherade grafen."

msgid "Edges that belong to the contracted graph."
msgstr "Kanter som hör till den kontraherade grafen."

msgid "Visually:"
msgstr "Visuellt:"

msgid "Using the contracted graph"
msgstr "Använda den kontraherade grafen"

msgid "Depending on the final application the graph is to be prepared. In this example the final application will be to calculate the cost from two vertices in the original graph by using the contracted graph with ``pgr_dijkstraCost``"
msgstr "Beroende på den slutliga tillämpningen ska grafen förberedas. I detta exempel kommer den slutliga tillämpningen att vara att beräkna kostnaden från två toppar i originalgrafen genom att använda den kontraherade grafen med ``pgr_dijkstraCost``"

msgid "There are three cases when calculating the shortest path between a given source and target in a contracted graph:"
msgstr "Det finns tre fall när man beräknar den kortaste vägen mellan en given källa och ett givet mål i en kontrakterad graf:"

msgid "Case 1: Both source and target belong to the contracted graph."
msgstr "Fall 1: Både källan och målet hör till den kontrakterade grafen."

msgid "Case 2: Source and/or target belong to an edge subgraph."
msgstr "Fall 2: Källa och/eller mål tillhör en edge-subgraf."

msgid "Case 3: Source and/or target belong to a vertex."
msgstr "Fall 3: Källa och/eller mål hör till en vertex."

msgid "The final application should consider all of those cases."
msgstr "Den slutliga applikationen bör ta hänsyn till alla dessa fall."

msgid "Create a view (or table) of the contracted graph:"
msgstr "Skapa en vy (eller tabell) av den kontraherade grafen:"

msgid "Create the function that will use the contracted graph."
msgstr "Skapa den funktion som ska använda den kontraherade grafen."

msgid "Case 2: Source and/or target belong to an edge that has contracted vertices."
msgstr "Fall 2: Källa och/eller mål hör till en kant som har kontraherade toppar."

msgid "Case 3: Source and/or target belong to a vertex that has been contracted."
msgstr "Fall 3: Källa och/eller mål hör till en vertex som har kontrakterats."

msgid "``pgr_contractionDeadEnd`` - Proposed"
msgstr "``pgr_contractionDeadEnd`` - Förslag"

msgid "``pgr_contractionDeadEnd`` — Performs graph contraction and returns the contracted vertices and edges."
msgstr "``pgr_contractionDeadEnd`` - Utför grafkontraktion och returnerar de kontraherade topparna och kanterna."

msgid "A node is considered a dead end node when:"
msgstr "En nod anses vara en återvändsgrändsnod när:"

msgid "On undirected graphs:"
msgstr "Om odelade grafer:"

msgid "The number of adjacent vertices is 1."
msgstr "Antalet angränsande hörn är 1."

msgid "On directed graphs:"
msgstr "Om riktade grafer:"

msgid "When there is only one adjacent vertex or"
msgstr "När det bara finns en angränsande toppunkt eller"

msgid "When all edges are incoming regardless of the number of adjacent vertices."
msgstr "När alla kanter är inkommande oavsett antalet angränsande toppar."

msgid "pgr_contractionDeadEnd(`Edges SQL`_, [**options**])"
msgstr "pgr_contractionDeadEnd(`Kanter SQL`_, [**options**])"

msgid "**options:** ``[directed, forbidden]``"
msgstr "**options:** ``[directed, forbidden]``"

msgid "Dead end contraction on an undirected graph."
msgstr "Sammandragning av återvändsgränder i en odelad graf."

msgid "The green nodes are dead end nodes."
msgstr "De gröna noderna är återvändsgrändsnoder."

msgid "Node :math:`3` is a dead end node after node :math:`1` is contracted."
msgstr "Noden :math:`3` är en återvändsgränd efter att noden :math:`1` har dragits in."

msgid "``ARRAY[`` |ANY-INTEGER| ``]``"
msgstr "``ARRAY[`` |ANY-INTEGER| ``]`` ``"

msgid "**Empty**"
msgstr "**Empty**"

msgid "Value = ``e`` indicating the row is an edge."
msgstr "Värde = ``e`` som anger att raden är en kant."

msgid "A pseudo `id` of the edge."
msgstr "Ett pseudo \"id\" för kanten."

msgid "Identifier of the source vertex of the current edge."
msgstr "Identifierar källvertexen för den aktuella kanten."

msgid "Identifier of the target vertex of the current edge."
msgstr "Identifierare av målvertexen för den aktuella kanten."

msgid "Weight of the current edge."
msgstr "Vikt för den aktuella kanten."

msgid "Dead end vertex on undirected graph"
msgstr "Dead end-knutpunkt på odelad graf"

msgid "They have only one adjacent node."
msgstr "De har bara en angränsande nod."

msgid "Dead end vertex on directed graph"
msgstr "Dead end-knutpunkt på riktad graf"

msgid "The green nodes are dead end nodes"
msgstr "De gröna noderna är återvändsgrändsnoder"

msgid "The blue nodes have an unlimited number of incoming and/or outgoing edges."
msgstr "De blå noderna har ett obegränsat antal inkommande och/eller utgående kanter."

msgid "Node"
msgstr "Nod"

msgid "Adjacent nodes"
msgstr "Angränsande noder"

msgid "Dead end"
msgstr "Död återvändsgränd"

msgid "Reason"
msgstr "Orsak"

msgid ":math:`6`"
msgstr ":math:`6`"

msgid ":math:`\\{1\\}`"
msgstr ":math:`\\{1\\}`"

msgid "Yes"
msgstr "Ja"

msgid "Has only one adjacent node."
msgstr "Har endast en angränsande nod."

msgid ":math:`7`"
msgstr ":math:`7`"

msgid ":math:`\\{2\\}`"
msgstr ":math:`\\{2\\}`"

msgid ":math:`8`"
msgstr ":math:`8`"

msgid ":math:`\\{2, 3\\}`"
msgstr ":math:`\\{2, 3\\}`"

msgid "Has more than one adjacent node and all edges are incoming."
msgstr "Har mer än en angränsande nod och alla kanter är inkommande."

msgid ":math:`\\{4\\}`"
msgstr ":math:`\\{4\\}`"

msgid ":math:`10`"
msgstr ":math:`10`"

msgid ":math:`\\{4, 5\\}`"
msgstr ":math:`\\{4, 5\\}`"

msgid "No"
msgstr "Nej"

msgid "Has more than one adjacent node and all edges are outgoing."
msgstr "Har mer än en angränsande nod och alla kanter är utgående."

msgid ":math:`1,2,3,4,5`"
msgstr ":math:`1,2,3,4,5`"

msgid "Many adjacent nodes."
msgstr "Många angränsande noder."

msgid "Has more than one adjacent node and some edges are incoming and some are outgoing."
msgstr "Har mer än en angränsande nod och vissa kanter är inkommande och vissa är utgående."

msgid "From above, nodes :math:`\\{6, 7, 9\\}` are dead ends because the total number of adjacent vertices is one."
msgstr "Ovan är noderna :math:`\\{6, 7, 9\\}` återvändsgränder eftersom det totala antalet angränsande hörn är ett."

msgid "When there are more than one adjacent vertex, all edges need to be all incoming edges otherwise it is not a dead end."
msgstr "När det finns mer än ett angränsande toppunkt måste alla kanter vara alla inkommande kanter, annars är det inte en återvändsgränd."

msgid "Step by step dead end contraction"
msgstr "Steg för steg återvändsgränd sammandragning"

msgid "The dead end contraction will stop until there are no more dead end nodes. For example, from the following graph where :math:`3` is the dead end node:"
msgstr "Sammandragningen av återvändsgränder kommer att upphöra tills det inte finns några fler återvändsgrändsnoder. Till exempel, från följande graf där :math:`3` är återvändsgränden:"

msgid "After contracting :math:`3`, node :math:`2` is now a dead end node and is contracted:"
msgstr "Efter kontrakteringen av :math:`3` är noden :math:`2` nu en återvändsgränd och kontrakteras:"

msgid "After contracting :math:`2`, stop. Node :math:`1` has the information of nodes that were contracted."
msgstr "Efter att ha dragit in :math:`2`, sluta. Noden :math:`1` har information om de noder som kontrakterades."

msgid "Creating the contracted graph"
msgstr "Skapa den kontraherade grafen"

msgid "Steps for the creation of the contracted graph"
msgstr "Steg för att skapa den avtalade grafen"

msgid "Add additional columns."
msgstr "Lägg till ytterligare kolumner."

msgid "Save results into a table."
msgstr "Spara resultaten i en tabell."

msgid "The contracted vertices are not part of the contracted graph."
msgstr "De kontraherade topparna är inte en del av den kontraherade grafen."

msgid "Using when departure and destination are in the contracted graph"
msgstr "Används när avgång och destination ligger i den kontrakterade grafen"

msgid "Using when departure/destination is not in the contracted graph"
msgstr "Används när avgång/destination inte finns i den avtalade grafen"

msgid "Using when departure and destination are not in the contracted graph"
msgstr "Används när avgång och destination inte finns i den avtalade grafen"

msgid "``pgr_contractionHierarchies`` - Experimental"
msgstr "``pgr_contractionHierarchies`` - Experimentell"

msgid "``pgr_contractionHierarchies`` — Performs graph contraction according to the contraction hierarchies method and returns the contracted vertices and shortcut edges created."
msgstr "``pgr_contractionHierarchies`` - Utför grafkontraktion enligt metoden contraction hierarchies och returnerar de kontraherade topparna och de skapade genvägskanterna."

msgid "The contraction hierarchies method builds, from an initial order of the vertices, a hierarchical order, giving priority to some vertices during the processing of label fixing of shortest paths algorithms. Furthermore, the contraction hierarchies algorithm adds shortcut edges in the graph, that helps the shortest paths algorithm to follow the created hierarchical graph structure."
msgstr "Contraction Hierarchies-metoden bygger, från en initial ordning av topparna, en hierarkisk ordning som prioriterar vissa toppar under bearbetningen av kortaste vägar-algoritmernas etikettfixering. Dessutom lägger algoritmen för sammandragningshierarkier till genvägskanter i grafen, vilket hjälper algoritmen för kortaste vägar att följa den skapade hierarkiska grafstrukturen."

msgid "The idea of the hierarchy is to put at a high priority level vertices that belong to the long distance network (highways for example in a road network) and to a low level of priority nodes that belong to the short distance network (arterials or secondary roads for example in road networks)."
msgstr "Tanken med hierarkin är att ge hög prioritet åt toppar som tillhör det långväga nätet (t.ex. motorvägar i ett vägnät) och låg prioritet åt noder som tillhör det kortväga nätet (t.ex. artärer eller sekundära vägar i ett vägnät)."

msgid "The contraction hierarchies algorithm makes the assumption that there is already a valuable vertices order that is used to initialize the contraction process. As in most cases there is no valuable initial node ordering, we use the order given by vertices ID. Then, the contraction process is made on the basis of this first order to give the final hierarchy."
msgstr "Algoritmen för sammandragningshierarkier förutsätter att det redan finns en värdefull nodordning som används för att initiera sammandragningsprocessen. Eftersom det i de flesta fall inte finns någon värdefull initial nodordning använder vi den ordning som ges av vertices ID. Sedan görs sammandragningsprocessen på grundval av denna första ordning för att ge den slutliga hierarkin."

msgid "The basic idea is to keep the vertices in a priority queue sorted by some estimate of how attractive is their contraction. The implemented case uses the metric called *edge difference*, which corresponds to the difference between the number of shortcuts produced by a vertex contraction and the number of incident edges in the graph before contraction (``#shortcuts - #incident edges``)."
msgstr "Grundidén är att hålla topparna i en prioritetskö sorterade efter någon uppskattning av hur attraktiv deras sammandragning är. I det implementerade fallet används ett mått som kallas *edge difference*, vilket motsvarar skillnaden mellan antalet genvägar som produceras av en vertexkontraktion och antalet infallande kanter i grafen före kontraktionen (``#shortcuts - #incident edges``)."

msgid "Finally, the aim is to reduce the explored part of the graph, when using a bidirectional Dijkstra-like algorithm. The vertices order is used to feed the oriented search. The search is made without losing optimality."
msgstr "Slutligen är målet att minska den utforskade delen av grafen när man använder en dubbelriktad Dijkstra-liknande algoritm. Topparnas ordning används för att mata den orienterade sökningen. Sökningen görs utan att förlora optimalitet."

msgid "Finding an optimal vertices ordering for contraction is a difficult problem. Nevertheless, very simple local heuristics work quite well, according to Geisberger et al. [2]. The principle here is to a priori estimate the value of the *edge difference* and to contract the node at the top of the queue only if the new value of the metric keeps it at the top of the queue. Otherwise, it is reinserted in the queue, at its right place corresponding to the new metric value."
msgstr "Det är ett svårt problem att hitta en optimal ordning på topparna för sammandragning. Ändå fungerar mycket enkla lokala heuristiker ganska bra, enligt Geisberger et al [2]. Principen här är att på förhand uppskatta värdet på *kantskillnaden* och att dra ihop noden högst upp i kön endast om det nya värdet på metriken håller den kvar högst upp i kön. I annat fall återinsätts den i kön på sin rätta plats som motsvarar det nya metriska värdet."

msgid "The process is done on graphs having only edges with positive costs."
msgstr "Processen görs på grafer som bara har kanter med positiva kostnader."

msgid "It is necessary to remember that there are no deleted vertices with this function. At the end, the graph keeps every vertex it had, but has some added edges, corresponding to shortcuts. The vertices which have been contracted, to build the shortcut edges, are kept and hierarchically ordered."
msgstr "Det är nödvändigt att komma ihåg att det inte finns några borttagna toppar med denna funktion. I slutet behåller grafen alla toppar den hade, men har några extra kanter som motsvarar genvägar. De toppar som har dragits ihop för att bygga upp genvägskanterna behålls och ordnas hierarkiskt."

msgid "As for the other contraction methods, it does not return the full contracted graph, only the changes. They are here of two types:"
msgstr "När det gäller de andra kontraktionsmetoderna returneras inte hela den kontraherade grafen, utan endast förändringarna. De är här av två typer:"

msgid "added shortcut edges, with negative identifiers;"
msgstr "lagt till genvägskanter, med negativa identifierare;"

msgid "contracted nodes with an order."
msgstr "kontrakterade noder med en order."

msgid "The ``pgr_contractionHierarchies`` function has the following signature:"
msgstr "Funktionen ``pgr_contractionHierarchies`` har följande signatur:"

msgid "pgr_contractionHierarchies(`Edges SQL`_, [**options**])"
msgstr "pgr_contractionHierarchies(`Kanter SQL`_, [**options**])"

msgid "Returns set of |result-contraction-hierarchies|"
msgstr "Returnerar uppsättning av |result-contraction-hierarchies|"

msgid "Contraction hierarchies optional parameters"
msgstr "Sammandragningshierarkier valfria parametrar"

msgid "True if the graph is directed, False otherwise."
msgstr "True om grafen är riktad, False annars."

msgid "The function returns many rows (one per vertex and one per shortcut edge created). The columns of the rows are:"
msgstr "Funktionen returnerar många rader (en per toppunkt och en per skapad genvägskant). Kolumnerna i raderna är:"

msgid "Type of the ``id``."
msgstr "Typ av ``id``."

msgid "Column ``id`` has a positive value"
msgstr "Kolumnen ``id`` har ett positivt värde"

msgid "Column ``id`` has a negative value"
msgstr "Kolumnen ``id`` har ett negativt värde"

msgid "``metric``"
msgstr "``metric``"

msgid "``vertex_order``"
msgstr "``vertex_order``"

msgid "On an undirected graph"
msgstr "På en odelad graf"

msgid "The following query shows the original data involved in the contraction operation on an undirected graph."
msgstr "Följande fråga visar de ursprungliga data som är involverade i sammandragningsoperationen på en oriktad graf."

msgid "building contraction hierarchies on the whole graph"
msgstr "bygga sammandragningshierarkier på hela grafen"

msgid "The results do not represent the contracted graph. They represent the changes done to the graph after applying the contraction algorithm and give the vertex order built by the algorithm, by ordering vertices according to the *edge difference* metric. As a consequence, vertices are all represented in the result (except of course forbidden ones). Only shortcut built by the algorithm are represented in the result."
msgstr "Resultaten representerar inte den sammandragna grafen. De representerar de ändringar som gjorts i grafen efter tillämpning av sammandragningsalgoritmen och ger den vertexordning som algoritmen bygger upp genom att ordna vertex enligt *edge difference*-metriken. Som en följd av detta finns alla toppar representerade i resultatet (utom naturligtvis förbjudna). Endast genvägar som byggts av algoritmen finns representerade i resultatet."

msgid "After computing the contraction hierarchies, an order is now given to the vertices,"
msgstr "Efter att ha beräknat sammandragningshierarkierna ges nu en ordning till topparna,"

msgid "in order to be used with a specific Dijkstra algorithm (implementation coming in a future version), which speeds up the search."
msgstr "för att kunna användas med en specifik Dijkstra-algoritm (implementering kommer i en framtida version), som snabbar upp sökningen."

msgid "We obtain the contracted graph above:"
msgstr "Vi får den kontraherade grafen ovan:"

msgid "We can see without surprise that the vertices belonging to the shortcuts have a tendency to have a high priority level in the resulting vertices order."
msgstr "Vi kan utan överraskning se att de toppar som tillhör genvägarna har en tendens att ha en hög prioritetsnivå i den resulterande topparnas ordning."

msgid "On an undirected graph with forbidden vertices"
msgstr "På en odelad graf med förbjudna toppar"

msgid "building contraction with a set of forbidden vertices"
msgstr "bygga sammandragning med en uppsättning förbjudna toppar"

msgid "Contraction process steps details"
msgstr "Detaljer för sammandragningsprocessens steg"

msgid "Shortcut building process"
msgstr "Genväg till byggprocessen"

msgid "A vertex ``v`` is contracted by adding shortcuts replacing former paths of the form ``(u, v, w)`` by an edge ``(u, w)``. The shortcut ``(u, w)`` is only needed when ``(u, v, w)`` is the only shortest path between ``u`` and ``w``."
msgstr "En topp ``v`` dras samman genom att lägga till genvägar som ersätter tidigare vägar av formen ``(u, v, w)`` med en kant ``(u, w)``. Genvägen ``(u, w)`` behövs bara när ``(u, v, w)`` är den enda kortaste vägen mellan ``u`` och ``w``."

msgid "When all shortcuts have been added for a given vertex ``v``, the incident edges of ``v`` are removed and another vertex is contracted with the remaining graph."
msgstr "När alla genvägar har lagts till för ett givet toppunkt ``v`` tas de infallande kanterna för ``v`` bort och ett nytt toppunkt dras samman med den återstående grafen."

msgid "The procedure is destructive for the graph and a copy is made to be able to manipulate it again as a whole. The contraction process adds all discovered shortcuts to the edge set ``E`` and attributes a metric to each contracted vertex. This metric is giving what is called the *contraction hierarchy*."
msgstr "Förfarandet är destruktivt för grafen och en kopia görs för att kunna manipulera den igen som en helhet. Kontraktionsprocessen lägger till alla upptäckta genvägar till kantuppsättningen ``E`` och tilldelar en metrik till varje kontraherad vertex. Denna metrik ger det som kallas *kontraktionshierarkin*."

msgid "Initialize the queue with a first vertices order"
msgstr "Initiera kön med en ordning för första toppar"

msgid "For each vertex ``v`` of the graph, a contraction of ``v`` is built:"
msgstr "För varje topp ``v`` i grafen byggs en sammandragning av ``v``:"

msgid ":math:`v`"
msgstr ":math:`v`"

msgid ":math:`\\{p, r, u\\}`"
msgstr ":math:`\\{p, r, u\\}`"

msgid ":math:`p`"
msgstr ":math:`p`"

msgid ":math:`\\{u, v\\}`"
msgstr ":math:`\\{u, v\\}`"

msgid ":math:`u`"
msgstr ":math:`u`"

msgid ":math:`\\{p, v, w\\}`"
msgstr ":math:`\\{p, v, w\\}`"

msgid ":math:`r`"
msgstr ":math:`r`"

msgid ":math:`\\{v, w\\}`"
msgstr ":math:`\\{v, w\\}`"

msgid ":math:`w`"
msgstr ":math:`w`"

msgid ":math:`\\{r, u\\}`"
msgstr ":math:`\\{r, u\\}`"

msgid "Adjacent edges are removed."
msgstr "Intilliggande kanter tas bort."

msgid "Shortcuts are built from predecessors of ``v`` to successors of ``v`` if and only if the path through ``v`` corresponds to the only shortest path between the predecessor and the successor of ``v`` in the graph. The *edge difference* metric here takes the value of -2."
msgstr "Genvägar byggs från föregångare till ``v`` till efterföljare till ``v`` om och endast om vägen genom ``v`` motsvarar den enda kortaste vägen mellan föregångaren och efterföljaren till ``v`` i grafen. Måttet *kantskillnad* antar här värdet -2."

msgid "Then the following vertex is contracted. The process goes on until each node of the graph has been contracted. At the end, there are no more edges in the graph, which has been destroyed by the process."
msgstr "Därefter kontraheras följande toppunkt. Processen fortsätter tills varje nod i grafen har dragits samman. I slutet finns det inte längre några kanter i grafen, som har förstörts av processen."

msgid "This first contraction will give a vertices order, given by ordering them in ascending order on the metric (edge difference). A total vertices order is built. If ``u < v``, then ``u`` is less important than ``v``. The algorithm keeps the vertices into a queue in this order."
msgstr "Denna första sammandragning ger en vertices-ordning, som ges genom att ordna dem i stigande ordning på metriken (kantskillnaden). En total vertices-ordning byggs upp. Om ``u < v``, så är ``u`` mindre viktig än ``v``. Algoritmen håller topparna i en kö i denna ordning."

msgid "A hierarchy will now be constructed by contracting again the vertices in this order."
msgstr "En hierarki kommer nu att konstrueras genom att åter kontrahera topparna i denna ordning."

msgid "Build the final vertex order"
msgstr "Bygg den slutliga toppunktsordningen"

msgid "Once the first order built, the algorithm uses it to browse the graph once again. For each vertex taken in the queue, the algorithm simulates contraction and calculates its edge difference. If the computed value is greater than the one of the next vertex to be contracted, then the algorithm puts it back in the queue (heuristic approach). Otherwise it contracts it permanently."
msgstr "När den första ordern har byggts använder algoritmen den för att bläddra igenom grafen igen. För varje toppunkt som tas upp i kön simulerar algoritmen sammandragning och beräknar dess kantskillnad. Om det beräknade värdet är större än värdet för nästa toppunkt som ska dras ihop, lägger algoritmen tillbaka den i kön (heuristisk metod). I annat fall dras den in permanent."

msgid "Add shortcuts to the initial graph"
msgstr "Lägga till genvägar till den initiala grafen"

msgid "At the end, the algorithm takes the initial graph (before edges deletions) and adds the shortcut edges to it. It gives you the contracted graph, ready to use with a specialized Dijkstra algorithm, which takes into account the order of the nodes in the hierarchy."
msgstr "I slutet tar algoritmen den ursprungliga grafen (före borttagning av kanter) och lägger till genvägskanterna till den. På så sätt får man en sammandragen graf, redo att användas med en specialiserad Dijkstra-algoritm, som tar hänsyn till nodernas ordning i hierarkin."

msgid "Use the contraction"
msgstr "Använd sammandragning"

msgid "Build the contraction"
msgstr "Bygg sammandragningen"

msgid "Add shortcuts and hierarchy in the existing tables"
msgstr "Lägg till genvägar och hierarki i befintliga tabeller"

msgid "Add new columns in the `vertices` and `edges` tables to store the results:"
msgstr "Lägg till nya kolumner i tabellerna `vertices` och `edges` för att lagra resultaten:"

msgid "Update and insert the results in the two tables."
msgstr "Uppdatera och infoga resultaten i de två tabellerna."

msgid "Use a Dijkstra shortest path algorithm on it"
msgstr "Använd en Dijkstra-algoritm för kortaste vägen på den"

msgid "Then you can use any Dijkstra-like algorithm, waiting for the adapted one which will take into account the built vertices hierarchy. For example:"
msgstr "Sedan kan du använda vilken Dijkstra-liknande algoritm som helst och vänta på den anpassade algoritmen som tar hänsyn till den uppbyggda toppunktshierarkin. Till exempel:"

msgid "``pgr_contractionLinear`` - Proposed"
msgstr "``pgr_contractionLinear`` - Föreslagen"

msgid "``pgr_contractionLinear`` — Performs graph contraction and returns the contracted vertices and edges."
msgstr "``pgr_contractionLinear`` - Utför grafkontraktion och returnerar de kontraherade topparna och kanterna."

msgid "pgr_contractionLinear(`Edges SQL`_, [**options**])"
msgstr "pgr_contractionLinear(`Kanter SQL`_, [**options**])"

msgid "Linear contraction on an undirected graph."
msgstr "Linjär sammandragning på en odelad graf."

msgid "The green nodes are linear nodes and will not be part of the contracted graph."
msgstr "De gröna noderna är linjära noder och kommer inte att vara en del av den kontrakterade grafen."

msgid "All edges adjacent will not be part of the contracted graph."
msgstr "Alla angränsande kanter kommer inte att vara en del av den kontraherade grafen."

msgid "The red lines will be new edges of the contracted graph."
msgstr "De röda linjerna kommer att vara nya kanter i den kontraherade grafen."

msgid "**contraction Order**"
msgstr "**contraction Order**"

msgid "Number of times the contraction operations on ``contraction_order`` will be performed."
msgstr "Antal gånger som sammandragningsoperationerna på ``contraction_order`` kommer att utföras."

msgid "A node connects two (or more) `linear` edges when"
msgstr "En nod förbinder två (eller fler) `linjära` kanter när"

msgid "The number of adjacent vertices is 2."
msgstr "Antalet angränsande hörn är 2."

msgid "In case of a directed graph, a node is considered a `linear` node when"
msgstr "I en riktad graf anses en nod vara en \"linjär\" nod när"

msgid "Linearity is symmetrical."
msgstr "Linjäriteten är symmetrisk."

msgid "Linearity is not symmetrical"
msgstr "Linjäriteten är inte symmetrisk"

msgid "Graph where linearity is not symmetrical."
msgstr "Graf där linjäriteten inte är symmetrisk."

msgid "When the graph is processed as a directed graph, linearity is not symmetrical, therefore the graph can not be contracted."
msgstr "När grafen bearbetas som en riktad graf är linjäriteten inte symmetrisk, och grafen kan därför inte dras ihop."

msgid "When the same graph is processed as an undirected graph, linearity is symmetrical, therefore the graph can be contracted."
msgstr "När samma graf behandlas som en odelad graf är linjäriteten symmetrisk och grafen kan därför krympas."

msgid "The three edges can be replaced by one undirected edge"
msgstr "De tre kanterna kan ersättas med en ostyrd kant"

msgid "Edge :math:`1 - 3`."
msgstr "Kant :math:`1 - 3`."

msgid "With cost: :math:`4`."
msgstr "Med kostnad: :math:`4`."

msgid "Contracted vertices in the edge: :math:`\\{2\\}`."
msgstr "Sammandragna hörn i kanten: :math:`\\{2\\}`."

msgid "Linearity is symmetrical"
msgstr "Linjäriteten är symmetrisk"

msgid "Graph where linearity is symmetrical."
msgstr "Graf där linjäriteten är symmetrisk."

msgid "The four edges can be replaced by two directed edges."
msgstr "De fyra kanterna kan ersättas av två riktade kanter."

msgid "Edge :math:`3 - 1`."
msgstr "Kant :math:`3 - 1`."

msgid "With cost: :math:`6`."
msgstr "Med kostnad: :math:`6`."

msgid "The four edges can be replaced by one undirected edge."
msgstr "De fyra kanterna kan ersättas med en ostyrd kant."

msgid "Step by step linear contraction"
msgstr "Steg för steg linjär sammandragning"

msgid "The linear contraction will stop when there are no more linear edges. For example from the following graph there are linear edges"
msgstr "Den linjära sammandragningen upphör när det inte längre finns några linjära kanter. Till exempel från följande graf finns det linjära kanter"

msgid "Contracting vertex :math:`3`,"
msgstr "Contracting vertex :math:`3`,"

msgid "The vertex :math:`3` is removed from the graph"
msgstr "Toppunkten :math:`3` tas bort från grafen"

msgid "The edges :math:`2 \\rightarrow 3` and :math:`w \\rightarrow z` are removed from the graph."
msgstr "Kanterna :math:`2 \\rightarrow 3` och :math:`w \\rightarrow z` tas bort från grafen."

msgid "A new edge :math:`2 \\rightarrow 4` is inserted represented with red color."
msgstr "En ny kant :math:`2 \\rightarrow 4` infogas representerad med röd färg."

msgid "Contracting vertex :math:`2`:"
msgstr "Kontraherande vertex :math:`2`:"

msgid "The vertex :math:`2` is removed from the graph"
msgstr "Toppunkten :math:`2` tas bort från grafen"

msgid "The edges :math:`1 \\rightarrow 2` and :math:`2 \\rightarrow 3` are removed from the graph."
msgstr "Kanterna :math:`1 \\rightarrow 2` och :math:`2 \\rightarrow 3` tas bort från grafen."

msgid "A new edge :math:`1 \\rightarrow 3` is inserted represented with red color."
msgstr "En ny kant :math:`1 \\rightarrow 3` infogas representerad med röd färg."

msgid "Edge :math:`1 \\rightarrow 3` has the information of cost and the nodes that were contracted."
msgstr "Edge :math:`1 \\rightarrow 3` har information om kostnad och de noder som kontrakterades."

msgid "Create the contracted graph."
msgstr "Skapa den kontraherade grafen."

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 <https://www.boost.org/libs/graph/doc/cuthill_mckee_ordering.html>`__"
msgstr "`Boost: Cuthill-McKee Beställning <https://www.boost.org/libs/graph/doc/cuthill_mckee_ordering.html>`__"

msgid "`Wikipedia: Cuthill-McKee Ordering <https://en.wikipedia.org/wiki/Cuthill%E2%80%93McKee_algorithm>`__"
msgstr "`Wikipedia: Cuthill-McKee-ordning <https://en.wikipedia.org/wiki/Cuthill%E2%80%93McKee_algorithm>`__"

msgid "``pgr_dagShortestPath`` - Experimental"
msgstr "``pgr_dagShortestPath`` - Experimentell"

msgid "``pgr_dagShortestPath`` — Returns the shortest path for weighted directed acyclic graphs(DAG). In particular, the DAG shortest paths algorithm implemented by Boost.Graph."
msgstr "``pgr_dagShortestPath`` - Returnerar den kortaste vägen för viktade riktade acykliska grafer (DAG). I synnerhet är DAG-algoritmen för kortaste vägar implementerad av Boost.Graph."

msgid "pgr_dagShortestPath(Combinations)"
msgstr "pgr_dagShortestPath(Combinations)"

msgid "Shortest Path for Directed Acyclic Graph(DAG) is a graph search algorithm that solves the shortest path problem for weighted directed acyclic graph, producing a shortest path from a starting vertex (``start_vid``) to an ending vertex (``end_vid``)."
msgstr "Shortest Path for Directed Acyclic Graph(DAG) är en grafsökningsalgoritm som löser problemet med kortaste vägen för viktad riktad acyklisk graf, vilket ger en kortaste väg från ett startvertex (``start_vid``) till ett slutvertex (``end_vid``)."

msgid "This implementation can only be used with a **directed** graph with no cycles i.e. directed acyclic graph."
msgstr "Denna implementation kan endast användas med en **riktad** graf utan cykler, 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."

msgid "Process is valid for weighted directed acyclic graphs only. otherwise it will throw warnings."
msgstr "Processen är endast giltig för viktade riktade acykliska grafer. annars kommer den att ge varningar."

msgid "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 "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 <https://www.boost.org/libs/graph/doc/dag_shortest_paths.html>`__"
msgstr "`Boost: DAG kortaste vägar <https://www.boost.org/libs/graph/doc/dag_shortest_paths.html>`__"

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`` - För varje toppunkt i en odelad graf, returnera antalet kanter som är kopplade till toppunktet."

msgid "Error messages adjustment."
msgstr "Justering av felmeddelanden."

msgid "New signature with only Edges SQL."
msgstr "Ny signatur med endast Edges SQL."

msgid "Calculates the degree of the vertices of an undirected graph"
msgstr "Beräknar graden för topparna i en odelad graf"

msgid "The degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex."
msgstr "Graden (eller valensen) för ett toppunkt i en graf är antalet kanter som är angränsande till toppunktet."

msgid "A loop contributes 2 to a vertex's degree."
msgstr "En loop bidrar med 2 till en topps grad."

msgid "A vertex with degree 0 is called an isolated vertex."
msgstr "Ett toppunkt med grad 0 kallas ett isolerat toppunkt."

msgid "Isolated vertex is not part of the result"
msgstr "Isolerad toppunkt är inte en del av resultatet"

msgid "Vertex not participating on the subgraph is considered and isolated vertex."
msgstr "Vertex som inte deltar i undergrafen betraktas som en isolerad vertex."

msgid "There can be a ``dryrun`` execution and the code used to get the answer will be shown in a PostgreSQL ``NOTICE``."
msgstr "Det kan finnas en ``dryrun`` exekvering och koden som används för att få svaret kommer att visas i en PostgreSQL ``NOTICE``."

msgid "The code can be used as base code for the particular application requirements."
msgstr "Koden kan användas som baskod för de specifika applikationskraven."

msgid "No ordering is performed."
msgstr "Ingen beställning utförs."

msgid "pgr_degree(`Edges SQL`_ , [``dryrun``])"
msgstr "pgr_degree(`Kanter SQL`_ , [``dryrun``])"

msgid "pgr_degree(`Edges SQL`_ , `Vertex SQL`_, [``dryrun``])"
msgstr "pgr_degree(`Kanter SQL`_ , `Vertex SQL`_, [``dryrun``])"

msgid "RETURNS SETOF |result-degree|"
msgstr "RETURNERAR SETOF |result-degree|"

msgid "Edges"
msgstr "Kanter"

msgid "example"
msgstr "exempel"

msgid "Get the degree of the vertices defined on the edges table"
msgstr "Hämta graden för de toppar som definieras i tabellen edges"

msgid "Edges and Vertices"
msgstr "Kanter och toppar"

msgid "Extracting the vertex information"
msgstr "Extrahera information om toppunkt"

msgid "``pgr_degree`` can use :doc:`pgr_extractVertices` embedded in the call."
msgstr "``pgr_degree`` kan använda :doc:`pgr_extractVertices` inbäddad i anropet."

msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls. (See `Using a vertex table`_)"
msgstr "För nätverk av anständig storlek är det bäst att förbereda vertex-tabellen i förväg och använda den vid anrop av ``pgr_degree``. (Se `Användning av en vertex-tabell`_)"

msgid "Calculate the degree of the nodes:"
msgstr "Beräkna nodernas grad:"

msgid "`Vertex SQL`_"
msgstr "`Vertex SQL`_"

msgid "`Vertex SQL`_ as described below"
msgstr "`Vertex SQL`_ enligt beskrivningen nedan"

msgid "``dryrun``"
msgstr "``dryrun``"

msgid "When true do not process and get in a NOTICE the resulting query."
msgstr "När det är sant bearbeta inte och få i ett NÄRVARO den resulterande frågan."

msgid "For the `Edges and Vertices`_ signature:"
msgstr "För signaturen `Edges and Vertices`_:"

msgid "For the `Edges`_ signature:"
msgstr "För signaturen `Edges`_:"

msgid "Vertex SQL"
msgstr "Vertex SQL"

msgid "``in_edges``"
msgstr "``in_edges``"

msgid "Array of identifiers of the edges that have the vertex ``id`` as *first end point*."
msgstr "Array med identifierare för de kanter som har toppunkten ``id`` som *första slutpunkt*."

msgid "When missing, ``out_edges`` must exist."
msgstr "När den saknas måste ``out_edges`` finnas."

msgid "``out_edges``"
msgstr "``out_edges``"

msgid "Array of identifiers of the edges that have the vertex ``id`` as *second end point*."
msgstr "Array med identifierare för de kanter som har toppunkten ``id`` som *andra slutpunkt*."

msgid "When missing, ``in_edges`` must exist."
msgstr "När den saknas måste ``in_edges`` finnas."

msgid "Vertex identifier"
msgstr "Identifierare för toppunkt"

msgid "``degree``"
msgstr "``degree``"

msgid "Number of edges that are incident to the vertex ``id``"
msgstr "Antal kanter som är angränsande till toppunkten ``id``"

msgid "Degree of a loop"
msgstr "Grad av en slinga"

msgid "Using the `Edges`_ signature."
msgstr "Använda signaturen `Edges`_."

msgid "Using the `Edges and Vertices`_ signature."
msgstr "Använda signaturen `Edges and Vertices`_."

msgid "Degree of a sub graph"
msgstr "Grad av en undergraf"

msgid "For the following is a subgraph of the :doc:`sampledata`:"
msgstr "För följande är en delgraf av :doc:`sampledata`:"

msgid ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`"
msgstr ":math:`E = \\{(1, 5 \\leftrightarrow 6), (1, 6 \\leftrightarrow 10)\\}`"

msgid ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`"
msgstr ":math:`V = \\{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17\\}`"

msgid "The vertices not participating on the edge are considered isolated"
msgstr "De hörn som inte deltar i kanten betraktas som isolerade"

msgid "their degree is 0 in the subgraph and"
msgstr "deras grad är 0 i undergrafen och"

msgid "their degree is not shown in the output."
msgstr "deras examen visas inte i utdata."

msgid "Using a vertex table"
msgstr "Använda en toppunktstabell"

msgid "For decent size networks, it is best to prepare your vertices table before hand and use it on ``pgr_degree`` calls."
msgstr "För nätverk av anständig storlek är det bäst att förbereda vertices-tabellen i förväg och använda den vid anrop av ``pgr_degree``."

msgid "Extract the vertex information and save into a table:"
msgstr "Extrahera toppunktsinformationen och spara i en tabell:"

msgid "Dry run execution"
msgstr "Utförande av provkörning"

msgid "To get the query generated used to get the vertex information, use ``dryrun => true``."
msgstr "Använd ``dryrun => true`` för att få den fråga som genereras för att få fram toppunktsinformationen."

msgid "The results can be used as base code to make a refinement based on the backend development needs."
msgstr "Resultaten kan användas som baskod för att göra en förfining baserad på behoven för backend-utvecklingen."

msgid "Finding dead ends"
msgstr "Att hitta återvändsgränder"

msgid "If there is a vertices table already built using ``pgr_extractVertices`` and want the degree of the whole graph rather than a subset, it can be forgo using ``pgr_degree`` and work with the ``in_edges`` and ``out_edges`` columns directly."
msgstr "Om det redan finns en toppunktstabell som byggts med hjälp av ``pgr_extractVertices`` och man vill ha graden för hela grafen i stället för en delmängd, kan man avstå från att använda ``pgr_degree`` och arbeta med kolumnerna ``in_edges`` och ``out_edges`` direkt."

msgid "The degree of a dead end is 1."
msgstr "Graden av en återvändsgränd är 1."

msgid "Finding linear vertices"
msgstr "Hitta linjära hörn"

msgid "The degree of a linear vertex is 2."
msgstr "Graden för ett linjärt toppunkt är 2."

msgid "If there is a vertices table already built using the ``pgr_extractVertices``"
msgstr "Om det redan finns en toppunktstabell som byggts upp med hjälp av ``pgr_extractVertices``"

msgid ":doc:`pgr_extractVertices`"
msgstr ":doc:`pgr_extractVertices`"

msgid "``pgr_depthFirstSearch`` - Proposed"
msgstr "``pgr_depthFirstSearch`` - Föreslagen"

msgid "``pgr_depthFirstSearch`` — Returns a depth first search traversal of the graph. The graph can be directed or undirected."
msgstr "``pgr_depthFirstSearch`` - Returnerar en genomgång av grafen med första sökdjupet. Grafen kan vara riktad eller oriktad."

msgid "Version 3.3.0"
msgstr "Version 3.3.0"

msgid "Depth First Search algorithm is a traversal algorithm which starts from a root vertex, goes as deep as possible, and backtracks once a vertex is reached with no adjacent vertices or with all visited adjacent vertices. The traversal continues until all the vertices reachable from the root vertex are visited."
msgstr "Depth First Search-algoritmen är en traverseringsalgoritm som startar från en rotvertex, går så djupt som möjligt och backar när en vertex nås utan några intilliggande vertex eller med alla besökta intilliggande vertex. Traversieringen fortsätter tills alla toppar som kan nås från rotvertexen har besökts."

msgid "The implementation works for both **directed** and **undirected** graphs."
msgstr "Implementationen fungerar för både **directed** och **undirected** grafer."

msgid "Provides the Depth First Search traversal order from a root vertex or from a set of root vertices."
msgstr "Ger traversieringsordningen Depth First Search från en rotvertex eller från en uppsättning rotvertex."

msgid "An optional non-negative maximum depth parameter to limit the results up to a particular depth."
msgstr "En valfri icke-negativ parameter för maximalt djup för att begränsa resultaten till ett visst djup."

msgid "For optimization purposes, any duplicated values in the `Root vids` are ignored."
msgstr "För optimeringsändamål ignoreras alla duplicerade värden i `Root vids`."

msgid "It does not produce the shortest path from a root vertex to a target vertex."
msgstr "Den producerar inte den kortaste vägen från en rotvertex till en målvertex."

msgid "The aggregate cost of traversal is not guaranteed to be minimal."
msgstr "Det är inte säkert att den sammanlagda kostnaden för traverseringen är minimal."

msgid "The returned values are ordered in ascending order of `start_vid`."
msgstr "De returnerade värdena är ordnade i stigande ordning efter `start_vid`."

msgid "Depth First Search Running time: :math:`O(E + V)`"
msgstr "Djup Första sökning Löptid: :math:`O(E + V)`"

msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vid**, [**options**])"
msgstr "pgr_depthFirstSearch(`Kanter SQL`_, **root vid**, [**options**])"

msgid "pgr_depthFirstSearch(`Edges SQL`_, **root vids**, [**options**])"
msgstr "pgr_depthFirstSearch(`Kanter SQL`_, **root vids**, [**options**])"

msgid "**options:** ``[directed, max_depth]``"
msgstr "**options:** ``[directed, max_depth]``"

msgid "Same as `Single vertex`_ but with edges in descending order of ``id``."
msgstr "Samma som `Single vertex`_ men med kanter i fallande ordning efter ``id``."

msgid "`Boost: Depth First Search <https://www.boost.org/libs/graph/doc/depth_first_search.html>`__"
msgstr "`Boost: Djup första sökning <https://www.boost.org/libs/graph/doc/depth_first_search.html>`__"

msgid "`Boost: Undirected DFS <https://www.boost.org/libs/graph/doc/undirected_dfs.html>`__"
msgstr "`Boost: Oriktad DFS <https://www.boost.org/libs/graph/doc/undirected_dfs.html>`__"

msgid "`Wikipedia: Depth First Search algorithm <https://en.wikipedia.org/wiki/Depth-first_search>`__"
msgstr "`Wikipedia: Djup först-sökalgoritm <https://en.wikipedia.org/wiki/Depth-first_search>`__"

msgid "``pgr_dijkstra`` — Shortest path using Dijkstra algorithm."
msgstr "``pgr_dijkstra`` - Kortaste vägen med Dijkstra-algoritmen."

msgid "Version 3.5.0"
msgstr "Version 3.5.0"

msgid "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns."
msgstr "pgr_dijkstra(One to One) added ``start_vid`` and ``end_vid`` columns."

msgid "pgr_dijkstra(One to Many) added ``end_vid`` column."
msgstr "pgr_dijkstra(One to Many) added ``end_vid`` column."

msgid "pgr_dijkstra(Many to One) added ``start_vid`` column."
msgstr "pgr_dijkstra(Many to One) added ``start_vid`` column."

msgid "Version 3.1.0"
msgstr "Version 3.1.0"

msgid "pgr_dijkstra(Combinations)"
msgstr "pgr_dijkstra(Combinations)"

msgid "Version 2.2.0"
msgstr "Version 2.2.0"

msgid "pgr_dijkstra(One to Many)"
msgstr "pgr_dijkstra(One to Many)"

msgid "pgr_dijkstra(Many to One)"
msgstr "pgr_dijkstra(Many to One)"

msgid "pgr_dijkstra(Many to Many)"
msgstr "pgr_dijkstra(Many to Many)"

msgid "Signature change on pgr_dijkstra(One to One)"
msgstr "Ändring av signatur på pgr_dijkstra(One to One)"

msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_dijkstra(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])"

msgid "pgr_dijkstra(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_dijkstra(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])"

msgid "pgr_dijkstra(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_dijkstra(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])"

msgid "pgr_dijkstra(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
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``"

msgid "Directed graph with cost and reverse cost columns"
msgstr "Riktad graf med kolumner för kostnad och omvänd kostnad"

msgid "1) Path from :math:`6` to :math:`10`"
msgstr "1) Väg från :math:`6` till :math:`10`"

msgid "2) Path from :math:`6` to :math:`7`"
msgstr "2) Väg från :math:`6` till :math:`7`"

msgid "3) Path from :math:`12` to :math:`10`"
msgstr "3) Väg från :math:`12` till :math:`10`"

msgid "4) Path from :math:`12` to :math:`7`"
msgstr "4) Väg från :math:`12` till :math:`7`"

msgid "5) Using `One to Many`_ to get the solution of examples 1 and 2"
msgstr "5) Använda `En till många`_ för att få lösningen på exempel 1 och 2"

msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}`"
msgstr "Banor :math:`\\{6\\}\\rightarrow\\{10, 7\\}`"

msgid "6) Using `Many to One`_ to get the solution of examples 2 and 4"
msgstr "6) Använda `Många till en`_ för att få lösningen på exempel 2 och 4"

msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{7\\}`"
msgstr "Banor :math:`\\{6, 12\\}\\rightarrow\\{7\\}` `"

msgid "7) Using `Many to Many`_ to get the solution of examples 1 to 4"
msgstr "7) Använda `Många till många`_ för att få lösningen på exempel 1 till 4"

msgid "Paths :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`"
msgstr "Banor :math:`\\{6, 12\\}\\rightarrow\\{10, 7\\}`"

msgid "8) Using `Combinations`_ to get the solution of examples 1 to 3"
msgstr "8) Använda `Kombinationer`_ för att få lösningen på exempel 1 till 3"

msgid "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`"
msgstr "Paths :math:`\\{6\\}\\rightarrow\\{10, 7\\}\\cup\\{12\\}\\rightarrow\\{10\\}`"

msgid "For **undirected** graphs with ``cost`` and ``reverse_cost`` columns"
msgstr "För **omdirigerade** grafer med kolumnerna ``kostnad`` och ``omvända kostnader``"

msgid "Undirected graph with cost and reverse cost columns"
msgstr "Oriktad graf med kostnads- och omvända kostnadskolumner"

msgid "9) Path from :math:`6` to :math:`10`"
msgstr "9) Stigen från :math:`6` till :math:`10`"

msgid "10) Path from :math:`6` to :math:`7`"
msgstr "10) Väg från :math:`6` till :math:`7`"

msgid "11) Path from :math:`12` to :math:`10`"
msgstr "11) Stigen från :math:`12` till :math:`10`"

msgid "12) Path from :math:`12` to :math:`7`"
msgstr "12) Väg från :math:`12` till :math:`7`"

msgid "13) Using `One to Many`_ to get the solution of examples 9 and 10"
msgstr "13) Använda `En till många`_ för att få lösningen till exempel 9 och 10"

msgid "14) Using `Many to One`_ to get the solution of examples 10 and 12"
msgstr "14) Använda `Många till en`_ för att få lösningen på exempel 10 och 12"

msgid "15) Using `Many to Many`_ to get the solution of examples 9 to 12"
msgstr "15) Använda `Många till många`_ för att få lösningen på exempel 9 till 12"

msgid "16) Using `Combinations`_ to get the solution of examples 9 to 11"
msgstr "16) Använda `Kombinationer`_ för att få lösningen på exempel 9 till 11"

msgid "For **directed** graphs only with ``cost`` column"
msgstr "För **riktade** grafer endast med kolumn ``kostnad``"

msgid "Directed graph only with cost column"
msgstr "Riktad graf endast med kostnadskolumn"

msgid "17) Path from :math:`6` to :math:`10`"
msgstr "17) Väg från :math:`6` till :math:`10`"

msgid "18) Path from :math:`6` to :math:`7`"
msgstr "18) Väg från :math:`6` till :math:`7`"

msgid "19) Path from :math:`12` to :math:`10`"
msgstr "19) Väg från :math:`12` till :math:`10`"

msgid "20) Path from :math:`12` to :math:`7`"
msgstr "20) Väg från :math:`12` till :math:`7`"

msgid "21) Using `One to Many`_ to get the solution of examples 17 and 18"
msgstr "21) Använda `En till många`_ för att få lösningen på exempel 17 och 18"

msgid "22) Using `Many to One`_ to get the solution of examples 18 and 20"
msgstr "22) Använda `Många till en`_ för att få lösningen på exempel 18 och 20"

msgid "23) Using `Many to Many`_ to get the solution of examples 17 to 20"
msgstr "23) Använda `Många till många`_ för att få lösningen på exempel 17 till 20"

msgid "24) Using `Combinations`_ to get the solution of examples 17 to 19"
msgstr "24) Använda `Kombinationer`_ för att få lösningen på exempel 17 till 19"

msgid "For **undirected** graphs only with ``cost`` column"
msgstr "För **ej riktade** grafer endast med kolumn ``kostnad``"

msgid "Undirected graph only with cost column"
msgstr "Ostyrd graf endast med kostnadskolumn"

msgid "25) Path from :math:`6` to :math:`10`"
msgstr "25) Väg från :math:`6` till :math:`10`"

msgid "26) Path from :math:`6` to :math:`7`"
msgstr "26) Väg från :math:`6` till :math:`7`"

msgid "27) Path from :math:`12` to :math:`10`"
msgstr "27) Väg från :math:`12` till :math:`10`"

msgid "28) Path from :math:`12` to :math:`7`"
msgstr "28) Väg från :math:`12` till :math:`7`"

msgid "29) Using `One to Many`_ to get the solution of examples 25 and 26"
msgstr "29) Använda `En till många`_ för att få lösningen på exempel 25 och 26"

msgid "30) Using `Many to One`_ to get the solution of examples 26 and 28"
msgstr "30) Använda `Många till en`_ för att få lösningen på exempel 26 och 28"

msgid "31) Using `Many to Many`_ to get the solution of examples 25 to 28"
msgstr "31) Använda `Många till många`_ för att få lösningen på exempel 25 till 28"

msgid "32) Using `Combinations`_ to get the solution of examples 25 to 27"
msgstr "32) Använda `Kombinationer`_ för att få lösningen på exempel 25 till 27"

msgid "Equvalences between signatures"
msgstr "Utjämningar mellan signaturer"

msgid "The following examples find the path for :math:`\\{6\\}\\rightarrow\\{10\\}`"
msgstr "Följande exempel visar sökvägen för :math:`\\{6\\}\\rightarrow\\{10\\}`"

msgid "33) Using `One to One`_"
msgstr "33) Använda `En till en`_"

msgid "34) Using `One to Many`_"
msgstr "34) Använda `En till många`_"

msgid "35) Using `Many to One`_"
msgstr "35) Använda `Många till en`_"

msgid "36) Using `Many to Many`_"
msgstr "36) Använda `Många till många`_"

msgid "37) Using `Combinations`_"
msgstr "37) Använda `Kombinationer`_"

msgid "`Boost: Dijkstra shortest paths <https://www.boost.org/libs/graph/doc/dijkstra_shortest_paths.html>`__"
msgstr "`Boost: Dijkstra kortaste vägar <https://www.boost.org/libs/graph/doc/dijkstra_shortest_paths.html>`__"

msgid "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"
msgstr "https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"

msgid "``pgr_dijkstraCost``"
msgstr "``pgr_dijkstraCost``"

msgid "``pgr_dijkstraCost`` - Total cost of the shortest path using Dijkstra algorithm."
msgstr "``pgr_dijkstraCost`` - Totalkostnad för den kortaste vägen med Dijkstra-algoritmen."

msgid "pgr_dijkstraCost(Combinations)"
msgstr "pgr_dijkstraCost(Combinations)"

msgid "The ``pgr_dijkstraCost`` function summarizes of the cost of the shortest path using Dijkstra Algorithm."
msgstr "Funktionen ``pgr_dijkstraCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av Dijkstra-algoritmen."

msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])"

msgid "pgr_dijkstraCost(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])"

msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])"

msgid "pgr_dijkstraCost(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_dijkstraCost(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])"

msgid "pgr_dijkstraCost(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_dijkstraCost(`Kanter SQL`_, `Combinations SQL`_, [``directed``])"

msgid "``pgr_dijkstraCostMatrix``"
msgstr "``pgr_dijkstraCostMatrix``"

msgid "``pgr_dijkstraCostMatrix`` - Calculates a cost matrix using :doc:`pgr_dijkstra`."
msgstr "``pgr_dijkstraCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_dijkstra`."

msgid "Using Dijkstra algorithm, calculate and return a cost matrix."
msgstr "Beräkna och returnera en kostnadsmatris med hjälp av Dijkstra-algoritmen."

msgid "pgr_dijkstraCostMatrix(`Edges SQL`_, **start vids**, [``directed``])"
msgstr "pgr_dijkstraCostMatrix(`Kanter SQL`_, **start vids**, [``directed``])"

msgid "``pgr_dijkstraNear``"
msgstr "``pgr_dijkstraNear``"

msgid "``pgr_dijkstraNear`` — Using Dijkstra's algorithm, finds the route that leads to the nearest vertex."
msgstr "``pgr_dijkstraNear`` - Med hjälp av Dijkstras algoritm hittar du den rutt som leder till närmaste toppunkt."

msgid "Given a graph, a starting vertex and a set of ending vertices, this function finds the shortest path from the starting vertex to the nearest ending vertex."
msgstr "Givet en graf, en startpunkt och en uppsättning slutpunkter, hittar den här funktionen den kortaste vägen från startpunkten till närmaste slutpunkt."

msgid "Uses Dijkstra algorithm."
msgstr "Använder Dijkstra-algoritmen."

msgid "Works for **directed** and **undirected** graphs."
msgstr "Fungerar för **directed** och **undirected** grafer."

msgid "When there are more than one path to the same vertex with same cost:"
msgstr "När det finns mer än en väg till samma toppunkt med samma kostnad:"

msgid "The algorithm will return just one path"
msgstr "Algoritmen kommer bara att returnera en väg"

msgid "Optionally allows to find more than one path."
msgstr "Det går även att hitta mer än en sökväg."

msgid "When more than one path is to be returned:"
msgstr "När mer än ett tågläge ska returneras:"

msgid "Results are sorted in increasing order of:"
msgstr "Resultaten sorteras i stigande ordning efter:"

msgid "aggregate cost"
msgstr "sammanlagd kostnad"

msgid "Within the same value of aggregate costs:"
msgstr "Inom samma värde för de sammanlagda kostnaderna:"

msgid "results are sorted by (source, target)"
msgstr "resultaten sorteras efter (källa, mål)"

msgid "Running time: Dijkstra running time: :math:`drt = O((|E| + |V|)log|V|)`"
msgstr "Körtid: Dijkstra-löptid: :math:`drt = O((|E| + |V|)log|V|)`"

msgid "One to Many; :math:`drt`"
msgstr "En till många; :math:`drt`"

msgid "Many to One: :math:`drt`"
msgstr "Många till en: :math:`drt`"

msgid "Many to Many: :math:`drt * |Starting vids|`"
msgstr "Många till många: :math:`drt * |Startande vids|`"

msgid "Combinations: :math:`drt * |Starting vids|`"
msgstr "Kombinationer: :math:`drt * |Starting vids|`"

msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options A**])"
msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vid**, **end vids**, [**options A**])"

msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options A**])"
msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vid**, [**options A**])"

msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options B**])"
msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vids**, [**options B**])"

msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options B**])"
msgstr "pgr_dijkstraNear(`Kanter SQL`_, `Combinations SQL`_, [**options B**])"

msgid "**options A:** ``[directed, cap]``"
msgstr "**options A:** ``[directed, cap]``"

msgid "**options B:** ``[directed, cap, global]``"
msgstr "**options B:** ``[directed, cap, global]``"

msgid "pgr_dijkstraNear(`Edges SQL`_, **start vid**, **end vids**, [**options**])"
msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vid**, **end vids**, [**options**])"

msgid "**options:** ``[directed, cap]``"
msgstr "**options:** ``[directed, cap]``"

msgid "Departing on car from vertex :math:`6` find the nearest subway station."
msgstr "Avgår med bil från toppunkt :math:`6` hitta närmaste tunnelbanestation."

msgid "Using a **directed** graph for car routing."
msgstr "Använda en **riktad** graf för bildirigering."

msgid "The subway stations are on the following vertices :math:`\\{1, 10, 11\\}`"
msgstr "Tunnelbanestationerna ligger på följande hörn :math:`\\{1, 10, 11\\}`"

msgid "The defaults used:"
msgstr "De standardvärden som används:"

msgid "`directed => true`"
msgstr "`riktad => sann`"

msgid "`cap => 1`"
msgstr "`kap => 1`"

msgid "The result shows that station at vertex :math:`11` is the nearest."
msgstr "Resultatet visar att stationen vid toppunktet :math:`11` är den närmaste."

msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vid**, [**options**])"
msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **slut vid**, [**options**])"

msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`2`"
msgstr "Avgår med en bil från en tunnelbanestation hitta de närmaste **två** stationerna till toppunkten :math:`2`"

msgid "On line `4`: using the positional parameter: `directed` set to ``true``"
msgstr "På rad `4`: använder den positionella parametern: `directed` satt till ``true``"

msgid "In line `5`: using named parameter `cap => 2`"
msgstr "I rad `5`: använder namngiven parameter `cap => 2`"

msgid "The result shows that station at vertex :math:`10` is the nearest and the next best is :math:`11`."
msgstr "Resultatet visar att stationen vid toppunktet :math:`10` är den närmaste och den näst bästa är :math:`11`."

msgid "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **end vids**, [**options**])"
msgstr "pgr_dijkstraNear(`Edges SQL`_, **start vids**, **slut vids**, [**options**])"

msgid "**options:** ``[directed, cap, global]``"
msgstr "**options:** ``[directed, cap, global]``"

msgid "Find the best pedestrian connection between two lines of buses"
msgstr "Hitta den bästa förbindelsen för fotgängare mellan två busslinjer"

msgid "Using an **undirected** graph for pedestrian routing"
msgstr "Använda en **omdirigerad** graf för att leda fotgängare"

msgid "The first subway line stations are at :math:`\\{15, 16\\}`"
msgstr "De första tunnelbanestationerna ligger vid :math:`\\{15, 16\\}`"

msgid "The second subway line stations stops are at :math:`\\{1, 10, 11\\}`"
msgstr "Den andra tunnelbanelinjen stannar vid :math:`\\{1, 10, 11\\}`"

msgid "On line `4`: using the named parameter: `directed => false`"
msgstr "På rad `4`: använder den namngivna parametern: `directed => false`"

msgid "`global => true`"
msgstr "`global => sant`"

msgid "For a pedestrian the best connection is to get on/off is at vertex :math:`15` of the first subway line and at vertex :math:`10` of the second subway line."
msgstr "För en fotgängare är den bästa anslutningen att gå av och på vid toppunkten :math:`15` på den första tunnelbanelinjen och vid toppunkten :math:`10` på den andra tunnelbanelinjen."

msgid "Only `one` route is returned because `global` is ``true`` and `cap` is ``1``"
msgstr "Endast `en` rutt returneras eftersom `global` är ``true`` och `cap` är ``1``"

msgid "pgr_dijkstraNear(`Edges SQL`_, `Combinations SQL`_, [**options**])"
msgstr "pgr_dijkstraNear(`Kanter SQL`_, `Combinations SQL`_, [**options**])"

msgid "Find the best car connection between all the stations of two subway lines"
msgstr "Hitta den bästa bilförbindelsen mellan alla stationer på två tunnelbanelinjer"

msgid "The first subway line stations stops are at :math:`\\{1, 10, 11\\}`"
msgstr "Den första tunnelbanelinjen stannar vid :math:`\\{1, 10, 11\\}`"

msgid "The second subway line stations are at :math:`\\{15, 16\\}`"
msgstr "Den andra tunnelbanelinjens stationer ligger vid :math:`\\{15, 16\\}`"

msgid "The combinations contents:"
msgstr "Kombinationernas innehåll:"

msgid "lines `3~4` sets the start vertices to be from the first subway line and the ending vertices to be from the second subway line"
msgstr "linjerna `3~4` anger att startpunkterna ska vara från den första tunnelbanelinjen och att slutpunkterna ska vara från den andra tunnelbanelinjen"

msgid "lines `6~7` sets the start vertices to be from the first subway line and the ending vertices to be from the first subway line"
msgstr "linjerna `6~7` anger att startpunkterna ska vara från den första tunnelbanelinjen och att slutpunkterna ska vara från den första tunnelbanelinjen"

msgid "On line `8`: using the named parameter is `global => false`"
msgstr "På rad `8`: att använda den namngivna parametern är `global => false`"

msgid "From the results:"
msgstr "Från resultaten:"

msgid "making a connection from the first subway line :math:`\\{1, 10, 11\\}` to the second :math:`\\{15, 16\\}`:"
msgstr "skapa en förbindelse från den första tunnelbanelinjen :math:`\\{1, 10, 11\\\\}` till den andra :math:`\\{15, 16\\\\}`:"

msgid "The best connections from all the stations from the first line are: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`"
msgstr "De bästa förbindelserna från alla stationer från den första linjen är: :math:`{(1 \\rightarrow 16) (10 \\rightarrow 16) (11 \\rightarrow 16)}`"

msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `11` and `12`)"
msgstr "Den bästa är :math:`(11 \\rightarrow 16)` med en kostnad på :math:`1` (rader: `11` och `12`)"

msgid "making a connection from the second subway line :math:`\\{15, 16\\}` to the first :math:`\\{1, 10, 11\\}`:"
msgstr "skapa en förbindelse från den andra tunnelbanelinjen :math:`\\{15, 16\\\\}` till den första :math:`\\{1, 10, 11\\\\}`:"

msgid "The best connections from all the stations from the second line are: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`"
msgstr "De bästa förbindelserna från alla stationer från den andra linjen är: :math:`{(15 \\rightarrow 10) (16 \\rightarrow 11)}`"

msgid "Both are equally good as they have the same cost. (lines: `13` and `14` and lines: `15` and `16`)"
msgstr "Båda är lika bra eftersom de har samma kostnad. (rader: `13` och `14` och rader: `15` och `16`)"

msgid "Dijkstra optional parameters"
msgstr "Dijkstra valfria parametrar"

msgid "Near optional parameters"
msgstr "Nära valfria parametrar"

msgid "``cap``"
msgstr "``cap``"

msgid "Find at most ``cap`` number of nearest shortest paths"
msgstr "Hitta högst ``cap`` antal närmaste kortaste vägar"

msgid "``global``"
msgstr "``global``"

msgid "When ``true``: only ``cap`` limit results will be returned"
msgstr "När ``true``: endast ``cap`` gränsresultat kommer att returneras"

msgid "When ``false``: ``cap`` limit per ``Start vid`` will be returned"
msgstr "När ``false``: ``cap`` gräns per ``Start vid`` kommer att returneras"

msgid "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"
msgstr "Wikipedia: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm"

msgid "``pgr_dijkstraNearCost``"
msgstr "``pgr_dijkstraNearCost``"

msgid "``pgr_dijkstraNearCost`` — Using dijkstra algorithm, finds the route that leads to the nearest vertex."
msgstr "``pgr_dijkstraNearCost`` - Med hjälp av dijkstra-algoritmen hittar du den rutt som leder till närmaste toppunkt."

msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options A**])"
msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vid**, **end vids**, [**options A**])"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options A**])"
msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vid**, [**options A**])"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options B**])"
msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vids**, [**options B**])"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options B**])"
msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, `Combinations SQL`_, [**options B**])"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vid**, **end vids**, [**options**])"
msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vid**, **end vids**, [**options**])"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vid**, [**options**])"
msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vid**, [**options**])"

msgid "Departing on a car from a subway station find the nearest **two** stations to vertex :math:`6`"
msgstr "Avgår med en bil från en tunnelbanestation hitta de närmaste **två** stationerna till toppunkten :math:`6``"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, **start vids**, **end vids**, [**options**])"
msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, **start vids**, **end vids**, [**options**])"

msgid "pgr_dijkstraNearCost(`Edges SQL`_, `Combinations SQL`_, [**options**])"
msgstr "pgr_dijkstraNearCost(`Kanter SQL`_, `Combinations SQL`_, [**options**])"

msgid "The best one is :math:`(11 \\rightarrow 16)` with a cost of :math:`1` (lines: `1`)"
msgstr "Den bästa är :math:`(11 \\rightarrow 16)` med en kostnad av :math:`1` (rader: `1`)"

msgid "Both are equally good as they have the same cost. (lines: `12` and `13`)"
msgstr "Båda är lika bra eftersom de har samma kostnad. (rader: `12` och `13`)"

msgid "``pgr_dijkstraVia``"
msgstr "``pgr_dijkstraVia``"

msgid "``pgr_dijkstraVia`` — Route that goes through a list of vertices."
msgstr "``pgr_dijkstraVia`` - Rutt som går genom en lista med toppar."

msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)`."
msgstr "Med en lista över hörnpunkter och en graf är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` för alla :math:`i < size\\_of(via\\;hörnpunkter)`."

msgid "Route"
msgstr "Rutt"

msgid "is a sequence of paths."
msgstr "är en sekvens av banor."

msgid "Path"
msgstr "Sökväg"

msgid "is a section of the route."
msgstr "är en del av rutten."

msgid "One Via"
msgstr "En Via"

msgid "pgr_dijkstraVia(`Edges SQL`_, **via vertices**, [**options**])"
msgstr "pgr_dijkstraVia(`Kanter SQL`_, **via vertices**, [**options**])"

msgid "**options:** ``[directed, strict, U_turn_on_edge]``"
msgstr "**options:** ``[directed, strict, U_turn_on_edge]``"

msgid "Returns set of |via-result|"
msgstr "Returnerar uppsättning av |via-result|"

msgid "Find the route that visits the vertices :math:`\\{5, 1, 8\\}` in that order on an directed graph."
msgstr "Hitta den rutt som besöker topparna :math:`\\{5, 1, 8\\}` i den ordningen i en riktad graf."

msgid "Via optional parameters"
msgstr "Via valfria parametrar"

msgid "When ``true`` departing from a visited vertex will not try to avoid"
msgstr "När ``true`` avgår från en besökt vertex kommer inte att försöka undvika"

msgid "Identifier of a path. Has value **1** for the first path."
msgstr "Identifierare för ett led. Har värdet **1** för det första tågläget."

msgid "Identifier of the edge used to go from ``node`` to the next node in the path sequence."
msgstr "Identifierar den kant som används för att gå från ``node`` till nästa nod i bansekvensen."

msgid "-1 for the last node of the path."
msgstr "-1 för den sista noden på vägen."

msgid "-2 for the last node of the route."
msgstr "-2 för den sista noden i rutten."

msgid "``route_agg_cost``"
msgstr "``route_agg_cost``"

msgid "Total cost from ``start_vid`` of ``seq = 1`` to ``end_vid`` of the current ``seq``."
msgstr "Total kostnad från ``start_vid`` av ``seq = 1`` till ``slut_vid`` av den aktuella ``seq``."

msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a **directed** graph."
msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{5, 7, 1, 8, 15\\}` i den ordningen på en **riktad** graf."

msgid "The main query"
msgstr "Den huvudsakliga frågeställningen"

msgid "Aggregate cost of the third path."
msgstr "Sammanlagd kostnad för det tredje tågläget."

msgid "Route's aggregate cost of the route at the end of the third path."
msgstr "Ruttens sammanlagda kostnad för rutten vid slutet av den tredje vägen."

msgid "Nodes visited in the route."
msgstr "Noder som besökts i rutten."

msgid "The aggregate costs of the route when the visited vertices are reached."
msgstr "De sammanlagda kostnaderna för rutten när de besökta topparna nås."

msgid "Status of \"passes in front\" or \"visits\" of the nodes."
msgstr "Status för \"passeringar framför\" eller \"besök\" av noderna."

msgid ":doc:`via-category`."
msgstr ":doc:`via-category`."

msgid ":doc:`dijkstra-family`."
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 "pgr_drivingDistance(Single vertex)"
msgstr "pgr_drivingDistance(Single vertex)"

msgid "Added ``depth`` and ``start_vid`` result columns."
msgstr "Lagt till resultatkolumnerna ``depth`` och ``start_vid``."

msgid "pgr_drivingDistance(Multiple vertices)"
msgstr "pgr_drivingDistance(Multiple vertices)"

msgid "Result column name change: ``from_v`` to ``start_vid``."
msgstr "Namnbyte på resultatkolumnen: ``from_v`` till ``start_vid``."

msgid "Added ``depth`` and ``pred`` result columns."
msgstr "Lagt till resultatkolumnerna ``depth`` och ``pred``."

msgid "Signature change:"
msgstr "Ändring av signatur:"

msgid "pgr_drivingDistance(single vertex)"
msgstr "pgr_drivingDistance(single vertex)"

msgid "New official signature:"
msgstr "Ny officiell signatur:"

msgid "pgr_drivingDistance(multiple vertices)"
msgstr "pgr_drivingDistance(multiple vertices)"

msgid "Using the Dijkstra algorithm, extracts all the nodes that have costs less than or equal to the value ``distance``. The edges extracted will conform to the corresponding spanning tree."
msgstr "Med hjälp av Dijkstra-algoritmen extraheras alla noder som har kostnader som är mindre än eller lika med värdet ``distance``. De kanter som extraheras kommer att överensstämma med motsvarande spännträd."

msgid "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])"
msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vid**, **distance**, [``directed``])"

msgid "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])"
msgstr "pgr_drivingDistance(`Edges SQL`_, **Root vids**, **distance**, [**options**])"

msgid "**options:** [directed, equicost]"
msgstr "**options:** [directed, equicost]"

msgid "Single Vertex"
msgstr "Enstaka toppunkt"

msgid "From vertex :math:`11` for a distance of :math:`3.0`"
msgstr "Från toppunkten :math:`11` för ett avstånd av :math:`3.0`"

msgid "Multiple Vertices"
msgstr "Flera vertikaler"

msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` with equi-cost on a directed graph"
msgstr "Från topparna :math:`\\{11, 16\\}` för ett avstånd av :math:`3.0` med equi-cost på en riktad graf"

msgid "Driving distance optional parameters"
msgstr "Valfria parametrar för körsträcka"

msgid "``equicost``"
msgstr "``equicost``"

msgid "When ``true`` the node will only appear in the closest ``start_vid`` list. Tie brakes are arbitrary."
msgstr "När ``true`` kommer noden endast att visas i den närmaste ``start_vid``-listan. Bindningsbromsar är godtyckliga."

msgid "When ``false`` which resembles several calls using the single vertex signature."
msgstr "När ``false`` vilket liknar flera anrop som använder signaturen med en enda vertex."

msgid "end-before"
msgstr "slut-innan"

msgid "From vertices :math:`\\{11, 16\\}` for a distance of :math:`3.0` on an undirected graph"
msgstr "Från hörnen :math:`\\{11, 16\\}` för ett avstånd av :math:`3.0` på en odelad graf"

msgid "``pgr_edgeColoring`` - Experimental"
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"

msgid "Edge Coloring is an algorithm used for coloring of the edges for the vertices in the graph. It is an assignment of colors to the edges of the graph so that no two adjacent edges have the same color."
msgstr "Edge Coloring är en algoritm som används för att färglägga kanterna för topparna i grafen. Det är en tilldelning av färger till kanterna i grafen så att inga två intilliggande kanter har samma färg."

msgid "The implementation is for **undirected** and **loop-free** graphs"
msgstr "Implementeringen är för **undirected** och **loop-free** grafer"

msgid "loop free"
msgstr "slinga fri"

msgid "no self-loops and no parallel edges."
msgstr "inga självslingor och inga parallella kanter."

msgid "Provides the color to be assigned to all the edges present in the graph."
msgstr "Ger den färg som ska tilldelas alla kanter som finns i grafen."

msgid "At most :math:`\\Delta + 1` colors are used, where :math:`\\Delta` is the degree of the graph."
msgstr "Högst :math:`\\Delta + 1` färger används, där :math:`\\Delta` är grafens grad."

msgid "This is optimal for some graphs, and by Vizing's theorem it uses at most one color more than the optimal for all others."
msgstr "Detta är optimalt för vissa grafer och enligt Vizings teorem används högst en färg mer än vad som är optimalt för alla andra."

msgid "the chromatic number :math:`x'(G)` (minimum number of colors needed for proper edge coloring of graph) is equal to the degree :math:`\\Delta + 1` of the graph, (:math:`x'(G) = \\Delta`)"
msgstr "det kromatiska talet :math:`x'(G)` (minsta antal färger som behövs för korrekt kantfärgning av grafen) är lika med graden :math:`\\Delta + 1` av grafen, (:math:`x'(G) = \\Delta`)"

msgid "The algorithm tries to assign the least possible color to every edge."
msgstr "Algoritmen försöker tilldela varje kant minsta möjliga färg."

msgid "Does not always produce optimal coloring."
msgstr "Ger inte alltid optimal färgsättning."

msgid "The returned rows are ordered in ascending order of the edge identifier."
msgstr "De returnerade raderna är ordnade i stigande ordning efter kantidentifieraren."

msgid "Efficient graph coloring is an NP-Hard problem, and therefore:"
msgstr "Effektiv färgläggning av grafer är ett NP-hårt problem och därför:"

msgid "In this implelentation the running time: :math:`O(|E|*|V|)`"
msgstr "I den här implementeringen är körtiden: :math:`O(|E|*|V|)`"

msgid "where :math:`|E|` is the number of edges in the graph,"
msgstr "där :math:`|E|` är antalet kanter i grafen,"

msgid ":math:`|V|` is the number of vertices in the graph."
msgstr ":math:`|V|` is the number of vertices in the graph."

msgid "pgr_edgeColoring(`Edges SQL`_)"
msgstr "pgr_edgeColoring(`Kanter SQL`_)"

msgid "Graph coloring of pgRouting :doc:`sampledata`"
msgstr "Grafisk färgläggning av pgRouting :doc:`sampledata`"

msgid "`Boost: Edge Coloring <https://www.boost.org/libs/graph/doc/edge_coloring.html>`__"
msgstr "`Boost: Färgläggning av kanter <https://www.boost.org/libs/graph/doc/edge_coloring.html>`__"

msgid "`Wikipedia: Graph coloring <https://en.wikipedia.org/wiki/Graph_coloring>`__"
msgstr "`Wikipedia: Färgläggning av grafer <https://en.wikipedia.org/wiki/Graph_coloring>`__"

msgid "``pgr_edgeDisjointPaths`` — Calculates edge disjoint paths between two groups of vertices."
msgstr "``pgr_edgeDisjointPaths`` - Beräknar kantdisjunkta vägar mellan två grupper av toppar."

msgid "pgr_edgeDisjointPaths(Combinations)"
msgstr "pgr_edgeDisjointPaths(Combinations)"

msgid "Calculates the edge disjoint paths between two groups of vertices. Utilizes underlying maximum flow algorithms to calculate the paths."
msgstr "Beräknar de kantdisjunkta vägarna mellan två grupper av hörnpunkter. Använder underliggande algoritmer för maximalt flöde för att beräkna vägarna."

msgid "The main characterics are:"
msgstr "De viktigaste egenskaperna är:"

msgid "Calculates the edge disjoint paths between any two groups of vertices."
msgstr "Beräknar de kantskiljande vägarna mellan två valfria grupper av hörnpunkter."

msgid "Returns EMPTY SET when source and destination are the same, or cannot be reached."
msgstr "Returnerar EMPTY SET när källan och destinationen är desamma eller inte kan nås."

msgid "The graph can be directed or undirected."
msgstr "Grafen kan vara riktad eller oriktad."

msgid "Uses :doc:`pgr_boykovKolmogorov` to calculate the paths."
msgstr "Använder :doc:`pgr_boykovKolmogorov` för att beräkna banorna."

msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **slut vid**, [``directed``])"

msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vid**, **slut vids**, [``directed``])"

msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **slut vid**, [``directed``])"

msgid "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, **start vids**, **slut vids**, [``directed``])"

msgid "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_edgeDisjointPaths(`Edges SQL`_, `Combinations SQL`_, [``directed``])"

msgid "Using a combinations table, equivalent to calculating result from vertices :math:`\\{5, 6\\}` to vertices :math:`\\{10, 15, 14\\}` on an undirected graph."
msgstr "Att använda en kombinationstabell motsvarar att beräkna resultatet från topparna :math:`\\{5, 6\\}` till topparna :math:`\\{10, 15, 14\\}` i en ostyrd graf."

msgid "Manually assigned vertex combinations on an undirected graph."
msgstr "Manuellt tilldelade toppunktskombinationer på en odelad graf."

msgid "``pgr_edmondsKarp``"
msgstr "``pgr_edmondsKarp``"

msgid "``pgr_edmondsKarp`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Edmonds Karp Algorithm."
msgstr "``pgr_edmondsKarp`` - Beräknar flödet på grafens kanter som maximerar flödet från källorna till målen med hjälp av Edmonds Karps algoritm."

msgid "pgr_edmondsKarp(Combinations)"
msgstr "pgr_edmondsKarp(Combinations)"

msgid "Renamed from ``pgr_maxFlowEdmondsKarp``"
msgstr "Borttagen från ``pgr_maxFlowEdmondsKarp``"

msgid "Running time: :math:`O( V * E ^ 2)`"
msgstr "Speltid: :math:`O( V * E ^ 2)`"

msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vid**)"
msgstr "pgr_edmondsKarp(`Kanter SQL`_, **start vid**, **end vid**)"

msgid "pgr_edmondsKarp(`Edges SQL`_, **start vid**, **end vids**)"
msgstr "pgr_edmondsKarp(`Kanter SQL`_, **start vid**, **end vids**)"

msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vid**)"
msgstr "pgr_edmondsKarp(`Kanter SQL`_, **start vids**, **end vid**)"

msgid "pgr_edmondsKarp(`Edges SQL`_, **start vids**, **end vids**)"
msgstr "pgr_edmondsKarp(`Kanter SQL`_, **start vids**, **end vids**)"

msgid "pgr_edmondsKarp(`Edges SQL`_, `Combinations SQL`_)"
msgstr "pgr_edmondsKarp(`Kanter SQL`_, `Combinations SQL`_)"

msgid "`Boost: Edmonds Karp max flow <https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html>`__"
msgstr "`Boost: Edmonds Karp maxflöde <https://www.boost.org/libs/graph/doc/edmonds_karp_max_flow.html>`__"

msgid "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm"
msgstr "https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm"

msgid "``pgr_edwardMoore`` - Experimental"
msgstr "``pgr_edwardMoore`` - Experimentell"

msgid "``pgr_edwardMoore`` — Returns the shortest path using Edward-Moore algorithm."
msgstr "``pgr_edwardMoore`` - Returnerar den kortaste vägen med Edward-Moore-algoritmen."

msgid "Edward Moore’s Algorithm is an improvement of the Bellman-Ford Algorithm. It can compute the shortest paths from a single source vertex to all other vertices in a weighted directed graph. The main difference between Edward Moore's Algorithm and Bellman Ford's Algorithm lies in the run time."
msgstr "Edward Moores algoritm är en förbättring av Bellman-Ford-algoritmen. Den kan beräkna de kortaste vägarna från ett enda källvertex till alla andra vertex i en viktad riktad graf. Den största skillnaden mellan Edward Moores algoritm och Bellman Fords algoritm ligger i körtiden."

msgid "The worst-case running time of the algorithm is :math:`O(| V | * | E |)` similar to the time complexity of Bellman-Ford algorithm. However, experiments suggest that this algorithm has an average running time complexity of :math:`O( | E | )` for random graphs. This is significantly faster in terms of computation speed."
msgstr "I värsta fall är algoritmens körtid :math:`O(| V | * | E |)`, vilket liknar tidskomplexiteten för Bellman-Ford-algoritmen. Experiment tyder dock på att denna algoritm har en genomsnittlig komplexitet på :math:`O( | E | )` för slumpmässiga grafer. Detta är betydligt snabbare när det gäller beräkningshastighet."

msgid "Thus, the algorithm is at-best, significantly faster than Bellman-Ford algorithm and is at-worst,as good as Bellman-Ford algorithm"
msgstr "Algoritmen är alltså i bästa fall betydligt snabbare än Bellman-Ford-algoritmen och i sämsta fall lika bra som Bellman-Ford-algoritmen"

msgid "The `agg_cost` the non included values `(v, v)` is :math:`0`"
msgstr "`agg_cost` de icke inkluderade värdena `(v, v)` är :math:`0`"

msgid "For optimization purposes, any duplicated value in the `start vids` or `end vids` are ignored."
msgstr "För optimeringsändamål ignoreras alla duplicerade värden i `start vids` eller `end vids`."

msgid "Running time:"
msgstr "Löptid:"

msgid "Worst case: :math:`O(| V | * | E |)`"
msgstr "Sämsta fall: :math:`O(| V | * | E |)`"

msgid "Average case: :math:`O( | E | )`"
msgstr "Genomsnittligt fall: :math:`O( | E | )`"

msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vid**, **end vid**, [``directed``])"

msgid "pgr_edwardMoore(`Edges SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vid**, **end vids**, [``directed``])"

msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vids**, **end vid**, [``directed``])"

msgid "pgr_edwardMoore(`Edges SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_edwardMoore(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])"

msgid "pgr_edwardMoore(`Edges SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_edwardMoore(`Kanter SQL`_, `Combinations SQL`_, [``directed``])"

msgid "Using a combinations table on an **undirected** graph."
msgstr "Använda en kombinationstabell i en **icke-riktad** graf."

msgid "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm"
msgstr "https://en.wikipedia.org/wiki/Shortest_Path_Faster_Algorithm"

msgid "``pgr_extractVertices``"
msgstr "``pgr_extractVertices``"

msgid "``pgr_extractVertices`` — Extracts the vertices information"
msgstr "``pgr_extractVertices`` - Extraherar information om hörnpunkter"

msgid "This is an auxiliary function for extracting the vertex information of the set of edges of a graph."
msgstr "Detta är en hjälpfunktion för att extrahera toppunktsinformationen för en grafs uppsättning kanter."

msgid "When the edge identifier is given, then it will also calculate the in and out edges"
msgstr "När kantidentifieraren anges kommer den också att beräkna in- och utkanterna"

msgid "pgr_extractVertices(`Edges SQL`_, [``dryrun``])"
msgstr "pgr_extractVertices(`Kanter SQL`_, [``dryrun``])"

msgid "RETURNS SETOF |result-extract|"
msgstr "RETURNS SETOF |result-extract|"

msgid "When line geometry is known"
msgstr "När linjegeometrin är känd"

msgid "(Optional) identifier of the edge."
msgstr "(Valfritt) identifierare för kanten."

msgid "``geom``"
msgstr "``geom``"

msgid "``LINESTRING``"
msgstr "``LINESTRING``"

msgid "Geometry of the edge."
msgstr "Geometri för kanten."

msgid "This inner query takes precedence over the next two inner query, therefore other columns are ignored when ``geom`` column appears."
msgstr "Denna inre fråga har företräde framför de två följande inre frågorna, och därför ignoreras andra kolumner när kolumnen ``geom`` visas."

msgid "Ignored columns:"
msgstr "Ignorerade kolumner:"

msgid "``startpoint``"
msgstr "``startpoint``"

msgid "``endpoint``"
msgstr "``endpoint``"

msgid "When vertex geometry is known"
msgstr "När toppunktsgeometrin är känd"

msgid "To use this inner query the column ``geom`` should not be part of the set of columns."
msgstr "För att använda den här inre frågan får kolumnen ``geom`` inte ingå i kolumnuppsättningen."

msgid "``POINT``"
msgstr "``POINT``"

msgid "POINT geometry of the starting vertex."
msgstr "POINT Geometri för startvertexen."

msgid "POINT geometry of the ending vertex."
msgstr "POINT Geometri för den avslutande vertexen."

msgid "This inner query takes precedence over the next inner query, therefore other columns are ignored when ``startpoint`` and ``endpoint`` columns appears."
msgstr "Denna inre fråga har företräde framför nästa inre fråga, och därför ignoreras andra kolumner när kolumnerna ``startpunkt`` och ``slutpunkt`` visas."

msgid "When identifiers of vertices are known"
msgstr "När identifierare av toppar är kända"

msgid "To use this inner query the columns ``geom``, ``startpoint`` and ``endpoint`` should not be part of the set of columns."
msgstr "För att kunna använda den här inre frågan får kolumnerna ``geom``, ``startpoint`` och ``endpoint`` inte ingå i kolumnuppsättningen."

msgid "``NULL`` When the ``id`` is not part of the inner query"
msgstr "``NULL`` När ``id`` inte är en del av den inre frågan"

msgid "X value of the point geometry"
msgstr "X-värde för punktgeometrin"

msgid "``NULL`` When no geometry is provided"
msgstr "``NULL`` När ingen geometri anges"

msgid "Geometry of the point"
msgstr "Geometri för punkten"

msgid "To get the query generated used to get the vertex information, use ``dryrun := true``."
msgstr "Använd ``dryrun := true`` för att få den fråga som genereras för att få fram toppunktsinformationen."

msgid "Create a routing topology"
msgstr "Skapa en routningstopologi"

msgid "Make sure the database does not have the ``vertices_table``"
msgstr "Kontrollera att databasen inte har ``vertices_table``"

msgid "Clean up the columns of the routing topology to be created"
msgstr "Rensa upp kolumnerna i den routningstopologi som ska skapas"

msgid "When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, <SRID>)``"
msgstr "När ``LINESTRING`` har en SRID används ``geom::geometry(POINT, <SRID>)``"

msgid "For big edge tables that are been prepared,"
msgstr "För bord med stor kant som är förberedda,"

msgid "Create it as ``UNLOGGED`` and"
msgstr "Skapa den som ``UNLOGGED`` och"

msgid "After the table is created ``ALTER TABLE .. SET LOGGED``"
msgstr "Efter att tabellen har skapats ``ALTER TABLE .. SET LOGGED``"

msgid "Inspect the vertices table"
msgstr "Inspektera tabellen med hörnpunkter"

msgid "Create the routing topology on the edge table"
msgstr "Skapa routningstopologin på edge-tabellen"

msgid "Updating the ``source`` information"
msgstr "Uppdatering av informationen om ``källan``"

msgid "Updating the ``target`` information"
msgstr "Uppdatering av informationen om \"målet"

msgid "Inspect the routing topology"
msgstr "Inspektera routingtopologin"

msgid "**Generated topology**"
msgstr "**Genererad topologi**"

msgid "``pgr_findCloseEdges``"
msgstr "``pgr_findCloseEdges``"

msgid "``pgr_findCloseEdges`` - Finds the close edges to a point geometry."
msgstr "``pgr_findCloseEdges`` - Hittar de närmaste kanterna till en punktgeometri."

msgid "``partial`` option is removed."
msgstr "``partial`` alternativet är borttaget."

msgid "``pgr_findCloseEdges`` - An utility function that finds the closest edge to a point geometry."
msgstr "``pgr_findCloseEdges`` - En verktygsfunktion som hittar den närmaste kanten till en punktgeometri."

msgid "The geometries must be in the same coordinate system (have the same SRID)."
msgstr "Geometrierna måste ligga i samma koordinatsystem (ha samma SRID)."

msgid "The code to do the calculations can be obtained for further specific adjustments needed by the application."
msgstr "Koden för att göra beräkningarna kan erhållas för ytterligare specifika justeringar som krävs av applikationen."

msgid "``EMPTY SET`` is returned on dryrun executions"
msgstr "``EMPTY SET`` returneras vid dryrun-körningar"

msgid "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])"
msgstr "pgr_findCloseEdges(`Edges SQL`_, **point**, **tolerance**, [**options**])"

msgid "pgr_findCloseEdges(`Edges SQL`_, **points**, **tolerance**, [**options**])"
msgstr "pgr_findCloseEdges(`Edges SQL`_, **punkter**, **tolerans**, [**alternativ**])"

msgid "**options:** ``[cap, dryrun]``"
msgstr "**options:** ``[cap, dryrun]``"

msgid "Returns set of |result-find|"
msgstr "Returnerar uppsättning av |result-find|"

msgid "One point"
msgstr "En punkt"

msgid "Get two close edges to points of interest with :math:`pid = 5`"
msgstr "Få två nära kanter till intressanta platser med :math:`pid = 5`"

msgid "``cap => 2``"
msgstr "``cap => 2``"

msgid "Many points"
msgstr "Många punkt"

msgid "For each points of interests, find the closest edge."
msgstr "För varje intressepunkt, hitta den närmaste kanten."

msgid "**point**"
msgstr "**punkt**"

msgid "The point geometry"
msgstr "Punktgeometri"

msgid "**points**"
msgstr "**punkter**"

msgid "``POINT[]``"
msgstr "``POINT[]```"

msgid "An array of point geometries"
msgstr "En array av punktgeometrier"

msgid "**tolerance**"
msgstr "**tolerans**"

msgid "Max distance between geometries"
msgstr "Max avstånd mellan geometrier"

msgid "Limit output rows"
msgstr "Begränsa utmatningsraderna"

msgid "When ``false`` calculations are performed."
msgstr "När ``falska`` beräkningar utförs."

msgid "When ``true`` calculations are not performed and the query to do the calculations is exposed in a PostgreSQL ``NOTICE``."
msgstr "När `` sanna`` beräkningar inte utförs och frågan för att göra beräkningarna exponeras i en PostgreSQL ``NOTICE``."

msgid "``geometry``"
msgstr "``geometry``"

msgid "The ``LINESTRING`` geometry of the edge."
msgstr "Geometri för ``LINESTRING`` på kanten."

msgid "When :math:`cap = 1`, it is the closest edge."
msgstr "När :math:`cap = 1` är det den närmaste kanten."

msgid "Value in <0,1> that indicates the relative position from the first end-point of the edge."
msgstr "Värde i <0,1> som anger den relativa positionen från den första ändpunkten på kanten."

msgid "Value in ``[r, l]`` indicating if the point is:"
msgstr "Värde i ``[r, l]`` som indikerar om punkten är:"

msgid "At the right ``r`` of the segment."
msgstr "På höger sida av segmentet."

msgid "When the point is on the line it is considered to be on the right."
msgstr "När punkten ligger på linjen anses den ligga till höger."

msgid "At the left ``l`` of the segment."
msgstr "På vänster sida av segmentet."

msgid "``distance``"
msgstr "``distance``"

msgid "Distance from the point to the edge."
msgstr "Avstånd från punkten till kanten."

msgid "Original ``POINT`` geometry."
msgstr "Ursprunglig ``POINT`` geometri."

msgid "``LINESTRING`` geometry that connects the original **point** to the closest point of the edge with identifier ``edge_id``"
msgstr "``LINESTRING`` geometri som förbinder den ursprungliga **punkten** med den närmaste punkten på kanten med identifieraren ``edge_id``"

msgid "One point in an edge"
msgstr "En punkt i en kant"

msgid "The green node is the original point."
msgstr "Den gröna noden är den ursprungliga punkten."

msgid "``geom`` has the value of the original point."
msgstr "``geom`` har värdet av den ursprungliga punkten."

msgid "The geometry ``edge`` is a line that connects the original point with the edge :math:`sp \\rightarrow ep` edge."
msgstr "Geometrin ``kant`` är en linje som förbinder den ursprungliga punkten med kanten :math:`sp \\rightarrow ep` kant."

msgid "The point is located at the left of the edge."
msgstr "Punkten är placerad till vänster om kanten."

msgid "One point dry run execution"
msgstr "En punkts provkörning"

msgid "Using the query from the previous example:"
msgstr "Använd frågan från föregående exempel:"

msgid "Returns ``EMPTY SET``."
msgstr "Returnerar ``EMPTY SET``."

msgid "``dryrun => true``"
msgstr "``dryrun => true``"

msgid "Generates a PostgreSQL ``NOTICE`` with the code used."
msgstr "Genererar en PostgreSQL ``NOTICE`` med den använda koden."

msgid "The generated code can be used as a starting base code for additional requirements, like taking into consideration the SRID."
msgstr "Den genererade koden kan användas som en baskod för ytterligare krav, t.ex. för att ta hänsyn till SRID."

msgid "Many points in an edge"
msgstr "Många punkter i en kant"

msgid "The green nodes are the **original points**"
msgstr "De gröna noderna är **originalpunkterna**"

msgid "The geometry ``geom``, marked as **g1** and **g2** are the **original points**"
msgstr "Geometrin ``geom``, markerad som **g1** och **g2** är de **originalpunkter**"

msgid "The geometry ``edge``, marked as **edge1** and **edge2** is a line that connects the **original point** with the closest point on the :math:`sp \\rightarrow ep` edge."
msgstr "Geometrin ``kant``, markerad som **kant1** och **kant2** är en linje som förbinder **originalpunkten** med den närmaste punkten på :math:`sp \\rightarrow ep`-kanten."

msgid "Many points dry run execution"
msgstr "Utförande av torrkörning på många punkter"

msgid "Do not process query"
msgstr "Bearbeta inte förfrågan"

msgid "Generate a PostgreSQL ``NOTICE`` with the code used to calculate all columns"
msgstr "Generera en PostgreSQL ``NOTICE`` med koden som används för att beräkna alla kolumner"

msgid "Find at most two routes to a given point"
msgstr "Hitta högst två vägar till en given punkt"

msgid "Using :doc:`pgr_withPoints`"
msgstr "Använda :doc:`pgr_withPoints`"

msgid "A point of interest table"
msgstr "Ett bord för intressepunkter"

msgid "Handling points outside the graph."
msgstr "Hantering av punkter utanför grafen."

msgid "Points of interest"
msgstr "Attraktioner"

msgid "Some times the applications work \"on the fly\" starting from a location that is not a vertex in the graph. Those locations, in pgRrouting are called points of interest."
msgstr "Ibland fungerar applikationerna \"on the fly\" med utgångspunkt från en plats som inte är ett vertex i grafen. Dessa platser kallas i pgRrouting för intressepunkter."

msgid "The information needed in the points of interest is ``pid``, ``edge_id``, ``side``, ``fraction``."
msgstr "Den information som behövs i intressepunkterna är ``pid``, ``edge_id``, ``side``, ``fraction``."

msgid "On this documentation there will be some 6 fixed points of interest and they will be stored on a table."
msgstr "På denna dokumentation kommer det att finnas cirka 6 fasta punkter av intresse och de kommer att lagras på ett bord."

msgid "A unique identifier."
msgstr "En unik identifierare."

msgid "Identifier of the nearest segment."
msgstr "Identifierare för det närmaste segmentet."

msgid "Is it on the left, right or both sides of the segment ``edge_id``."
msgstr "Är det på vänster, höger eller båda sidor av segmentet ``edge_id``."

msgid "Where in the segment is the point located."
msgstr "Var i segmentet är punkten belägen."

msgid "The geometry of the points."
msgstr "Punkternas geometri."

msgid "The distance between ``geom`` and the segment ``edge_id``."
msgstr "Avståndet mellan ``geom`` och segmentet ``edge_id``."

msgid "A segment that connects the ``geom`` of the point to the closest point on the segment ``edge_id``."
msgstr "Ett segment som förbinder punktens ``geom`` med den närmaste punkten på segmentet ``edge_id``."

msgid "``newPoint``"
msgstr "``newPoint``"

msgid "A point on segment ``edge_id`` that is the closest to ``geom``."
msgstr "En punkt på segmentet ``edge_id`` som ligger närmast ``geom``."

msgid "Points of interest fill up"
msgstr "Intressanta platser fylls upp"

msgid "Inserting the points of interest."
msgstr "Infoga intressepunkterna."

msgid "Filling the rest of the table."
msgstr "Fyller resten av bordet."

msgid "Any other additional modification: In this manual, point :math:`6` can be reached from both sides."
msgstr "Någon annan ytterligare modifiering: I denna manual kan punkten :math:`6` nås från båda sidor."

msgid "The points of interest:"
msgstr "De intressanta platserna:"

msgid "``pgr_floydWarshall``"
msgstr "``pgr_floydWarshall``"

msgid "``pgr_floydWarshall`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm."
msgstr "``pgr_floydWarshall`` - Returnerar summan av kostnaderna för den kortaste vägen för varje par av noder i grafen med hjälp av Floyd-Warshall-algoritmen."

msgid "The Floyd-Warshall algorithm, also known as Floyd's algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *dense graphs*. We use Boost's implementation which runs in :math:`\\Theta(V^3)` time,"
msgstr "Floyd-Warshall-algoritmen, även känd som Floyds algoritm, är ett bra val för att beräkna summan av kostnaderna för den kortaste vägen för varje par noder i grafen, för *täta grafer*. Vi använder Boosts implementation som körs på :math:`\\Theta(V^3)`-tid,"

msgid "pgr_floydWarshall(`Edges SQL`_, [``directed``])"
msgstr "pgr_floydWarshall(`Kanter SQL`_, [``directed``])"

msgid "For a directed subgraph with edges :math:`\\{1, 2, 3, 4\\}`."
msgstr "För en riktad delgraf med kanter :math:`\\{1, 2, 3, 4\\}`."

msgid "Boost `Floyd-Warshall <https://www.boost.org/libs/graph/doc/floyd_warshall_shortest.html>`_"
msgstr "Boost `Floyd-Warshall <https://www.boost.org/libs/graph/doc/floyd_warshall_shortest.html>`_"

msgid "``pgr_full_version``"
msgstr "``pgr_full_version``"

msgid "``pgr_full_version`` — Get the details of pgRouting version information."
msgstr "``pgr_full_version`` - Hämta detaljerna i versionsinformationen för pgRouting."

msgid "Get complete details of pgRouting version information"
msgstr "Få fullständig information om pgRouting version information"

msgid "pgr_full_version()"
msgstr "pgr_full_version()"

msgid "RETURNS |result-version|"
msgstr "RETURNS |result-version|"

msgid "Information about when this documentation was built"
msgstr "Information om när denna dokumentation skapades"

msgid "``version``"
msgstr "``version``"

msgid "pgRouting version"
msgstr "pgRouting-version"

msgid "``build_type``"
msgstr "``build_type``"

msgid "The Build type"
msgstr "Typ av byggnad"

msgid "``compile_date``"
msgstr "``compile_date``"

msgid "Compilation date"
msgstr "Datum för sammanställning"

msgid "``library``"
msgstr "``library``"

msgid "Library name and version"
msgstr "Bibliotekets namn och version"

msgid "``system``"
msgstr "``system``"

msgid "Operative system"
msgstr "Operativt system"

msgid "``postgreSQL``"
msgstr "``postgreSQL``"

msgid "pgsql used"
msgstr "pgsql används"

msgid "``compiler``"
msgstr "``compiler``"

msgid "Compiler and version"
msgstr "Kompilator och version"

msgid "``boost``"
msgstr "``boost``"

msgid "Boost version"
msgstr "Boost-version"

msgid "``hash``"
msgstr "``hash``"

msgid "Git hash of pgRouting build"
msgstr "Git-hash av pgRouting-byggnaden"

msgid "``pgr_hawickCircuits`` - Experimental"
msgstr "``pgr_hawickCircuits`` - Experimentell"

msgid "``pgr_hawickCircuits`` — Returns the list of circuits using hawick circuits algorithm."
msgstr "``pgr_hawickCircuits`` - Returnerar listan över kretsar som använder Hawick-kretsalgoritmen."

msgid "Hawick Circuit algorithm, is published in 2008 by Ken Hawick and Health A. James. This algorithm solves the problem of detecting and enumerating circuits in graphs. It is capable of circuit enumeration in graphs with directed-arcs, multiple-arcs and self-arcs with a memory efficient and high-performance im-plementation. It is an extension of Johnson's Algorithm of finding all the elementary circuits of a directed graph."
msgstr "Hawick Circuit algorithm, publicerades 2008 av Ken Hawick och Health A. James. Algoritmen löser problemet med att upptäcka och räkna upp kretsar i grafer. Den kan räkna upp kretsar i grafer med riktade arcs, multipla arcs och self-arcs med en minneseffektiv och högpresterande implementering. Den är en utvidgning av Johnsons algoritm för att hitta alla elementära kretsar i en riktad graf."

msgid "There are 2 variations defined in the Boost Graph Library. Here, we have implemented only 2nd as it serves the most suitable and practical usecase. In this variation we get the circuits after filtering out the circuits caused by parallel edges. Parallel edge circuits have more use cases when you want to count the no. of circuits.Maybe in future, we will also implemenent this variation."
msgstr "Det finns 2 varianter definierade i Boost Graph Library. Här har vi bara implementerat den andra eftersom den är det mest lämpliga och praktiska användningsfallet. I den här varianten får vi kretsarna efter att ha filtrerat bort de kretsar som orsakas av parallella kanter. Parallella kantkretsar har fler användningsfall när du vill räkna antalet kretsar. Kanske i framtiden kommer vi också att implementera denna variation."

msgid "The algorithm implementation works only for directed graph"
msgstr "Implementeringen av algoritmen fungerar endast för riktade grafer"

msgid "It is a variation of Johnson's algorithm for circuit enumeration."
msgstr "Det är en variant av Johnsons algoritm för kretsuppräkning."

msgid "The algorithm outputs the distinct circuits present in the graph."
msgstr "Algoritmen matar ut de olika kretsar som finns i grafen."

msgid "Time Complexity: :math:`O((V + E) (c + 1))`"
msgstr "Tidskomplexitet: :math:`O((V + E) (c + 1))`"

msgid ":math:`|c|` is the number of circuits in the graph."
msgstr ":math:`|c|` is the number of circuits in the graph."

msgid "pgr_hawickCircuits(`Edges SQL`_)"
msgstr "pgr_hawickCircuits(`Kanter SQL`_)"

msgid "Circuits present in the pgRouting :doc:`sampledata`"
msgstr "Kretsar som finns i pgRouting :doc:`sampledata`"

msgid "Id of the circuit starting from ``1``"
msgstr "Id för kretsen med början från ``1``"

msgid "Relative position in the path. Has value ``0`` for beginning of the path"
msgstr "Relativ position i banan. Har värdet ``0`` för början av banan"

msgid "Identifier of the starting vertex of the circuit."
msgstr "Identifierare av kretsens startvertex."

msgid "Identifier of the ending vertex of the circuit."
msgstr "Identifierare för kretsens slutpunkt."

msgid "Identifier of the node in the path from a vid to next vid."
msgstr "Identifierare av noden i sökvägen från en vid till nästa vid."

msgid "`Boost: Hawick Circuit Algorithm <https://www.boost.org/doc/libs/1_78_0/libs/graph/doc/hawick_circuits.html>`__"
msgstr "`Boost: Hawick Circuit Algorithm <https://www.boost.org/doc/libs/1_78_0/libs/graph/doc/hawick_circuits.html>`__"

msgid "``pgr_isPlanar`` - Experimental"
msgstr "``pgr_isPlanar`` - Experimentell"

msgid "``pgr_isPlanar`` — Returns a boolean depending upon the planarity of the graph."
msgstr "``pgr_isPlanar`` - Returnerar ett boolean beroende på grafens planaritet."

msgid "A graph is planar if it can be drawn in two-dimensional space with no two of its edges crossing. Such a drawing of a planar graph is called a plane drawing. Every planar graph also admits a straight-line drawing, which is a plane drawing where each edge is represented by a line segment. When a graph has :math:`K_5` or :math:`K_{3, 3}` as subgraph then the graph is not planar."
msgstr "En graf är plan om den kan ritas i ett tvådimensionellt rum utan att två av dess kanter korsar varandra. En sådan ritning av en plan graf kallas för en plan ritning. Varje plan graf kan också ritas med en rak linje, vilket är en plan ritning där varje kant representeras av ett linjesegment. När en graf har :math:`K_5` eller :math:`K_{3, 3}` som undergraf är grafen inte plan."

msgid "This implementation use the Boyer-Myrvold Planarity Testing."
msgstr "Denna implementering använder Boyer-Myrvolds planaritetstest."

msgid "It will return a boolean value depending upon the planarity of the graph."
msgstr "Den returnerar ett booleskt värde som beror på grafens planhet."

msgid "Applicable only for **undirected** graphs."
msgstr "Gäller endast för **undirected** grafer."

msgid "The algorithm does not considers traversal costs in the calculations."
msgstr "Algoritmen tar inte hänsyn till traversalkostnader i beräkningarna."

msgid "Running time: :math:`O(|V|)`"
msgstr "Speltid: :math:`O(|V|)`"

msgid "pgr_isPlanar(`Edges SQL`)"
msgstr "pgr_isPlanar(`Kanter SQL`)"

msgid "RETURNS ``BOOLEAN``"
msgstr "RETURNERAR ``BOOLEAN``"

msgid "Returns a boolean ``(pgr_isplanar)``"
msgstr "Returnerar en boolean ``(pgr_isplanar)```"

msgid "``pgr_isplanar``"
msgstr "``pgr_isplanar``"

msgid "`true` when the graph is planar."
msgstr "`true` när grafen är planar."

msgid "`false` when the graph is not planar."
msgstr "`false` när grafen inte är planar."

msgid "The following edges will make the subgraph with vertices {10, 15, 11, 16, 13} a :math:`K_1` graph."
msgstr "Följande kanter kommer att göra undergrafen med topparna {10, 15, 11, 16, 13} till en :math:`K_1`-graf."

msgid "The new graph is not planar because it has a :math:`K_5` subgraph. Edges in blue represent :math:`K_5` subgraph."
msgstr "Den nya grafen är inte plan eftersom den har en :math:`K_5`-undergraf. Kanter i blått representerar :math:`K_5` subgraf."

msgid "`Boost: Boyer Myrvold <https://www.boost.org/libs/graph/doc/boyer_myrvold.html>`__"
msgstr "`Boost: Boyer Myrvold <https://www.boost.org/libs/graph/doc/boyer_myrvold.html>`__"

msgid "``pgr_johnson``"
msgstr "``pgr_johnson``"

msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Johnson algorithm."
msgstr "``pgr_johnson`` - Returnerar summan av kostnaderna för den kortaste vägen för varje par noder i grafen med hjälp av Johnson-algoritmen."

msgid "The Johnson algorithm, is a good choice to calculate the sum of the costs of the shortest path for each pair of nodes in the graph, for *sparse graphs*. It uses the Boost's implementation which runs in :math:`O(V E \\log V)` time,"
msgstr "Johnson-algoritmen är ett bra val för att beräkna summan av kostnaderna för den kortaste vägen för varje par noder i grafen, för *glesa grafer*. Den använder Boosts implementation som körs på :math:`O(V E \\log V)` tid,"

msgid "pgr johnson(`Edges SQL`_, [``directed``])"
msgstr "pgr johnson(`Kanter SQL`_, [``directed``])"

msgid "Boost `Johnson <https://www.boost.org/libs/graph/doc/johnson_all_pairs_shortest.html>`_"
msgstr "Boost `Johnson <https://www.boost.org/libs/graph/doc/johnson_all_pairs_shortest.html>`_"

msgid "``pgr_kingOrdering`` - Experimental"
msgstr "``pgr_kingOrdering`` - Experimentell"

msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graph."
msgstr "``pgr_kingOrdering`` - Returnerar King-ordningen för en odelad graf."

msgid "In numerical linear algebra and graph theory, the King ordering algorithm is a heuristic designed to reorder the vertices of a graph so as to reduce its bandwidth."
msgstr "Inom numerisk linjär algebra och grafteori är King Ordering Algorithm en heuristisk metod för att omordna topparna i en graf så att bandbredden minskar."

msgid "The method follows a breadth-first search (BFS) traversal, but with a refinement: at each step, the unvisited neighbors of the current vertex are inserted into the queue in ascending order of their pseudo-degree, where the pseudo-degree of a vertex is the number of edges connecting it to yet-unvisited vertices. This prioritization often yields a smaller bandwidth compared to simpler BFS orderings."
msgstr "Metoden följer en BFS-traversering (breadth-first search), men med en förfining: i varje steg infogas de obesökta grannarna till det aktuella toppunktet i kön i stigande ordning efter deras pseudograd, där pseudograden för ett toppunkt är antalet kanter som ansluter det till ännu obesökta toppunkter. Den här prioriteringen ger ofta en mindre bandbredd jämfört med enklare BFS-ordning."

msgid "The implementation targets undirected graphs."
msgstr "Implementationen är inriktad på oledade grafer."

msgid "Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach."
msgstr "Minimering av bandbredd är ett NP-komplett problem; King Ordering ger en praktisk lokal minimeringsmetod."

msgid "The time complexity is: :math:`O(m^2 \\log(m)|E|)`"
msgstr "Tidskomplexiteten är: :math:`O(m^2 \\log(m)|E|)`"

msgid "where :math:`|E|` is the number of edges,"
msgstr "där :math:`|E|` är antalet kanter,"

msgid ":math:`m` is the maximum degree among all vertices."
msgstr ":math:`m` är den högsta graden bland alla toppar."

msgid "pgr_kingOrdering(`Edges SQL`_)"
msgstr "pgr_kingOrdering(`Edges SQL`_)"

msgid "`Boost: King Ordering <https://www.boost.org/libs/graph/doc/king_ordering.html>`__"
msgstr "`Boost: Kungens beställning <https://www.boost.org/libs/graph/doc/king_ordering.html>`__"

msgid "``pgr_kruskal``"
msgstr "``pgr_kruskal``"

msgid "``pgr_kruskal`` — Minimum spanning tree of a graph using Kruskal's algorithm."
msgstr "``pgr_kruskal`` - Minsta spännviddsträd för en graf med Kruskals algoritm."

msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Kruskal's algorithm."
msgstr "Denna algoritm hittar den minsta spännvidden i en eventuellt frånkopplad graf med hjälp av Kruskals algoritm."

msgid "EMPTY SET is returned when there are no edges in the graph."
msgstr "EMPTY SET returneras när det inte finns några kanter i grafen."

msgid "pgr_kruskal(`Edges SQL`_)"
msgstr "pgr_kruskal(`Kanter SQL`_)"

msgid "Returns set of |result-mst|"
msgstr "Returnerar uppsättning av |result-mst|"

msgid "Minimum spanning forest"
msgstr "Skog med minsta spann"

msgid "``pgr_kruskalBFS`` — Kruskal's algorithm for Minimum Spanning Tree with breadth First Search ordering."
msgstr "``pgr_kruskalBFS`` - Kruskals algoritm för minsta spännviddsträd med bredd först sökordning."

msgid "Added ``pred`` result columns."
msgstr "Lagt till ``pred`` resultatkolumner."

msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm."
msgstr "Besöker och extraherar nodinformationen i Breath First Search-ordningen i det minsta spännviddsträdet som skapats med Kruskals algoritm."

msgid "Returned tree nodes from a root vertex are on Breath First Search order"
msgstr "Returnerade trädnoder från en rotvertex är på Breath First Search-ordning"

msgid "Breath First Search Running time: :math:`O(E + V)`"
msgstr "Breath First Search Speltid: :math:`O(E + V)`"

msgid "pgr_kruskalBFS(`Edges SQL`_, **root vid**, [``max_depth``])"
msgstr "pgr_kruskalBFS(`Kanter SQL`_, **root vid**, [``max_depth``])"

msgid "pgr_kruskalBFS(`Edges SQL`_, **root vids**, [``max_depth``])"
msgstr "pgr_kruskalBFS(`Kanter SQL`_, **root vids**, [``max_depth``])"

msgid "The Minimum Spanning Tree having as root vertex :math:`6`"
msgstr "Det minsta spännviddsträdet som har som rotvertex :math:`6``"

msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`depth \\leq 3`"
msgstr "Det minsta spännviddsträdet som börjar på topparna :math:`\\{9, 6\\}` med :math:`djup \\leq 3`"

msgid "``pgr_kruskalDD`` — Catchament nodes using Kruskal's algorithm."
msgstr "``pgr_kruskalDD`` - Fångar upp noder med hjälp av Kruskals algoritm."

msgid "Using Kruskal's algorithm, extracts the nodes that have aggregate costs less than or equal to a **distance** from a **root** vertex (or vertices) within the calculated minimum spanning tree."
msgstr "Använd Kruskals algoritm för att extrahera de noder som har aggregerade kostnader som är mindre än eller lika med ett **avstånd** från en **rot**-vertex (eller vertex) inom det beräknade minsta spännvidden i trädet."

msgid "Returned tree nodes from a root vertex are on Depth First Search order."
msgstr "Returnerade trädnoder från en rotvertex är på djupet först sökordning."

msgid "Depth First Search running time: :math:`O(E + V)`"
msgstr "Djup Första sökning Löptid: :math:`O(E + V)`"

msgid "pgr_kruskalDD(`Edges SQL`_, **root vid**, **distance**)"
msgstr "pgr_kruskalDD(`Kanter SQL`_, **root vid**, **distance**)"

msgid "pgr_kruskalDD(`Edges SQL`_, **root vids**, **distance**)"
msgstr "pgr_kruskalDD(`Kanter SQL`_, **root vids**, **distance**)"

msgid "The Minimum Spanning Tree starting on vertex :math:`6` with :math:`distance \\leq 3.5`"
msgstr "Det minsta spännviddsträdet som börjar på toppunkten :math:`6` med :math:`avstånd \\leq 3.5`"

msgid "The Minimum Spanning Tree starting on vertices :math:`\\{9, 6\\}` with :math:`distance \\leq 3.5`"
msgstr "Det minsta spännviddsträdet som börjar på topparna :math:`\\{9, 6\\}` med :math:`avstånd \\leq 3.5`"

msgid "``pgr_kruskalDFS`` — Kruskal's algorithm for Minimum Spanning Tree with Depth First Search ordering."
msgstr "``pgr_kruskalDFS`` - Kruskals algoritm för minsta spännviddsträd med djup första sökordning."

msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Kruskal's algorithm."
msgstr "Besöker och extraherar nodernas information i Depth First Search-ordningen för det minsta spännviddsträdet som skapats med Kruskals algoritm."

msgid "Returned tree nodes from a root vertex are on Depth First Search order"
msgstr "Returnerade trädnoder från en rotvertex är på djupet först sökordning"

msgid "pgr_kruskalDFS(`Edges SQL`_, **root vid**, [``max_depth``])"
msgstr "pgr_kruskalDFS(`Kanter SQL`_, **root vid**, [``max_depth``])"

msgid "pgr_kruskalDFS(`Edges SQL`_, **root vids**, [``max_depth``])"
msgstr "pgr_kruskalDFS(`Kanter SQL`_, **root vids**, [``max_depth``])"

msgid "``pgr_lengauerTarjanDominatorTree`` - Experimental"
msgstr "``pgr_lengauerTarjanDominatorTree`` - Experimentell"

msgid "``pgr_lengauerTarjanDominatorTree`` — Returns the immediate dominator of all vertices."
msgstr "``pgr_lengauerTarjanDominatorTree`` - Returnerar den omedelbara dominatorn för alla toppar."

msgid "The algorithm calculates the *immediate dominator* of each vertex called **idom**, once **idom** of each vertex is calculated then by making every **idom** of each vertex as its parent, the dominator tree can be built."
msgstr "Algoritmen beräknar den * omedelbara dominatorn * för varje toppunkt som kallas **idom**, när **idom** för varje toppunkt har beräknats genom att göra varje **idom** för varje toppunkt som dess förälder, kan dominatorträdet byggas."

msgid "The algorithm works in directed graph only."
msgstr "Algoritmen fungerar endast i riktade grafer."

msgid "The algorithm returns *idom* of each vertex."
msgstr "Algoritmen returnerar *idom* för varje toppunkt."

msgid "If the *root vertex* not present in the graph then it returns empty set."
msgstr "Om *rotvertexet* inte finns i grafen returneras en tom uppsättning."

msgid "Running time: :math:`O((V+E)log(V+E))`"
msgstr "Drifttid: :math:`O((V+E)log(V+E))`"

msgid "pgr_lengauerTarjanDominatorTree(`Edges SQL`_, **root vertex**)"
msgstr "pgr_lengauerTarjanDominatorTree(`Kanter SQL`_, **root vertex**)"

msgid "Returns set of |result-idom|"
msgstr "Returnerar uppsättning av |result-idom|"

msgid "The dominator tree with root vertex :math:`5`"
msgstr "Dominatorträdet med rotvertex :math:`5`"

msgid "SQL query as described above."
msgstr "SQL-fråga enligt beskrivningen ovan."

msgid "**root vertex**"
msgstr "**Rot toppunkt**"

msgid "Returns set of ``(seq, vertex_id, idom)``"
msgstr "Returnerar uppsättning av ``(seq, vertex_id, idom)``"

msgid "``vertex_id``"
msgstr "``vertex_id``"

msgid "Identifier of vertex ."
msgstr "Identifierare för toppunkt ."

msgid "``idom``"
msgstr "``idom``"

msgid "Immediate dominator of vertex."
msgstr "Omedelbar dominator av toppunkt."

msgid "Dominator tree of another component."
msgstr "Dominant träd av en annan komponent."

msgid "`Boost: Lengauer-Tarjan dominator <https://www.boost.org/libs/graph/doc/lengauer_tarjan_dominator.htm>`__"
msgstr "`Boost: Lengauer-Tarjan dominator <https://www.boost.org/libs/graph/doc/lengauer_tarjan_dominator.htm>`__"

msgid "`Wikipedia: dominator tree <https://en.wikipedia.org/wiki/Dominator_(graph_theory)>`__"
msgstr "`Wikipedia: dominatorträd <https://en.wikipedia.org/wiki/Dominator_(graph_theory)>`__"

msgid "``pgr_lineGraph`` - Proposed"
msgstr "``pgr_lineGraph`` - Föreslagen"

msgid "``pgr_lineGraph`` — Transforms the given graph into its corresponding edge-based graph."
msgstr "``pgr_lineGraph`` - Transformerar den givna grafen till dess motsvarande kantbaserade graf."

msgid "Works for directed and undirected graphs."
msgstr "Fungerar för riktade och oriktade grafer."

msgid "Given a graph :math:`G`, its line graph :math:`L(G)` is a graph such that:"
msgstr "Givet en graf :math:`G`, är dess linjegraf :math:`L(G)` en sådan graf att:"

msgid "Each vertex of :math:`L(G)` represents an edge of :math:`G`."
msgstr "Varje toppunkt i :math:`L(G)` representerar en kant i :math:`G`."

msgid "Two vertices of :math:`L(G)` are adjacent if and only if their corresponding edges share a common endpoint in :math:`G`"
msgstr "Två hörn i :math:`L(G)` är angränsande om och endast om deras motsvarande kanter har en gemensam ändpunkt i :math:`G`"

msgid "The ``cost`` and ``reverse_cost`` columns of the result represent existence of the edge."
msgstr "Kolumnerna ``cost`` och ``reverse_cost`` i resultatet representerar existensen av kanten."

msgid "When the graph is directed the result is directed."
msgstr "När grafen är riktad är resultatet riktat."

msgid "To get the complete Line Graph use unique identifiers on the double way edges (See `Additional Examples`_)."
msgstr "För att få en komplett linjediagram används unika identifierare på dubbelvägskanterna (se `Ytterligare exempel`_)."

msgid "When the graph is undirected the result is undirected."
msgstr "När grafen är odränerad är resultatet odränerat."

msgid "The ``reverse_cost`` is always :math:`-1`."
msgstr "Den ``omvända_kostnaden`` är alltid :math:`-1`."

msgid "pgr_lineGraph(`Edges SQL`_, [``directed``])"
msgstr "pgr_lineGraph(`Kanter SQL`_, [``directed``])"

msgid "Returns set of |result-lineg|"
msgstr "Returnerar uppsättning av |result-lineg|"

msgid "For an undirected graph with edges :math:'{2,4,5,8}'"
msgstr "För en enkelriktad graf med kanter :math:'{2,4,5,8}'"

msgid "Gives a local identifier for the edge"
msgstr "Ger en lokal identifierare för kanten"

msgid "When `negative`: the source is the reverse edge in the original graph."
msgstr "När `negativ`: källan är den omvända kanten i den ursprungliga grafen."

msgid "When `negative`: the target is the reverse edge in the original graph."
msgstr "När `negativ`: målet är den omvända kanten i den ursprungliga grafen."

msgid "Weight of the edge (``source``, ``target``)."
msgstr "Kantvikt (``källa``, ``mål``)."

msgid "When `negative`: edge (``source``, ``target``) does not exist, therefore it’s not part of the graph."
msgstr "När `negativ`: kanten (``källa``, ``mål``) existerar inte, därför är den inte en del av grafen."

msgid "Weight of the edge (``target``, ``source``)."
msgstr "Kantvikt (``mål``, ``källa``)."

msgid "When `negative`: edge (``target``, ``source``) does not exist, therefore it’s not part of the graph."
msgstr "När `negativ`: kant (``mål``, ``källa``) finns inte, därför är den inte en del av grafen."

msgid "Given the following directed graph"
msgstr "Givet följande riktade graf"

msgid ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`"
msgstr ":math:`G(V,E) = G(\\{1,2,3,4\\},\\{ 1 \\rightarrow 2, 1 \\rightarrow 4, 2 \\rightarrow 3, 3 \\rightarrow 1, 3 \\rightarrow 2, 3 \\rightarrow 4, 4 \\rightarrow 3\\})`"

msgid "Representation as directed with shared edge identifiers"
msgstr "Representation som riktad med delade kantidentifierare"

msgid "For the simplicity, the design of the edges table on the database, has the edge's identifiers are represented with 3 digits:"
msgstr "För enkelhetens skull har utformningen av kanttabellen i databasen, att kanternas identifierare representeras med 3 siffror:"

msgid "hundreds"
msgstr "hundratals"

msgid "the source vertex"
msgstr "källvertexen"

msgid "tens"
msgstr "tiotals"

msgid "always 0, acts as a separator"
msgstr "alltid 0, fungerar som en separator"

msgid "units"
msgstr "enheter"

msgid "the target vertex"
msgstr "målvertexen"

msgid "In this image,"
msgstr "I den här bilden,"

msgid "Single or double head arrows represent one edge (row) on the edges table."
msgstr "Pilarna med enkelt eller dubbelt huvud representerar en kant (rad) på kanttabellen."

msgid "The numbers in the yellow shadow are the edge identifiers."
msgstr "Siffrorna i den gula skuggan är kantidentifierare."

msgid "Two pair of edges share the same identifier when the ``reverse_cost`` column is used."
msgstr "Två par kanter delar samma identifierare när kolumnen ``reverse_cost`` används."

msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with one edge row with :math:`id=203`."
msgstr "Kanterna :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` representeras av en kantrad med :math:`id=203`."

msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with one edge row with :math:`id=304`."
msgstr "Kanterna :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` representeras av en kantrad med :math:`id=304`."

msgid "The graph can be created as follows:"
msgstr "Grafen kan skapas på följande sätt:"

msgid "Line Graph of a directed graph represented with shared edges"
msgstr "Linjediagram över en riktad graf som representeras med delade kanter"

msgid "The result is a directed graph."
msgstr "Resultatet är en riktad graf."

msgid "For :math:`seq=4` from :math:`203 \\leftrightarrow 304` represent two edges"
msgstr "För :math:`seq=4` från :math:`203 \\vänster höger pil 304` representerar två kanter"

msgid "For all the other values of ``seq`` represent one edge."
msgstr "För alla andra värden av ``seq`` representerar en kant."

msgid "The ``cost`` and ``reverse_cost`` values represent the existence of the edge."
msgstr "Värdena ``cost`` och ``reverse_cost`` anger om kanten existerar."

msgid "When positive: the edge exists."
msgstr "När den är positiv: kanten finns."

msgid "When negative: the edge does not exist."
msgstr "När den är negativ: kanten existerar inte."

msgid "Representation as directed with unique edge identifiers"
msgstr "Representation som riktad med unika kantidentifierare"

msgid "Single head arrows represent one edge (row) on the edges table."
msgstr "Pilarna med ett huvud representerar en kant (rad) i tabellen över kanter."

msgid "There are no double head arrows"
msgstr "Det finns inga pilar med dubbla huvuden"

msgid "Two pair of edges share the same ending nodes and the ``reverse_cost`` column is not used."
msgstr "Två par kanter har samma slutnoder och kolumnen ``reverse_cost`` används inte."

msgid "Edges :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` are represented with two edges :math:`id=203` and :math:`id=302` respectively."
msgstr "Kanterna :math:`{2 \\rightarrow 3, 3 \\rightarrow 2}` representeras med två kanter :math:`id=203` respektive :math:`id=302`."

msgid "Edges :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` are represented with two edges :math:`id=304` and :math:`id=403` respectively."
msgstr "Kanterna :math:`{3 \\rightarrow 4, 4 \\rightarrow 3}` representeras med två kanter :math:`id=304` respektive :math:`id=403`."

msgid "Line Graph of a directed graph represented with unique edges"
msgstr "Linjediagram över en riktad graf som representeras med unika kanter"

msgid "For :math:`seq=7` from :math:`203 \\leftrightarrow 302` represent two edges."
msgstr "För :math:`seq=7` från :math:`203 \\leftrightarrow 302` representerar två kanter."

msgid "For :math:`seq=8` from :math:`304 \\leftrightarrow 403` represent two edges."
msgstr "För :math:`seq=8` från :math:`304 \\vänster höger pil 403` representerar två kanter."

msgid "wikipedia: `Line Graph <https://en.wikipedia.org/wiki/Line_graph>`__"
msgstr "wikipedia: `Linjediagram <https://en.wikipedia.org/wiki/Line_graph>`__"

msgid "mathworld: `Line Graph <https://mathworld.wolfram.com/LineGraph.html>`__"
msgstr "mathworld: `Linjegraf <https://mathworld.wolfram.com/LineGraph.html>`__"

msgid "``pgr_lineGraphFull`` - Experimental"
msgstr "``pgr_lineGraphFull`` - Experimentell"

msgid "``pgr_lineGraphFull`` — Transforms a given graph into a new graph where all of the vertices from the original graph are converted to line graphs."
msgstr "``pgr_lineGraphFull`` - Transformerar en given graf till en ny graf där alla hörn från den ursprungliga grafen konverteras till linjegrafer."

msgid "Version 2.6.0"
msgstr "Version 2.6.0"

msgid "``pgr_lineGraphFull``, converts original directed graph to a directed line graph by converting each vertex to a complete graph and keeping all the original edges. The new connecting edges have a cost 0 and go between the adjacent original edges, respecting the directionality."
msgstr "``pgr_lineGraphFull``, konverterar en ursprunglig riktad graf till en riktad linjegraf genom att konvertera varje vertex till en komplett graf och behålla alla ursprungliga kanter. De nya anslutande kanterna har en kostnad på 0 och går mellan de intilliggande ursprungliga kanterna, med respekt för riktningen."

msgid "A possible application of the resulting graph is **\"routing with two edge restrictions\"**:"
msgstr "En möjlig tillämpning av den resulterande grafen är **\"routing med två kantbegränsningar\"**:"

msgid "Setting a cost of using the vertex when routing between edges on the connecting edge"
msgstr "Ställer in en kostnad för att använda vertexen vid routing mellan kanter på den anslutande kanten"

msgid "Forbid the routing between two edges by removing the connecting edge"
msgstr "Förbjud routing mellan två kanter genom att ta bort den anslutande kanten"

msgid "This is possible because each of the intersections (vertices) in the original graph are now complete graphs that have a new edge for each possible turn across that intersection."
msgstr "Detta är möjligt eftersom alla korsningar (hörnpunkter) i den ursprungliga grafen nu är kompletta grafer som har en ny kant för varje möjlig sväng över korsningen."

msgid "This function is for **directed** graphs."
msgstr "Denna funktion är avsedd för **riktade** grafer."

msgid "Results are undefined when a negative vertex id is used in the input graph."
msgstr "Resultaten är odefinierade när ett negativt vertex-id används i indatagrafen."

msgid "Results are undefined when a duplicated edge id is used in the input graph."
msgstr "Resultaten är odefinierade när ett duplicerat kant-ID används i indatagrafen."

msgid "Running time: TBD"
msgstr "Löptid: TBD"

msgid "pgr_lineGraphFull(`Edges SQL`_)"
msgstr "pgr_lineGraphFull(`Kanter SQL`_)"

msgid "Returns set of |result-linegf|"
msgstr "Returnerar uppsättning av |result-linegf|"

msgid "Full line graph of subgraph of edges :math:`\\{4, 7, 8, 10\\}`"
msgstr "Fullständig linjegraf av delgraf av kanter :math:`{\\4, 7, 8, 10\\}`"

msgid "The examples include the subgraph including edges 4, 7, 8, and 10 with ``reverse_cost``."
msgstr "Exemplen inkluderar delgrafen som innehåller kanterna 4, 7, 8 och 10 med ``reverse_cost``."

msgid "The data"
msgstr "Uppgifterna"

msgid "This example displays how this graph transformation works to create additional edges for each possible turn in a graph."
msgstr "Detta exempel visar hur denna grafomvandling fungerar för att skapa ytterligare kanter för varje möjlig vändning i en graf."

msgid "|first|"
msgstr "|first|"

msgid "first"
msgstr "första"

msgid "The transformation"
msgstr "Omvandlingen"

msgid "|second|"
msgstr "|second|"

msgid "second"
msgstr "sekund"

msgid "In the transformed graph, all of the edges from the original graph are still present (yellow), but we now have additional edges for every turn that could be made across vertex 7 (orange)."
msgstr "I den transformerade grafen finns alla kanter från den ursprungliga grafen kvar (gult), men vi har nu ytterligare kanter för varje sväng som skulle kunna göras över toppunkt 7 (orange)."

msgid "Creating table that identifies transformed vertices"
msgstr "Skapa tabell som identifierar transformerade toppar"

msgid "The vertices in the transformed graph are each created by splitting up the vertices in the original graph. Unless a vertex in the original graph is a leaf vertex, it will generate more than one vertex in the transformed graph. One of the newly created vertices in the transformed graph will be given the same vertex identifier as the vertex that it was created from in the original graph, but the rest of the newly created vertices will have negative vertex ids."
msgstr "Varje toppunkt i den transformerade grafen skapas genom att dela upp toppunkterna i den ursprungliga grafen. Om inte en vertex i den ursprungliga grafen är en bladvertex kommer den att generera mer än en vertex i den transformerade grafen. Ett av de nyskapade vertexen i den transformerade grafen får samma vertexidentifierare som det vertex som det skapades från i den ursprungliga grafen, men resten av de nyskapade vertexen får negativa vertexidentifierare."

msgid "Following is an example of how to generate a table that maps the ids of the newly created vertices with the original vertex that they were created from"
msgstr "Här följer ett exempel på hur man genererar en tabell som mappar id:n för de nyskapade topparna med den ursprungliga topp som de skapades från"

msgid "Store edge results"
msgstr "Förvara kantresultat"

msgid "The first step is to store the results of the ``pgr_lineGraphFull`` call into a table"
msgstr "Det första steget är att lagra resultatet av anropet ``pgr_lineGraphFull`` i en tabell"

msgid "Create the mapping table"
msgstr "Skapa mappningstabellen"

msgid "From the original graph's vertex information"
msgstr "Från den ursprungliga grafens toppunktsinformation"

msgid "Add the new vertices"
msgstr "Lägg till de nya hörnen"

msgid "Filling the mapping table"
msgstr "Fylla kartläggningstabellen"

msgid "The positive vertex identifiers are the original identifiers"
msgstr "De positiva vertexidentifierarna är de ursprungliga identifierarna"

msgid "Inspecting the vertices map"
msgstr "Inspektion av kartan över hörnpunkter"

msgid "The self loops happen when there is no cost traveling to the ``target`` and the source has an original value."
msgstr "Självslingorna uppstår när det inte kostar något att resa till \"målet\" och källan har ett ursprungligt värde."

msgid "Updating values from self loops"
msgstr "Uppdatering av värden från självloopar"

msgid "Inspecting the vertices table"
msgstr "Inspektera tabellen över hörnpunkter"

msgid "Updating from inner self loops"
msgstr "Uppdatering från inre självloopar"

msgid "Adding a soft restriction"
msgstr "Lägga till en mjuk begränsning"

msgid "A soft restriction going from vertex 6 to vertex 3 using edges 4 -> 7 is wanted."
msgstr "En mjuk begränsning som går från toppunkt 6 till toppunkt 3 med hjälp av kanterna 4 -> 7 önskas."

msgid "Identifying the restriction"
msgstr "Identifiering av begränsningen"

msgid "Running a :doc:`pgr_dijkstraNear` the edge with cost 0, edge 8, is where the cost will be increased"
msgstr "Kör en :doc:`pgr_dijkstraNear` kanten med kostnad 0, kant 8, är där kostnaden kommer att ökas"

msgid "The edge to be altered is ``WHERE cost = 0 AND seq != 1 AND edge != -1`` from the previous query:"
msgstr "Kanten som ska ändras är ``WHERE cost = 0 AND seq != 1 AND edge != -1`` från den föregående frågan:"

msgid "Adding a value to the restriction"
msgstr "Lägga till ett värde till begränsningen"

msgid "Updating the cost to the edge:"
msgstr "Uppdatering av kostnaden till kanten:"

msgid "Routing from :math:`6` to :math:`3`"
msgstr "Omdirigering från :math:`6` till :math:`3`"

msgid "Now the route does not use edge 8 and does a U turn on a leaf vertex."
msgstr "Nu använder rutten inte kant 8 och gör en U-sväng på en bladvertex."

msgid "Simplifying leaf vertices"
msgstr "Förenkling av bladhörnpunkter"

msgid "In this example, there is no additional cost for traversing a leaf vertex."
msgstr "I det här exemplet tillkommer ingen extra kostnad för att passera en bladvertex."

msgid "Using the vertex map give the leaf verices their original value."
msgstr "Med hjälp av vertexkartan ger du bladvertices deras ursprungliga värde."

msgid "On the source column"
msgstr "På källkolumnen"

msgid "On the target column"
msgstr "På målkolumnen"

msgid "Removing self loops on leaf nodes"
msgstr "Ta bort självloopar på bladnoder"

msgid "The self loops of the leaf nodes are"
msgstr "Bladnodernas självslingor är"

msgid "Which can be removed"
msgstr "Som kan tas bort"

msgid "Routing can be done now using the original vertices id using :doc:`pgr_dijkstra`"
msgstr "Routing kan nu göras med hjälp av originalvertices id med :doc:`pgr_dijkstra`"

msgid "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 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"

msgid "``pgr_makeConnected`` - Experimental"
msgstr "``pgr_makeConnected`` - Experimentell"

msgid "``pgr_makeConnected`` — Set of edges that will connect the graph."
msgstr "``pgr_makeConnected`` - Uppsättning kanter som kommer att ansluta grafen."

msgid "Adds the minimum number of edges needed to make the input graph connected. The algorithm first identifies all of the connected components in the graph, then adds edges to connect those components together in a path. For example, if a graph contains three connected components A, B, and C, make_connected will add two edges. The two edges added might consist of one connecting a vertex in A with a vertex in B and one connecting a vertex in B with a vertex in C."
msgstr "Lägger till det minsta antal kanter som behövs för att göra indatagrafen ansluten. Algoritmen identifierar först alla anslutna komponenter i grafen och lägger sedan till kanter för att ansluta dessa komponenter till varandra i en väg. Om en graf t.ex. innehåller tre anslutna komponenter A, B och C lägger make_connected till två kanter. De två kanterna som läggs till kan bestå av en som förbinder ett toppunkt i A med ett toppunkt i B och en som förbinder ett toppunkt i B med ett toppunkt i C."

msgid "It will give a minimum list of all edges which are needed in the graph to make connect it."
msgstr "Det kommer att ge en minimilista över alla kanter som behövs i grafen för att ansluta den."

msgid "The algorithm does not considers geometric topology in the calculations."
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."

msgid "`Boost: make connected <https://www.boost.org/libs/graph/doc/make_connected.html>`__"
msgstr "`Boost: skapa anslutning <https://www.boost.org/libs/graph/doc/make_connected.html>`__"

msgid "``pgr_maxCardinalityMatch``"
msgstr "``pgr_maxCardinalityMatch``"

msgid "``pgr_maxCardinalityMatch`` — Calculates a maximum cardinality matching in a graph."
msgstr "``pgr_maxCardinalityMatch`` - Beräknar en matchning med maximal kardinalitet i en graf."

msgid "pgr_maxCardinalityMatch(text) returns only ``edge`` column."
msgstr "pgr_maxCardinalityMatch(text) returns only ``edge`` column."

msgid "Deprecated signature"
msgstr "Föråldrad signatur"

msgid "directed => ``false`` when used."
msgstr "riktad => ``false`` när den används."

msgid "Renamed from ``pgr_maximumCardinalityMatching``"
msgstr "Omdöpta från ``pgr_maximumCardinalityMatching``"

msgid "A matching or independent edge set in a graph is a set of edges without common vertices."
msgstr "En matchande eller oberoende kantuppsättning i en graf är en uppsättning kanter utan gemensamma toppar."

msgid "A maximum matching is a matching that contains the largest possible number of edges."
msgstr "En maximal matchning är en matchning som innehåller största möjliga antal kanter."

msgid "There may be many maximum matchings."
msgstr "Det kan finnas många maximala matchningar."

msgid "Calculates one possible maximum cardinality matching in a graph."
msgstr "Beräknar en möjlig matchning med maximal kardinalitet i en graf."

msgid "Running time: :math:`O( E*V * \\alpha(E,V))`"
msgstr "Speltid: :math:`O( E*V * \\alpha(E,V))`"

msgid ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_."
msgstr ":math:`\\alpha(E,V)` is the inverse of the `Ackermann function`_."

msgid "pgr_maxCardinalityMatch(`Edges SQL`_)"
msgstr "pgr_maxCardinalityMatch(`Kanter SQL`_)"

msgid "Using all edges."
msgstr "Använd alla kanter."

msgid "SQL query, which should return a set of rows with the following columns:"
msgstr "SQL-fråga, som ska returnera en uppsättning rader med följande kolumner:"

msgid "A positive value represents the existence of the edge (``source``, ``target``)."
msgstr "Ett positivt värde representerar existensen av kanten (``källa``, ``mål``)."

msgid "A positive value represents the existence of the edge (``target``, ``source``)"
msgstr "Ett positivt värde representerar existensen av kanten (``target``, ``source``)"

msgid "Identifier of the edge in the original query."
msgstr "Identifierare av kanten i den ursprungliga frågan."

msgid "`Boost: maximum_matching <https://www.boost.org/libs/graph/doc/maximum_matching.html>`__"
msgstr "`Boost: maximum_matching <https://www.boost.org/libs/graph/doc/maximum_matching.html>`__"

msgid "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29"
msgstr "https://en.wikipedia.org/wiki/Matching_%28graph_theory%29"

msgid "https://en.wikipedia.org/wiki/Ackermann_function"
msgstr "https://en.wikipedia.org/wiki/Ackermann_function"

msgid "``pgr_maxFlow``"
msgstr "``pgr_maxFlow``"

msgid "``pgr_maxFlow`` — Calculates the maximum flow in a directed graph from the source(s) to the targets(s) using the Push Relabel algorithm."
msgstr "``pgr_maxFlow`` - Beräknar det maximala flödet i en riktad graf från källorna till målen med hjälp av Push Relabel-algoritmen."

msgid "pgr_maxFlow(Combinations)"
msgstr "pgr_maxFlow(Combinations)"

msgid "Calculates the maximum flow from the sources to the targets."
msgstr "Beräknar det maximala flödet från källorna till målen."

msgid "When the maximum flow is **0** then there is no flow and **0** is returned."
msgstr "När det maximala flödet är **0** finns det inget flöde och **0** returneras."

msgid "Uses the :doc:`pgr_pushRelabel <pgr_pushRelabel>` algorithm."
msgstr "Använder algoritmen :doc:`pgr_pushRelabel <pgr_pushRelabel>`."

msgid "Running time: :math:`O( V ^ 3)`"
msgstr "Speltid: :math:`O( V ^ 3)`"

msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vid**)"
msgstr "pgr_maxFlow(`Kanter SQL`_, **start vid**, **end vid**)"

msgid "pgr_maxFlow(`Edges SQL`_, **start vid**, **end vids**)"
msgstr "pgr_maxFlow(`Kanter SQL`_, **start vid**, **end vids**)"

msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vid**)"
msgstr "pgr_maxFlow(`Kanter SQL`_, **start vids**, **end vid**)"

msgid "pgr_maxFlow(`Edges SQL`_, **start vids**, **end vids**)"
msgstr "pgr_maxFlow(`Kanter SQL`_, **start vids**, **end vids**)"

msgid "pgr_maxFlow(`Edges SQL`_, `Combinations SQL`_)"
msgstr "pgr_maxFlow(`Kanter SQL`_, `Combinations SQL`_)"

msgid "RETURNS ``BIGINT``"
msgstr "RETURNERAR ``BIGINT``"

msgid "Maximum flow possible from the source(s) to the target(s)"
msgstr "Högsta möjliga flöde från källan/källorna till målet/målen"

msgid "`Boost: push relabel max flow <https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html>`__"
msgstr "`Boost: push relabel max flöde <https://www.boost.org/libs/graph/doc/push_relabel_max_flow.html>`__"

msgid "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm"
msgstr "https://en.wikipedia.org/wiki/Push%E2%80%93relabel_maximum_flow_algorithm"

msgid "``pgr_maxFlowMinCost`` - Experimental"
msgstr "``pgr_maxFlowMinCost`` - Experimentell"

msgid "``pgr_maxFlowMinCost`` — Calculates the edges that minimizes the total cost of the maximum flow on a graph"
msgstr "``pgr_maxFlowMinCost`` - Beräknar de kanter som minimerar den totala kostnaden för det maximala flödet i en graf"

msgid "pgr_maxFlowMinCost(Combinations)"
msgstr "pgr_maxFlowMinCost(Combinations)"

msgid "|Boost| Boost Graph Inside."
msgstr "|Boost| Boost Graph Inside."

msgid "**TODO** check which statement is true:"
msgstr "**TODO** kontrollera vilket påstående som är sant:"

msgid "The cost value of all input edges must be nonnegative."
msgstr "Kostnadsvärdet för alla inmatade kanter måste vara icke-negativt."

msgid "Process is done when the cost value of all input edges is nonnegative."
msgstr "Processen är klar när kostnadsvärdet för alla inmatade kanter är icke-negativt."

msgid "Process is done on edges with nonnegative cost."
msgstr "Processen görs på kanter med icke-negativ kostnad."

msgid "Running time: :math:`O(U * (E + V * logV))`"
msgstr "Drifttid: :math:`O(U * (E + V * logV))`"

msgid "where :math:`U` is the value of the max flow."
msgstr "där :math:`U` är värdet på maxflödet."

msgid ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`."
msgstr ":math:`U` is upper bound on number of iterations. In many real world cases number of iterations is much smaller than :math:`U`."

msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vid**)"
msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vid**, **end vid**)"

msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vid**, **end vids**)"
msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vid**, **end vids**)"

msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vid**)"
msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vids**, **end vid**)"

msgid "pgr_maxFlowMinCost(`Edges SQL`_, **start vids**, **end vids**)"
msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, **start vids**, **end vids**)"

msgid "pgr_maxFlowMinCost(`Edges SQL`_, `Combinations SQL`_)"
msgstr "pgr_maxFlowMinCost(`Kanter SQL`_, `Combinations SQL`_)"

msgid "Returns set of |result-flow-mincost|"
msgstr "Returnerar uppsättning av |result-flow-mincost|"

msgid "``pgr_maxFlowMinCost_Cost`` - Experimental"
msgstr "``pgr_maxFlowMinCost_Cost`` - Experimentell"

msgid "``pgr_maxFlowMinCost_Cost`` — Calculates the minimum total cost of the maximum flow on a graph"
msgstr "``pgr_maxFlowMinCost_Cost`` - Beräknar den lägsta totala kostnaden för det maximala flödet i en graf"

msgid "pgr_maxFlowMinCost_Cost(Combinations)"
msgstr "pgr_maxFlowMinCost_Cost(Combinations)"

msgid "**The cost value of all input edges must be nonnegative.**"
msgstr "**Kostnadsvärdet för alla inmatade kanter måste vara icke-negativt.**"

msgid "When the maximum flow is 0 then there is no flow and **0** is returned."
msgstr "När det maximala flödet är 0 finns det inget flöde och **0** returneras."

msgid "Uses :doc:`pgr_maxFlowMinCost`."
msgstr "Använder :doc:`pgr_maxFlowMinCost`."

msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vid**)"
msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, **start vid**, **end vid**)"

msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vid**, **end vids**)"
msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, **start vid**, **end vids**)"

msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vid**)"
msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, **start vids**, **end vid**)"

msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, **start vids**, **end vids**)"
msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, **start vids**, **end vids**)"

msgid "pgr_maxFlowMinCost_Cost(`Edges SQL`_, `Combinations SQL`_)"
msgstr "pgr_maxFlowMinCost_Cost(`Kanter SQL`_, `Combinations SQL`_)"

msgid "RETURNS FLOAT"
msgstr "RETURNS FLOAT"

msgid "Minimum Cost Maximum Flow possible from the source(s) to the target(s)"
msgstr "Minsta kostnad Högsta möjliga flöde från källa(n) till mål(en)"

msgid "``pgr_pickDeliver`` - Experimental"
msgstr "``pgr_pickDeliver`` - Experimentell"

msgid "``pgr_pickDeliver`` - Pickup and delivery Vehicle Routing Problem"
msgstr "``pgr_pickDeliver`` - Problem med ruttplanering för hämtning och leverans av fordon"

msgid "Problem: Distribute and optimize the pickup-delivery pairs into a fleet of vehicles."
msgstr "Problem: Fördela och optimera upphämtnings- och leveranspar i en fordonsflotta."

msgid "Optimization problem is NP-hard."
msgstr "Optimeringsproblemet är NP-svårt."

msgid "pickup and Delivery with time windows."
msgstr "upphämtning och leverans med tidsfönster."

msgid "All vehicles are equal."
msgstr "Alla fordon är likvärdiga."

msgid "Same Starting location."
msgstr "Samma Startplats."

msgid "Same Ending location which is the same as Starting location."
msgstr "Samma slutplacering som är densamma som startplaceringen."

msgid "All vehicles travel at the same speed."
msgstr "Alla fordon färdas med samma hastighet."

msgid "A customer is for doing a pickup or doing a deliver."
msgstr "En kund är för att göra en upphämtning eller göra en leverans."

msgid "has an open time."
msgstr "har en öppen tid."

msgid "has a closing time."
msgstr "har en stängningstid."

msgid "has a service time."
msgstr "har en servicetid."

msgid "has an (x, y) location."
msgstr "har en (x, y)-placering."

msgid "There is a customer where to deliver a pickup."
msgstr "Det finns en kund där man ska leverera en pickup."

msgid "travel time between customers is distance / speed"
msgstr "restid mellan kunder är avstånd / hastighet"

msgid "pickup and delivery pair is done with the same vehicle."
msgstr "hämtning och leverans sker med samma fordon."

msgid "All trucks depart at time 0."
msgstr "Alla lastbilar avgår vid tidpunkt 0."

msgid "the algorithm will raise an exception when"
msgstr "algoritmen kommer att ge upphov till ett undantag när"

msgid "If there is a pickup-deliver pair than violates time window"
msgstr "Om det finns ett upphämtnings-/leveranspar som bryter mot tidsfönstret"

msgid "The speed, max_cycles, ma_capacity have illegal values"
msgstr "Hastigheten, max_cycles, ma_capacity har olagliga värden"

msgid "Six different initial will be optimized - the best solution found will be result"
msgstr "Sex olika initialer kommer att optimeras - den bästa lösningen som hittas blir resultatet"

msgid "Signature"
msgstr "Underskrift"

msgid "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])"
msgstr "pgr_pickDeliver(`Orders SQL`_, `Vehicles SQL`_, `Matrix SQL`_, [**options**])"

msgid "**options:** ``[factor, max_cycles, initial_sol]``"
msgstr "**options:** ``[factor, max_cycles, initial_sol]``"

msgid "Returns set of |result-pickdrop|"
msgstr "Returnerar uppsättning av |result-pickdrop|"

msgid "Solve the following problem"
msgstr "Lös följande problem"

msgid "Given the vehicles:"
msgstr "Med tanke på fordonen:"

msgid "and the orders:"
msgstr "och order:"

msgid "The parameters are:"
msgstr "Parametrarna är:"

msgid "A `SELECT` statement that returns the following columns:"
msgstr "En `SELECT`-sats som returnerar följande kolumner:"

msgid "id, demand"
msgstr "id, efterfrågan"

msgid "p_node_id, p_open, p_close, [p_service,]"
msgstr "p_node_id, p_open, p_close, [p_service,]"

msgid "d_node_id, d_open, d_close, [d_service,]"
msgstr "d_node_id, d_open, d_close, [d_service,]"

msgid "id, capacity"
msgstr "id, kapacitet"

msgid "start_node_id, start_open, start_close [, start_service,]"
msgstr "start_node_id, start_open, start_close [, start_service,]"

msgid "[end_node_id, end_open, end_close, end_service]"
msgstr "[end_node_id, end_open, end_close, end_service]"

msgid "``pgr_pickDeliverEuclidean`` - Experimental"
msgstr "``pgr_pickDeliverEuclidean`` - Experimentell"

msgid "``pgr_pickDeliverEuclidean`` - Pickup and delivery Vehicle Routing Problem"
msgstr "``pgr_pickDeliverEuclidean`` - Problem med ruttplanering för hämtning och leverans av fordon"

msgid "Replaces ``pgr_gsoc_vrppdtw``"
msgstr "Ersätter ``pgr_gsoc_vrppdtw``"

msgid "Pickup and Delivery:"
msgstr "Upphämtning och leverans:"

msgid "capacitated"
msgstr "kapaciterad"

msgid "with time windows."
msgstr "med tidsfönster."

msgid "have (x, y) start and ending locations."
msgstr "har (x, y) start- och slutpositioner."

msgid "have a start and ending service times."
msgstr "har en start- och sluttid för tjänsten."

msgid "An order is for doing a pickup and a a deliver."
msgstr "En order är till för att göra en upphämtning och en leverans."

msgid "has (x, y) pickup and delivery locations."
msgstr "har (x, y) upphämtnings- och leveransplatser."

msgid "has opening and closing times for the pickup and delivery locations."
msgstr "har öppnings- och stängningstider för upphämtnings- och leveransplatserna."

msgid "has a pickup and deliver service times."
msgstr "har en upphämtning och leverera servicetider."

msgid "Six different optional different initial solutions"
msgstr "Sex olika valfria olika ursprungliga lösningar"

msgid "the best solution found will be result"
msgstr "den bästa lösningen som hittas blir resultatet"

msgid "pgr_pickDeliverEuclidean(`Orders SQL`_, `Vehicles SQL`_, [**options**])"
msgstr "pgr_pickDeliverEuclidean(`Orders SQL`_, `Fordon SQL`_, [**options**])"

msgid "p_x, p_y, p_open, p_close, [p_service,]"
msgstr "p_x, p_y, p_open, p_close, [p_service,]"

msgid "d_x, d_y, d_open, d_close, [d_service]"
msgstr "d_x, d_y, d_open, d_close, [d_service]"

msgid "start_x, start_y, start_open, start_close [, start_service, ]"
msgstr "start_x, start_y, start_open, start_close [, start_service, ]"

msgid "[ end_x, end_y, end_open, end_close, end_service ]"
msgstr "[ end_x, end_y, end_open, end_close, end_service ]"

msgid "This data example **lc101** is from data published at https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/"
msgstr "Detta dataexempel **lc101** är hämtat från data som publicerats på https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/"

msgid "There are 25 vehicles in the problem all with the same characteristics."
msgstr "Det finns 25 fordon i problemet som alla har samma egenskaper."

msgid "The original orders"
msgstr "De ursprungliga beställningarna"

msgid "The data comes in different rows for the pickup and the delivery of the same order."
msgstr "Uppgifterna kommer i olika rader för upphämtning och leverans av samma order."

msgid "The original data needs to be converted to an appropriate table:"
msgstr "Originaldata måste konverteras till en lämplig tabell:"

msgid "The query"
msgstr "Frågeställningen"

msgid "Showing only the relevant information to compare with the best solution information published on https://www.sintef.no/projectweb/top/pdptw/100-customers/"
msgstr "Visar endast relevant information för att jämföra med informationen om den bästa lösningen som publiceras på https://www.sintef.no/projectweb/top/pdptw/100-customers/"

msgid "The best solution found for **lc101** is a travel time: 828.94"
msgstr "Den bästa lösningen som hittades för **lc101** är en restid: 828.94"

msgid "This implementation's travel time: 854.54"
msgstr "Restid för detta genomförande: 854.54"

msgid "``pgr_prim``"
msgstr "``pgr_prim``"

msgid "``pgr_prim`` — Minimum spanning forest of a graph using Prim's algorithm."
msgstr "``pgr_prim`` - Skog med minsta spann i en graf med Prims algoritm."

msgid "This algorithm finds the minimum spanning forest in a possibly disconnected graph using Prim's algorithm."
msgstr "Denna algoritm hittar den minsta spännviddsskogen i en eventuellt frånkopplad graf med hjälp av Prims algoritm."

msgid "Prim's running time: :math:`O(E * log V)`"
msgstr "Prims körtid: :math:`O(E * log V)`"

msgid "pgr_prim(`Edges SQL`_)"
msgstr "pgr_prim(`Kanter SQL`_)"

msgid "Minimum spanning forest of a subgraph"
msgstr "Minsta skog som spänner över en delgraf"

msgid "`Boost: Prim's algorithm documentation <https://www.boost.org/libs/graph/doc/prim_minimum_spanning_tree.html>`__"
msgstr "`Boost: Dokumentation av Prims algoritm <https://www.boost.org/libs/graph/doc/prim_minimum_spanning_tree.html>`__"

msgid "``pgr_primBFS`` — Prim's algorithm for Minimum Spanning Tree with Depth First Search ordering."
msgstr "``pgr_primBFS`` - Prims algoritm för minsta spännviddsträd med djup först-sökordning."

msgid "Visits and extracts the nodes information in Breath First Search ordering of the Minimum Spanning Tree created using Prims's algorithm."
msgstr "Besöker och extraherar nodinformationen i Breath First Search-ordningen i det minsta spännviddsträdet som skapats med Prims algoritm."

msgid "pgr_primBFS(`Edges SQL`_, **root vid**, [``max_depth``])"
msgstr "pgr_primBFS(`Kanter SQL`_, **root vid**, [``max_depth``])"

msgid "pgr_primBFS(`Edges SQL`_, **root vids**, [``max_depth``])"
msgstr "pgr_primBFS(`Kanter SQL`_, **root vids**, [``max_depth``])"

msgid "``pgr_primDD`` — Catchament nodes using Prim's algorithm."
msgstr "``pgr_primDD`` - Fångar upp noder med Prims algoritm."

msgid "Using Prim's algorithm, extracts the nodes that have aggregate costs less than or equal to a distance from a root vertex (or vertices) within the calculated minimum spanning tree."
msgstr "Med hjälp av Prims algoritm, extrahera de noder som har aggregerade kostnader som är mindre än eller lika med ett avstånd från en rotvertex (eller vertex) inom det beräknade minsta spännträd."

msgid "pgr_primDD(`Edges SQL`_, **root vid**, **distance**)"
msgstr "pgr_primDD(`Kanter SQL`_, **root vid**, **distance**)"

msgid "pgr_primDD(`Edges SQL`_, **root vids**, **distance**)"
msgstr "pgr_primDD(`Kanter SQL`_, **root vids**, **distance**)"

msgid "``pgr_primDFS`` — Prim algorithm for Minimum Spanning Tree with Depth First Search ordering."
msgstr "``pgr_primDFS`` - Prim-algoritm för minsta spännviddsträd med djup först-sökordning."

msgid "Visits and extracts the nodes information in Depth First Search ordering of the Minimum Spanning Tree created using Prims's algorithm."
msgstr "Besöker och extraherar nodernas information i Depth First Search-ordningen för det minsta spännviddsträdet som skapats med Prims algoritm."

msgid "pgr_primDFS(`Edges SQL`_, **root vid**, [``max_depth``])"
msgstr "pgr_primDFS(`Kanter SQL`_, **root vid**, [``max_depth``])"

msgid "pgr_primDFS(`Edges SQL`_, **root vids**, [``max_depth``])"
msgstr "pgr_primDFS(`Kanter SQL`_, **root vids**, [``max_depth``])"

msgid "``pgr_pushRelabel``"
msgstr "``pgr_pushRelabel``"

msgid "``pgr_pushRelabel`` — Calculates the flow on the graph edges that maximizes the flow from the sources to the targets using Push Relabel Algorithm."
msgstr "``pgr_pushRelabel`` - Beräknar flödet på grafens kanter som maximerar flödet från källorna till målen med hjälp av Push Relabel-algoritmen."

msgid "pgr_pushRelabel(Combinations)"
msgstr "pgr_pushRelabel(Combinations)"

msgid "Renamed from ``pgr_maxFlowPushRelabel``"
msgstr "Borttagen från ``pgr_maxFlowPushRelabel``"

msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vid**)"
msgstr "pgr_pushRelabel(`Kanter SQL`_, **start vid**, **end vid**)"

msgid "pgr_pushRelabel(`Edges SQL`_, **start vid**, **end vids**)"
msgstr "pgr_pushRelabel(`Kanter SQL`_, **start vid**, **end vids**)"

msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vid**)"
msgstr "pgr_pushRelabel(`Kanter SQL`_, **start vids**, **end vid**)"

msgid "pgr_pushRelabel(`Edges SQL`_, **start vids**, **end vids**)"
msgstr "pgr_pushRelabel(`Kanter SQL`_, **start vids**, **end vids**)"

msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)"
msgstr "pgr_pushRelabel(`Kanter SQL`_, `Combinations SQL`_)"

msgid "``pgr_separateCrossing``"
msgstr "``pgr_separateCrossing``"

msgid "``pgr_separateCrossing`` - From crossing geometries generates geometries that do not cross."
msgstr "``pgr_separateCrossing`` - Från korsande geometrier genereras geometrier som inte korsar varandra."

msgid "Proposed function."
msgstr "Föreslagen funktion."

msgid "This is an auxiliary function for separating crossing edges."
msgstr "Detta är en hjälpfunktion för att separera korsande kanter."

msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])"
msgstr "pgr_separateCrossing(`Kanter SQL`_, [``tolerance``, ``dryrun``])"

msgid "RETURNS |result-separate|"
msgstr "RETURNS |result-separate|"

msgid "Get the segments of the crossing geometries"
msgstr "Hämta segmenten för korsningsgeometrierna"

msgid "``tolerance``"
msgstr "``tolerance``"

msgid "0.01"
msgstr "0.01"

msgid "Used in ST_Snap before ST_Split"
msgstr "Används i ST_Snap före ST_Split"

msgid "Get the code for further refinement."
msgstr "Hämta koden för ytterligare förfining."

msgid "When there are special details that need to be taken care of because of the final application or the quality of the data, the code can be obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag."
msgstr "När det finns speciella detaljer som måste tas om hand på grund av den slutliga applikationen eller datakvaliteten kan koden erhållas på en PostgreSQL ``NOTICE`` med hjälp av ``dryrun`` flaggan."

msgid "``pgr_separateTouching``"
msgstr "``pgr_separateTouching``"

msgid "``pgr_separateTouching`` - From touching geometries generates geometries that are properly connected at endpoints"
msgstr "``pgr_separateTouching`` - Från berörande geometrier genereras geometrier som är korrekt anslutna vid ändpunkterna"

msgid "This is an auxiliary function for processing geometries that touch but don't share exact endpoints, splitting them at their intersection points to improve network connectivity."
msgstr "Detta är en hjälpfunktion för bearbetning av geometrier som berör varandra men inte har exakta ändpunkter, och som delas upp vid sina skärningspunkter för att förbättra nätverksanslutningen."

msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])"
msgstr "pgr_separateTouching(`Kanter SQL`_, [``tolerance``, ``dryrun``])"

msgid "``pgr_sequentialVertexColoring`` - Proposed"
msgstr "```pgr_sequentialVertexColoring`` - Föreslagen"

msgid "``pgr_sequentialVertexColoring`` — Returns the vertex coloring of an undirected graph, using greedy approach."
msgstr "``pgr_sequentialVertexColoring`` - Returnerar vertexfärgningen av en odelad graf med hjälp av en girig metod."

msgid "Sequential vertex coloring algorithm is a graph coloring algorithm in which color identifiers are assigned to the vertices of a graph in a sequential manner, such that no edge connects two identically colored vertices."
msgstr "Sequential vertex coloring algorithm är en algoritm för färgläggning av grafer där färgidentifierare tilldelas topparna i en graf sekventiellt, så att ingen kant förbinder två identiskt färgade toppar."

msgid "The implementation is applicable only for **undirected** graphs."
msgstr "Implementeringen är endast tillämplig för **undirected** grafer."

msgid "Provides the color to be assigned to all the vertices present in the graph."
msgstr "Ger den färg som ska tilldelas alla hörn som finns i grafen."

msgid "Color identifiers values are in the Range :math:`[1, |V|]`"
msgstr "Värden för färgidentifierare ligger i intervallet :math:`[1, |V|]`"

msgid "The algorithm tries to assign the least possible color to every vertex."
msgstr "Algoritmen försöker tilldela minsta möjliga färg till varje toppunkt."

msgid "Efficient graph coloring is an NP-Hard problem, and therefore, this algorithm does not always produce optimal coloring. It follows a greedy strategy by iterating through all the vertices sequentially, and assigning the smallest possible color that is not used by its neighbors, to each vertex."
msgstr "Effektiv färgläggning av grafer är ett NP-hårt problem, och därför ger den här algoritmen inte alltid optimal färgläggning. Den följer en girig strategi genom att iterera genom alla toppar i följd och tilldela varje topp den minsta möjliga färg som inte används av dess grannar."

msgid "The returned rows are ordered in ascending order of the vertex value."
msgstr "De återlämnade raderna är ordnade i stigande ordning efter vertexvärdet."

msgid "Sequential Vertex Coloring Running Time: :math:`O(|V|*(d + k))`"
msgstr "Sekventiell vertexfärgning Körtid: :math:`O(|V|*(d + k))`"

msgid ":math:`d` is the maximum degree of the vertices in the graph,"
msgstr ":math:`d` is the maximum degree of the vertices in the graph,"

msgid ":math:`k` is the number of colors used."
msgstr ":math:`k` is the number of colors used."

msgid "pgr_sequentialVertexColoring(`Edges SQL`_)"
msgstr "pgr_sequentialVertexColoring(`Kanter SQL`_)"

msgid "`Boost: Sequential Vertex Coloring <https://www.boost.org/libs/graph/doc/sequential_vertex_coloring.html>`__"
msgstr "`Boost: Sekventiell färgläggning av toppar <https://www.boost.org/libs/graph/doc/sequential_vertex_coloring.html>`__"

msgid "``pgr_sloanOrdering`` - Experimental"
msgstr "``pgr_sloanOrdering`` - Experimentell"

msgid "``pgr_sloanOrdering`` — Returns the Sloan ordering of an undirected graph"
msgstr "``pgr_sloanOrdering`` - Returnerar Sloan-ordningen för en odränerad graf"

msgid "The Sloan ordering algorithm reorders the vertices of a graph to reduce bandwidth, profile, and wavefront properties, which is particularly useful for sparse matrix computations and finite element analysis."
msgstr "Sloans ordningsalgoritm ordnar om topparna i en graf för att minska bandbredd, profil och vågfrontsegenskaper, vilket är särskilt användbart för glesa matrisberäkningar och finita elementanalyser."

msgid "Finds a pseudoperipheral vertex pair to determine good starting points"
msgstr "Hittar ett pseudoperifert toppunktspar för att bestämma bra startpunkter"

msgid "Uses a priority-based algorithm that balances vertex degree and distance from the start vertex."
msgstr "Använder en prioritetsbaserad algoritm som balanserar vertexgrad och avstånd från startvertexet."

msgid "Aims to minimize bandwidth (maximum difference between connected vertex indices."
msgstr "Syftar till att minimera bandbredden (maximal skillnad mellan index för anslutna vertex)."

msgid "Typically produces better orderings than simple breadth-first approaches."
msgstr "Ger vanligtvis bättre ordningar än enkla bredd-först-metoder."

msgid "Time complexity: :math:`O(V² + E)` where V is the number of vertices and E is the number of edges."
msgstr "Tidskomplexitet: :math:`O(V² + E)` där V är antalet toppar och E är antalet kanter."

msgid "pgr_sloanOrdering(`Edges SQL`_)"
msgstr "pgr_sloanOrdering(`Edges SQL`_)"

msgid ":Example : Sloan ordering without specifying start vertex"
msgstr ":Exempel : Sloan-order utan att ange startpunkt"

msgid "New sloan ordering order."
msgstr "Ny beställning av Sloan."

msgid "Sloan ordering of Original graph from Boost example (vertices 0-9)."
msgstr "Sloan-ordning av originalgrafen från Boost-exemplet (toppar 0-9)."

msgid "`Boost: Sloan Ordering <https://www.boost.org/doc/libs/latest/libs/graph/doc/sloan_ordering.htm>`__"
msgstr "`Boost: Sloan Beställning <https://www.boost.org/doc/libs/latest/libs/graph/doc/sloan_ordering.htm>`__"

msgid "``pgr_stoerWagner`` - Experimental"
msgstr "``pgr_stoerWagner`` - Experimentell"

msgid "``pgr_stoerWagner`` — The min-cut of graph using stoerWagner algorithm."
msgstr "``pgr_stoerWagner`` - Min-cut av grafen med stoerWagner-algoritmen."

msgid "Version 3.0"
msgstr "Version 3.0"

msgid "In graph theory, the Stoer–Wagner algorithm is a recursive algorithm to solve the minimum cut problem in undirected weighted graphs with non-negative weights. The essential idea of this algorithm is to shrink the graph by merging the most intensive vertices, until the graph only contains two combined vertex sets. At each phase, the algorithm finds the minimum s-t cut for two vertices s and t chosen as its will. Then the algorithm shrinks the edge between s and t to search for non s-t cuts. The minimum cut found in all phases will be the minimum weighted cut of the graph."
msgstr "Inom grafteorin är Stoer-Wagner-algoritmen en rekursiv algoritm för att lösa problemet med minsta snitt i ovägda viktade grafer med icke-negativa vikter. Den grundläggande idén med denna algoritm är att krympa grafen genom att slå samman de mest intensiva topparna, tills grafen bara innehåller två kombinerade toppuppsättningar. I varje fas hittar algoritmen det minsta s-t-snittet för två toppar s och t som valts som dess vilja. Därefter krymper algoritmen kanten mellan s och t för att söka efter andra snitt än s-t-snitt. Det minsta snitt som hittas i alla faser kommer att vara det minsta viktade snittet i grafen."

msgid "A cut is a partition of the vertices of a graph into two disjoint subsets. A minimum cut is a cut for which the size or weight of the cut is not larger than the size of any other cut. For an unweighted graph, the minimum cut would simply be the cut with the least edges. For a weighted graph, the sum of all edges' weight on the cut determines whether it is a minimum cut."
msgstr "Ett snitt är en uppdelning av hörnen i en graf i två disjunkta delmängder. En minsta skärning är en skärning där skärningens storlek eller vikt inte är större än storleken på någon annan skärning. För en oviktad graf skulle det minsta snittet helt enkelt vara det snitt som har minst kanter. För en viktad graf är det summan av alla kanters vikt på snittet som avgör om det är ett minimisnitt."

msgid "Sum of the weights of all edges between the two sets is mincut."
msgstr "Summan av vikterna för alla kanter mellan de två uppsättningarna är mincut."

msgid "A **mincut** is a cut having the least weight."
msgstr "Ett **mincut** är ett snitt som har minst vikt."

msgid "Values are returned when graph is connected."
msgstr "Värdena returneras när grafen är ansluten."

msgid "When there is no edge in graph then EMPTY SET is return."
msgstr "När det inte finns någon kant i grafen returneras EMPTY SET."

msgid "When the graph is unconnected then EMPTY SET is return."
msgstr "När grafen inte är sammankopplad returneras EMPTY SET."

msgid "Sometimes a graph has multiple min-cuts, but all have the same weight. The this function determines exactly one of the min-cuts as well as its weight."
msgstr "Ibland har en graf flera min-cuts, men alla har samma vikt. Den här funktionen bestämmer exakt en av min-cuts samt dess vikt."

msgid "Running time: :math:`O(V*E + V^2*log V)`."
msgstr "Drifttid: :math:`O(V*E + V^2*log V)`."

msgid "pgr_stoerWagner(`Edges SQL`_)"
msgstr "pgr_stoerWagner(`Kanter SQL`_)"

msgid "Returns set of |result-mincut|"
msgstr "Returnerar uppsättning av |result-mincut|"

msgid "min cut of the main subgraph"
msgstr "min-klippning av huvudundergrafen"

msgid "Returns set of ``(seq, edge, cost, mincut)``"
msgstr "Returnerar uppsättning av ``(seq, edge, cost, mincut)``"

msgid "Edges which divides the set of vertices into two."
msgstr "Kanter som delar upp uppsättningen av hörn i två."

msgid "Cost to traverse of edge."
msgstr "Kostnad för att korsa kanten."

msgid "**mincut**"
msgstr "**mincut**"

msgid "Min-cut weight of a undirected graph."
msgstr "Min-cut-vikt för en odränerad graf."

msgid "Additional Example:"
msgstr "Ytterligare exempel:"

msgid "min cut of an edge"
msgstr "minutskärning av en kant"

msgid "Using :doc:`pgr_connectedComponents`"
msgstr "Använda :doc:`pgr_connectedComponents`"

msgid "`Boost: Stoer Wagner min cut <https://www.boost.org/libs/graph/doc/stoer_wagner_min_cut.html>`__"
msgstr "`Boost: Stoer Wagner min cut <https://www.boost.org/libs/graph/doc/stoer_wagner_min_cut.html>`__"

msgid "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm"
msgstr "https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm"

msgid "``pgr_strongComponents``"
msgstr "``pgr_strongComponents``"

msgid "``pgr_strongComponents`` — Strongly connected components of a directed graph using Tarjan's algorithm based on DFS."
msgstr "``pgr_strongComponents`` - Starkt förbundna komponenter i en riktad graf med hjälp av Tarjans algoritm baserad på DFS."

msgid "A strongly connected component of a directed graph is a set of vertices that are all reachable from each other."
msgstr "En starkt sammanhängande komponent i en riktad graf är en uppsättning hörn som alla är nåbara från varandra."

msgid "Works for **directed** graphs."
msgstr "Fungerar för **riktade** grafer."

msgid "Components are described by vertices identifiers."
msgstr "Komponenterna beskrivs med hjälp av identifierare för vertikalerna."

msgid "pgr_strongComponents(`Edges SQL`_)"
msgstr "pgr_strongComponents(`Kanter SQL`_)"

msgid "The strong components of the graph"
msgstr "De starka komponenterna i grafen"

msgid "`Boost: Strong components <https://www.boost.org/libs/graph/doc/strong_components.html>`__"
msgstr "`Boost: Starka komponenter <https://www.boost.org/libs/graph/doc/strong_components.html>`__"

msgid "wikipedia: `Strongly connected component <https://en.wikipedia.org/wiki/Strongly_connected_component>`__"
msgstr "wikipedia: `Starkt ansluten komponent <https://en.wikipedia.org/wiki/Strongly_connected_component>`__"

msgid "``pgr_topologicalSort`` - Experimental"
msgstr "``pgr_topologicalSort`` - Experimentell"

msgid "``pgr_topologicalSort`` — Linear ordering of the vertices for directed acyclic graphs (DAG)."
msgstr "``pgr_topologicalSort`` - Linjär ordning av topparna för riktade acykliska grafer (DAG)."

msgid "The topological sort algorithm creates a linear ordering of the vertices such that if edge :math:`(u,v)` appears in the graph, then :math:`v` comes before :math:`u` in the ordering."
msgstr "Den topologiska sorteringsalgoritmen skapar en linjär ordning av hörnen så att om kanten :math:`(u,v)` förekommer i grafen, så kommer :math:`v` före :math:`u` i ordningen."

msgid "Process is valid for directed acyclic graphs only. otherwise it will throw warnings."
msgstr "Processen är endast giltig för riktade acykliska grafer. annars kommer den att ge varningar."

msgid "For optimization purposes, if there are more than one answer, the function"
msgstr "För optimeringsändamål, om det finns mer än ett svar, kan funktionen"

msgid "will return one of them."
msgstr "kommer att returnera en av dem."

msgid "The returned values are ordered in topological order:"
msgstr "De returnerade värdena är ordnade i topologisk ordning:"

msgid "pgr_topologicalSort(`Edges SQL`_)"
msgstr "pgr_topologicalSort(`Kanter SQL`_)"

msgid "Topologically sorting the graph"
msgstr "Topologisk sortering av grafen"

msgid "Sequential value starting from :math:`1`"
msgstr "Sekventiellt värde med början från :math:`1`"

msgid "Linear topological ordering of the vertices"
msgstr "Linjär topologisk ordning av hörnen"

msgid "Additional examples"
msgstr "Ytterligare exempel"

msgid "Topologically sorting the one way segments"
msgstr "Topologisk sortering av enkelriktade segment"

msgid "Graph is not a DAG"
msgstr "Grafen är inte en DAG"

msgid "`Boost: topological sort <https://www.boost.org/libs/graph/doc/topological_sort.html>`__"
msgstr "`Boost: topologisk sortering <https://www.boost.org/libs/graph/doc/topological_sort.html>`__"

msgid "``pgr_transitiveClosure`` - Experimental"
msgstr "``pgr_transitiveClosure`` - Experimentell"

msgid "``pgr_transitiveClosure`` — Transitive closure graph of a directed graph."
msgstr "``pgr_transitiveClosure`` - Transitiv stängningsgraf för en riktad graf."

msgid "Transforms the input directed graph into the transitive closure of the graph."
msgstr "Transformerar den inmatade riktade grafen till grafens transitiva slutenhet."

msgid "Process is valid for directed graphs."
msgstr "Processen är giltig för riktade grafer."

msgid "The transitive closure of an undirected graph produces a cluster graph"
msgstr "Den transitiva stängningen av en odelad graf ger en klustergraf"

msgid "Reachability between vertices on an undirected graph happens when they belong to the same connected component. (see :doc:`pgr_connectedComponents`)"
msgstr "Nåbarhet mellan hörn i en odelad graf uppstår när de tillhör samma sammankopplade komponent. (se :doc:`pgr_connectedComponents`)"

msgid "The returned values are not ordered"
msgstr "De returnerade värdena är inte ordnade"

msgid "The returned graph is compressed"
msgstr "Den returnerade grafen är komprimerad"

msgid "Running time: :math:`O(|V||E|)`"
msgstr "Speltid: :math:`O(|V||E|)`"

msgid "The pgr_transitiveClosure function has the following signature:"
msgstr "Funktionen pgr_transitiveClosure har följande signatur:"

msgid "pgr_transitiveClosure(`Edges SQL`_)"
msgstr "pgr_transitiveClosure(`Kanter SQL`_)"

msgid "Returns set of |result-closure|"
msgstr "Returnerar uppsättning av |result-closure|"

msgid "Rechability of a subgraph"
msgstr "Rechability av en delgraf"

msgid "Identifier of the source of the edges"
msgstr "Identifierare av källan till kanterna"

msgid "``target_array``"
msgstr "``target_array``"

msgid "Identifiers of the targets of the edges"
msgstr "Identifierare av målen för kanterna"

msgid "Identifiers of the vertices that are reachable from vertex v."
msgstr "Identifierare för de toppar som är nåbara från topp v."

msgid "`Boost: transitive closure <https://www.boost.org/libs/graph/doc/transitive_closure.html>`__"
msgstr "`Boost: transitiv stängning <https://www.boost.org/libs/graph/doc/transitive_closure.html>`__"

msgid "https://en.wikipedia.org/wiki/Transitive_closure"
msgstr "https://en.wikipedia.org/wiki/Transitive_closure"

msgid "``pgr_trsp``"
msgstr "``pgr_trsp``"

msgid "``pgr_trsp`` - routing vertices with restrictions."
msgstr "``pgr_trsp`` - routing av toppar med restriktioner."

msgid "pgr_trsp(One to One)"
msgstr "pgr_trsp(One to One)"

msgid "pgr_trsp(One to Many)"
msgstr "pgr_trsp(One to Many)"

msgid "pgr_trsp(Many to One)"
msgstr "pgr_trsp(Many to One)"

msgid "pgr_trsp(Many to Many)"
msgstr "pgr_trsp(Many to Many)"

msgid "pgr_trsp(Combinations)"
msgstr "pgr_trsp(Combinations)"

msgid "Deprecated signatures"
msgstr "Föråldrade signaturer"

msgid "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)"
msgstr "pgr_trspViaVertices(text,anyarray,boolean,boolean,text)"

msgid "New prototypes"
msgstr "Nya prototyper"

msgid "pgr_trspViaVertices"
msgstr "pgr_trspViaVertices"

msgid "pgr_trspViaEdges"
msgstr "pgr_trspViaEdges"

msgid "Turn restricted shortest path (TRSP) is an algorithm that receives turn restrictions in form of a query like those found in real world navigable road networks."
msgstr "Turn restricted shortest path (TRSP) är en algoritm som tar emot svängrestriktioner i form av en fråga, liknande de som finns i verkliga vägnät."

msgid "It does no guarantee the shortest path as it might contain restriction paths."
msgstr "Den garanterar inte den kortaste vägen eftersom den kan innehålla begränsande vägar."

msgid "The general algorithm is as follows:"
msgstr "Den allmänna algoritmen är som följer:"

msgid "Execute a Dijkstra."
msgstr "Utför en Dijkstra."

msgid "If the solution passes thru a restriction then."
msgstr "Om lösningen passerar genom en begränsning då."

msgid "Execute the **TRSP** algorithm with restrictions."
msgstr "Utför **TRSP**-algoritmen med begränsningar."

msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, [``directed``])"
msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **slut vid**, [``directed``])"

msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vids**, [``directed``])"
msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **slut vids**, [``directed``])"

msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vid**, [``directed``])"
msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **slut vid**, [``directed``])"

msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **end vids**, [``directed``])"
msgstr "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, **start vids**, **slut vids**, [``directed``])"

msgid "pgr_trsp(`Edges SQL`_, `Restrictions SQL`_, `Combinations SQL`_, [``directed``])"
msgstr "pgr_trsp(`Edges SQL`_, `Restriktioner SQL`_, `Kombinationer SQL`_, [``directed``])"

msgid "From vertex :math:`6` to vertex :math:`10` on an undirected graph."
msgstr "Från toppunkt :math:`6` till toppunkt :math:`10` i en odelad graf."

msgid "From vertex :math:`6` to vertices :math:`\\{10, 1\\}` on an undirected graph."
msgstr "Från toppunkten :math:`6` till toppunkterna :math:`\\{10, 1\\}` i en odelad graf."

msgid "From vertices :math:`\\{6, 1\\}` to vertex :math:`8` on a directed graph."
msgstr "Från topparna :math:`\\{6, 1\\}` till topparna :math:`8` i en riktad graf."

msgid "From vertices :math:`\\{6, 1\\}` to vertices :math:`\\{10, 8\\}` on an undirected graph."
msgstr "Från hörn :math:`\\{6, 1\\}` till hörn :math:`\\{10, 8\\}` i en odelad graf."

msgid "Using a combinations table on an undirected graph."
msgstr "Använda en kombinationstabell på en ostyrd graf."

msgid "`Deprecated documentation <https://docs.pgrouting.org/3.3/en/pgr_trsp.html>`_"
msgstr "föråldrad dokumentation <https://docs.pgrouting.org/3.3/en/pgr_trsp.html>`_"

msgid "``pgr_trspVia``"
msgstr "``pgr_trspVia``"

msgid "``pgr_trspVia`` Route that goes through a list of vertices with restrictions."
msgstr "``pgr_trspVia`` Rutt som går igenom en lista med toppar med restriktioner."

msgid "Given a list of vertices and a graph, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths."
msgstr "Givet en lista med toppar och en graf är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` för alla :math:`i < size\\_of(via\\;toppar)` och försöker att inte använda begränsade vägar."

msgid "The paths represents the sections of the route."
msgstr "Banorna representerar de olika delarna av rutten."

msgid "Execute a :doc:`pgr_dijkstraVia`."
msgstr "Exekvera en :doc:`pgr_dijkstraVia`."

msgid "For the set of sub paths of the solution that pass through a restriction then"
msgstr "För uppsättningen delvägar för lösningen som passerar genom en begränsning gäller följande"

msgid "Execute the **TRSP** algorithm with restrictions for the paths."
msgstr "Utför **TRSP**-algoritmen med begränsningar för banorna."

msgid "**NOTE** when this is done, ``U_turn_on_edge`` flag is ignored."
msgstr "**OBSERVERA** när detta görs ignoreras flaggan ``U_turn_on_edge``."

msgid "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])"
msgstr "pgr_trspVia(`Edges SQL`_, `Restrictions SQL`_, **via vertices**, [**options**])"

msgid "All this examples are about the route that visits the vertices :math:`\\{5, 7, 1, 8, 15\\}` in that order on a directed graph."
msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{5, 7, 1, 8, 15\\}` i den ordningen i en riktad graf."

msgid "Simulation of how algorithm works."
msgstr "Simulering av hur algoritmen fungerar."

msgid "The algorithm performs a :doc:`pgr_dijkstraVia`"
msgstr "Algoritmen utför en :doc:`pgr_dijkstraVia`"

msgid "Detects which of the sub paths pass through a restriction in this case is for the ``path_id = 5`` from ``6`` to ``3`` because the path :math:`15 \\rightarrow 1` is restricted."
msgstr "Detekterar vilka av undervägarna som passerar genom en begränsning i det här fallet är för ``väg_id = 5`` från ``6`` till ``3`` eftersom vägen :math:`15 \\rightarrow 1` är begränsad."

msgid "Executes the :doc:`pgr_trsp` algorithm for the conflicting paths."
msgstr "Exekverar :doc:`pgr_trsp` -algoritmen för de motstridiga vägarna."

msgid "From the :doc:`pgr_dijkstraVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:"
msgstr "Från :doc:`pgr_dijkstraVia`-resultatet tar den bort de motstridiga vägarna och bygger lösningen med resultaten från :doc:`pgr_trsp`-algoritmen:"

msgid "Getting the same result as ``pgr_trspVia``:"
msgstr "Får samma resultat som ``pgr_trspVia``:"

msgid "Example 8"
msgstr "Exempel 8"

msgid "Sometimes ``U_turn_on_edge`` flag is ignored when is set to ``false``."
msgstr "Ibland ignoreras flaggan ``U_turn_on_edge`` när den är satt till ``false``."

msgid "The first step, doing a :doc:`pgr_dijkstraVia` does consider not making a U turn on the same edge. But the path :math:`16 \\rightarrow 13` (Rows 4 and 5) is restricted and the result is using it."
msgstr "Det första steget, att göra en :doc:`pgr_dijkstraVia` tar hänsyn till att inte göra en U-sväng på samma kant. Men sökvägen :math:`16 \\rightarrow 13` (rad 4 och 5) är begränsad och resultatet använder den."

msgid "When executing the :doc:`pgr_trsp` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag."
msgstr "När :doc:`pgr_trsp`-algoritmen körs för den konfliktfyllda banan finns det ingen flagga för ``U_turn_on_edge``."

msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``."
msgstr "Därför ignorerar resultatet flaggan ``U_turn_on_edge`` när den är inställd på ``false``."

msgid ":doc:`via-category`"
msgstr ":doc:`via-category`"

msgid "``pgr_trspVia_withPoints``"
msgstr "``pgr_trspVia_withPoints``"

msgid "``pgr_trspVia_withPoints`` - Route that goes through a list of vertices and/or points with restrictions."
msgstr "``pgr_trspVia_withPoints`` - Rutt som går igenom en lista med toppar och/eller punkter med restriktioner."

msgid "Given a graph, a set of restriction on the graph edges, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)` trying not to use restricted paths."
msgstr "Med tanke på en graf, en uppsättning begränsningar på grafens kanter, en uppsättning punkter på grafens kanter och en lista med vertexer, är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` (där :math:`vertex` kan vara en vertex eller en punkt i grafen) för alla :math:`i < size\\_of(via\\;vertices)` och försöker att inte använda begränsade vägar."

msgid "is a sequence of paths"
msgstr "är en sekvens av banor"

msgid "Build the Graph with the new points."
msgstr "Bygg grafen med de nya punkterna."

msgid "The points identifiers will be converted to negative values."
msgstr "Punkternas identifierare kommer att omvandlas till negativa värden."

msgid "The vertices identifiers will remain positive."
msgstr "Topparnas identifierare kommer att förbli positiva."

msgid "Execute a :doc:`pgr_withPointsVia`."
msgstr "Exekvera en :doc:`pgr_withPointsVia`."

msgid "For the set of paths of the solution that pass through a restriction then"
msgstr "För uppsättningen av vägar för lösningen som passerar genom en restriktion gäller följande"

msgid "Execute the **TRSP** algorithm with restrictions for the path."
msgstr "Utför **TRSP**-algoritmen med begränsningar för banan."

msgid "Do not use negative values on identifiers of the inner queries."
msgstr "Använd inte negativa värden på identifierare för de inre frågorna."

msgid "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])"
msgstr "pgr_trspVia_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, [**driving side**,] [**options**])"

msgid "**options:** ``[directed, strict, U_turn_on_edge, details]``"
msgstr "**options:** ``[directed, strict, U_turn_on_edge, details]``"

msgid "Find the route that visits the vertices :math:`\\{-6, 15, -5\\}` in that order on an directed graph."
msgstr "Hitta den rutt som besöker topparna :math:`\\{-6, 15, -5\\\\}` i den ordningen i en riktad graf."

msgid "When positive it is considered a vertex identifier"
msgstr "När den är positiv betraktas den som en vertexidentifierare"

msgid "When negative it is considered a point identifier"
msgstr "När den är negativ betraktas den som en punktidentifierare"

msgid "[**driving side**]"
msgstr "[**driving side**]"

msgid "Value in [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] indicating if the driving side is:"
msgstr "Värde i [``r``, ``R``, ``l``, ``L``, ``b``, ``B``] som anger om förarsidan är:"

msgid "For directed graph:"
msgstr "För riktad graf:"

msgid "[``r``, ``R``] for right driving side"
msgstr "[``r``, ``R``] för höger körsida"

msgid "[``l``, ``L``] for left driving side"
msgstr "[``l``, ``L``] för vänster körsida"

msgid "For undirected graph:"
msgstr "För odelad graf:"

msgid "[``b``, ``B``] for both driving sides"
msgstr "[``b``, ``B``] för båda körsidorna"

msgid "Default values when parameter is missing:"
msgstr "Standardvärden när parameter saknas:"

msgid "[``r``, ``R``] for directed graph"
msgstr "[``r``, ``R``] för riktad graf"

msgid "[``l``, ``L``] for undirected graph"
msgstr "[``l``, ``L``] för odelad graf"

msgid "With points optional parameters"
msgstr "Med punkter valfria parametrar"

msgid "``details``"
msgstr "``details``"

msgid "For showing points stops."
msgstr "För att visa punkter stoppar."

msgid "When ``true`` the results will include the points that are in the path."
msgstr "När ``true`` visas kommer resultaten att inkludera de punkter som ligger i banan."

msgid "When ``false`` the results will not include the points that are in the path."
msgstr "När ``false`` visas kommer resultaten inte att omfatta de punkter som ligger i banan."

msgid "When ``start_vid``, ``end_vid`` and ``node`` columns have negative values, the identifier is for a Point."
msgstr "När kolumnerna ``start_vid``, ``end_vid`` och ``node`` har negativa värden är identifieraren för en Point."

msgid "Use ``pgr_findCloseEdges`` for points on the fly"
msgstr "Använd ``pgr_findCloseEdges`` för punkter i farten"

msgid "Using :doc:`pgr_findCloseEdges`:"
msgstr "Använder :doc:`pgr_findCloseEdges`:"

msgid "Visit from vertex :math:`1` to the two locations on the graph of point `(2.9, 1.8)` in order of closeness to the graph."
msgstr "Besök från toppunkten :math:`1` till de två platserna på grafen för punkten `(2,9, 1,8)` i ordning efter närhet till grafen."

msgid "Point :math:`-1` corresponds to the closest edge from point `(2.9, 1.8)`."
msgstr "Punkten :math:`-1` motsvarar den närmaste kanten från punkten `(2,9, 1,8)`."

msgid "Point :math:`-2` corresponds to the next close edge from point `(2.9, 1.8)`."
msgstr "Punkten :math:`-2` motsvarar nästa nära kant från punkten `(2,9, 1,8)`."

msgid "Point :math:`-2` is visited on the route to from vertex :math:`1` to Point :math:`-1` (See row where :math:`seq = 4`)."
msgstr "Punkt :math:`-2` besöks på rutten till från toppunkt :math:`1` till punkt :math:`-1` (Se rad där :math:`seq = 4`)."

msgid "Usage variations"
msgstr "Variationer i användning"

msgid "All this examples are about the route that visits the vertices :math:`\\{-6, 7, -4, 8, -2\\}` in that order on a directed graph."
msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{-6, 7, -4, 8, -2\\\\}` i den ordningen i en riktad graf."

msgid "Status of \"passes in front\" or \"visits\" of the nodes and points."
msgstr "Status för \"passeringar framför\" eller \"besök\" av noder och punkter."

msgid "The algorithm performs a :doc:`pgr_withPointsVia`"
msgstr "Algoritmen utför en :doc:`pgr_withPointsVia`"

msgid "Detects which of the paths pass through a restriction in this case is for the ``path_id = 1`` from ``-6`` to ``15`` because the path :math:`9 \\rightarrow 16` is restricted."
msgstr "Detekterar vilka av sökvägarna som passerar genom en begränsning i detta fall är för ``path_id = 1`` från ``-6`` till ``15`` eftersom sökvägen :math:`9 \\rightarrow 16` är begränsad."

msgid "Executes the :ref:`TRSP-family:TRSP algorithm` for the conflicting paths."
msgstr "Exekverar :ref:`TRSP-family:TRSP algorithm` för de motstridiga sökvägarna."

msgid "From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm:"
msgstr "Från resultatet av :doc:`pgr_withPointsVia` tar den bort de motstridiga vägarna och bygger lösningen med resultaten av algoritmen :doc:`pgr_trsp`:"

msgid "Getting the same result as ``pgr_trspVia_withPoints``:"
msgstr "Får samma resultat som ``pgr_trspVia_withPoints``:"

msgid "The first step, doing a :doc:`pgr_withPointsVia` does consider not making a U turn on the same edge. But the path :math:`9 \\rightarrow 16` (Rows 4 and 5) is restricted and the result is using it."
msgstr "Det första steget, att göra en :doc:`pgr_withPointsVia` tar hänsyn till att inte göra en U-sväng på samma kant. Men banan :math:`9 \\rightarrow 16` (rad 4 och 5) är begränsad och resultatet är att använda den."

msgid "When executing the :doc:`pgr_trsp_withPoints` algorithm for the conflicting path, there is no ``U_turn_on_edge`` flag."
msgstr "När algoritmen :doc:`pgr_trsp_withPoints` exekveras för den konfliktfyllda banan finns det ingen flagga ``U_turn_on_edge``."

msgid "Therefore the result ignores the ``U_turn_on_edge`` flag when set to ``false``. From the :doc:`pgr_withPointsVia` result it removes the conflicting paths and builds the solution with the results of the :doc:`pgr_trsp` algorithm. In this case a U turn is been done using the same edge."
msgstr "Därför ignorerar resultatet flaggan ``U_turn_on_edge`` när den är inställd på ``false``. Från :doc:`pgr_withPointsVia`-resultatet tar den bort de motstridiga vägarna och bygger lösningen med resultaten från :doc:`pgr_trsp`-algoritmen. I det här fallet har en U-sväng gjorts med samma kant."

msgid "``pgr_trsp_withPoints``"
msgstr "``pgr_trsp_withPoints``"

msgid "``pgr_trsp_withPoints`` Routing Vertex/Point with restrictions."
msgstr "``pgr_trsp_withPoints`` Routing Vertex/Point med restriktioner."

msgid "Modify the graph to include points defined by `Points SQL`_. Consider the invalid paths on `Restrictions SQL`_. Using Dijkstra algorithm, find the shortest path."
msgstr "Modifiera grafen så att den innehåller punkter definierade av `Points SQL`_. Beakta de ogiltiga vägarna i `Restrictions SQL`_. Använd Dijkstra-algoritmen för att hitta den kortaste vägen."

msgid "Vertices of the graph are:"
msgstr "Grafens hörn är:"

msgid "**positive** when it belongs to the `Edges SQL`_"
msgstr "**positiv** när den tillhör `Kanter SQL`_"

msgid "**negative** when it belongs to the `Points SQL`_"
msgstr "**negativ** när den tillhör `Points SQL`_"

msgid "The `agg_cost` in the non included values `(v, v)` is `0`"
msgstr "`Agg_cost` i de icke inkluderade värdena \"v, v\" är \"0\""

msgid "The `agg_cost` in the non included values `(u, v)` is :math:`\\infty`"
msgstr "Agg_cost i de icke inkluderade värdena `(u, v)` är :math:`\\infty`"

msgid "For optimization purposes, any duplicated value in the input arrays of **start vids** or **end vids** or are ignored."
msgstr "För optimeringsändamål ignoreras alla duplicerade värden i inmatningsmatriserna för **start vids** eller **end vids** eller."

msgid "Running time: :math:`O(|start\\_vids|\\times(V \\log V + E))`"
msgstr "Drifttid: :math:`O(|start\\_vids|\\times(V \\log V + E))`"

msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**,] [**options**])"
msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **slut vid**, [**driving side**,] [**options**])"

msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**,] [**options**])"
msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**,] [**options**])"

msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**,] [**options**])"
msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **slut vid**, [**driving side**,] [**options**])"

msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**,] [**options**])"
msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**,] [**options**])"

msgid "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])"
msgstr "pgr_trsp_withPoints(`Edges SQL`_, `Restrictions SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**,] [**options**])"

msgid "**options:** ``[directed, details]``"
msgstr "**options:** ``[directed, details]``"

msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (with details)"
msgstr "Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad graf. (med detaljer)"

msgid "From point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph"
msgstr "Från punkt :math:`1` till punkt :math:`3` och toppunkt :math:`7` på en odelad graf"

msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph. (without details)"
msgstr "Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` med höger drivsida i riktad graf. (utan detaljer)"

msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` with left side driving."
msgstr "Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` och toppunkt :math:`1` med körning på vänster sida."

msgid "Two combinations"
msgstr "Två kombinationer"

msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving. (with details)"
msgstr "Från punkt :math:`1` till toppunkt :math:`10`, och från toppunkt :math:`6` till punkt :math:`3` med högerkörning. (med detaljer)"

msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_."
msgstr "Använd :doc:`pgr_findCloseEdges` i `Points SQL`_."

msgid "Find the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`."
msgstr "Hitta vägarna från toppunkten :math:`1` till de två närmaste platserna på grafen för punkten `(2,9, 1,8)`."

msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}` with restrictions"
msgstr "Alla exempel handlar om att resa från punkt :math:`1` och toppunkt :math:`5` till punkter :math:`\\{2, 3, 6\\}` och toppunkter :math:`\\{10, 11\\}` med restriktioner"

msgid "Passes in front or visits with right side driving."
msgstr "Passerar framför eller besöker med högerkörning."

msgid "For point :math:`6` and vertex :math:`11`."
msgstr "För punkt :math:`6` och toppunkt :math:`11`."

msgid "Passes in front or visits with left side driving."
msgstr "Passerar framför eller besöker med vänsterkörning."

msgid "``pgr_turnRestrictedPath`` - Experimental"
msgstr "``pgr_turnRestrictedPath`` - Experimentell"

msgid "``pgr_turnRestrictedPath`` Using Yen's algorithm Vertex - Vertex routing with restrictions"
msgstr "``pgr_turnRestrictedPath`` Använd Yen's algoritm Vertex - Vertex routing med restriktioner"

msgid "Using Yen's algorithm to obtain K shortest paths and analyze the paths to select the paths that do not use the restrictions"
msgstr "Använd Yen's algoritm för att få K kortaste vägar och analysera vägarna för att välja de vägar som inte använder begränsningarna"

msgid "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **end vid**, **K**, [**options**])"
msgstr "pgr_turnRestrictedPath(`Edges SQL`_, `Restrictions SQL`_, **start vid**, **slut vid**, **K**, [**options**])"

msgid "**options:** ``[directed, heap_paths, stop_on_first, strict]``"
msgstr "**options:** ``[directed, heap_paths, stop_on_first, strict]``"

msgid "From vertex :math:`3` to vertex :math:`8` on a directed graph"
msgstr "Från toppunkt :math:`3` till toppunkt :math:`8` på en riktad graf"

msgid "Special optional parameters"
msgstr "Särskilda valfria parametrar"

msgid "``stop_on_first``"
msgstr "``stop_on_first``"

msgid "When ``true`` stops on first path found that dos not violate restrictions"
msgstr "När ``true`` stannar på första bästa väg som inte bryter mot restriktioner"

msgid "When ``false`` returns at most K paths"
msgstr "När ``false`` returnerar högst K sökvägar"

msgid "When ``true`` returns only paths that do not violate restrictions"
msgstr "När ``true`` returnerar endast sökvägar som inte bryter mot begränsningar"

msgid "When ``false`` returns the paths found"
msgstr "När ``false`` returneras de hittade sökvägarna"

msgid "From vertex :math:`3` to :math:`8` with ``strict`` flag on."
msgstr "Från toppunkt :math:`3` till :math:`8` med flaggan ``strict`` på."

msgid "No results because the only path available follows a restriction."
msgstr "Inga resultat eftersom den enda tillgängliga vägen följer en begränsning."

msgid "From vertex :math:`3` to vertex :math:`8` on an undirected graph"
msgstr "Från toppunkt :math:`3` till toppunkt :math:`8` i en odelad graf"

msgid "From vertex :math:`3` to vertex :math:`8` with more alternatives"
msgstr "Från toppunkt :math:`3` till toppunkt :math:`8` med fler alternativ"

msgid "``pgr_version``"
msgstr "``pgr_version``"

msgid "``pgr_version`` — Query for pgRouting version information."
msgstr "``pgr_version`` - Fråga efter versionsinformation för pgRouting."

msgid "Breaking change on result columns"
msgstr "Förändring i resultatkolumnerna"

msgid "Support for old signature ends"
msgstr "Stöd för gamla signaturer slutar"

msgid "Returns pgRouting version information."
msgstr "Returnerar versionsinformation för pgRouting."

msgid "pgr_version()"
msgstr "pgr_version()"

msgid "RETURNS ``TEXT``"
msgstr "RETURNERAR ``TEXT``"

msgid "pgRouting Version for this documentation"
msgstr "pgRouting Version för denna dokumentation"

msgid "``pgr_vrpOneDepot`` - Experimental"
msgstr "``pgr_vrpOneDepot`` - Experimentell"

msgid "**No documentation available**"
msgstr "**Ingen dokumentation tillgänglig**"

msgid "**TBD**"
msgstr "**TBD**"

msgid "TBD"
msgstr "TBD"

msgid "``pgr_withPoints`` - Returns the shortest path in a graph with additional temporary vertices."
msgstr "``pgr_withPoints`` - Returnerar den kortaste vägen i en graf med ytterligare tillfälliga toppar."

msgid "pgr_withPoints(Combinations)"
msgstr "pgr_withPoints(Combinations)"

msgid "Modify the graph to include points defined by `Points SQL`_. Using Dijkstra algorithm, find the shortest path."
msgstr "Modifiera grafen så att den innehåller punkter definierade av `Points SQL`_. Använd Dijkstra-algoritmen för att hitta den kortaste vägen."

msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])"
msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **slut vid**, [**körsida**] [**alternativ**])"

msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])"
msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**körsida**] [**options**])"

msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])"
msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vid**, [**drivande sida**] [**optioner**])"

msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])"
msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**drivande sida**] [**optioner**])"

msgid "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])"
msgstr "pgr_withPoints(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])"

msgid "**options:** ``[directed, details])``"
msgstr "**options:** ``[directed, details])``"

msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph. (without details)"
msgstr "Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad graf. (utan detaljer)"

msgid "Identifier of the starting vertex of the path. Negative value is for point’s identifier."
msgstr "Identifierare för banans startvertex. Negativt värde är för punktens identifierare."

msgid "Array of identifiers of starting vertices. Negative values are for point’s identifiers."
msgstr "Array med identifierare för startpunkter. Negativa värden är för punktens identifierare."

msgid "Identifier of the ending vertex of the path. Negative value is for point’s identifier."
msgstr "Identifierare för banans slutpunkt. Negativt värde är för punktens identifierare."

msgid "Array of identifiers of ending vertices. Negative values are for point’s identifiers."
msgstr "Array med identifierare för ändpunkter. Negativa värden är för punktens identifierare."

msgid "All the examples are about traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`"
msgstr "Alla exempel handlar om att resa från punkten :math:`1` och toppunkten :math:`5` till punkterna :math:`\\{2, 3, 6\\}` och toppunkterna :math:`\\{10, 11\\}`"

msgid "``pgr_withPointsCost`` - Calculates the shortest path and returns only the aggregate cost of the shortest path found, for the combination of points given."
msgstr "``pgr_withPointsCost`` - Beräknar den kortaste vägen och returnerar endast den sammanlagda kostnaden för den kortaste vägen som hittats, för den kombination av punkter som anges."

msgid "pgr_withPointsCost(Combinations)"
msgstr "pgr_withPointsCost(Combinations)"

msgid "Modify the graph to include points defined by points_sql. Using Dijkstra algorithm, return only the aggregate cost of the shortest path found."
msgstr "Modifiera grafen så att den innehåller punkter definierade av points_sql. Använd Dijkstra-algoritmen och returnera endast den sammanlagda kostnaden för den kortaste vägen som hittats."

msgid "Returns the sum of the costs of the shortest path for pair combination of vertices in the modified graph."
msgstr "Returnerar summan av kostnaderna för den kortaste vägen för parkombinationer av toppar i den modifierade grafen."

msgid "The returned values are in the form of a set of |matrix-result|."
msgstr "De returnerade värdena är i form av en uppsättning |matrix-result|."

msgid "**positive** when it belongs to the edges_sql"
msgstr "**positiv** när den hör till kanterna_sql"

msgid "**negative** when it belongs to the points_sql"
msgstr "**negativ** när den hör till punktsql"

msgid "If the values returned are stored in a table, the unique index would be the pair: `(start_vid, end_vid)`."
msgstr "Om de värden som returneras lagras i en tabell skulle det unika indexet vara paret: `(start_vid, end_vid)`."

msgid "For **undirected** graphs, the results are **symmetric**."
msgstr "För **ej riktade** grafer är resultaten **symmetriska**."

msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, [**driving side**] [**options**])"
msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **slut vid**, [**drivande sida**] [**optioner**])"

msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, [**driving side**] [**options**])"
msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**] [**options**])"

msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, [**driving side**] [**options**])"
msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vid**, [**driving side**] [**options**])"

msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, [**driving side**] [**options**])"
msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, [**driving side**] [**options**])"

msgid "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])"
msgstr "pgr_withPointsCost(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, [**driving side**] [**options**])"

msgid "**options:** ``[directed]``"
msgstr "**options:** ``[directed]``"

msgid "There is no **details** flag, unlike the other members of the withPoints family of functions."
msgstr "Det finns ingen **details**-flagga, till skillnad från de andra medlemmarna i withPoints-familjen av funktioner."

msgid "From point :math:`1` to vertex :math:`10` with right driving side in directed graph."
msgstr "Från punkt :math:`1` till toppunkt :math:`10` med höger drivsida i riktad graf."

msgid "From point :math:`1` and vertex :math:`6` to point :math:`3` with right driving side in directed graph."
msgstr "Från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` med höger drivsida i riktad graf."

msgid "From point :math:`1` to vertex :math:`10`, and from vertex :math:`6` to point :math:`3` with right side driving."
msgstr "Från punkt :math:`1` till toppunkt :math:`10`, och från toppunkt :math:`6` till punkt :math:`3` med körning på höger sida."

msgid "Find the cost of the routes from vertex :math:`1` to the two closest locations on the graph of point `(2.9, 1.8)`."
msgstr "Beräkna kostnaden för rutterna från toppunkten :math:`1` till de två närmaste platserna på grafen för punkten `(2,9, 1,8)`."

msgid "Being close to the graph does not mean have a shorter route."
msgstr "Att vara nära grafen betyder inte att man har en kortare väg."

msgid "Right side driving topology"
msgstr "Topologi för drivning av höger sida"

msgid "Traveling from point :math:`1` and vertex :math:`5` to points :math:`\\{2, 3, 6\\}` and vertices :math:`\\{10, 11\\}`"
msgstr "Reser från punkt :math:`1` och toppunkt :math:`5` till punkterna :math:`\\{2, 3, 6\\}` och toppunkterna :math:`\\{10, 11\\}`"

msgid "Left side driving topology"
msgstr "Topologi för drivning av vänster sida"

msgid "Does not matter driving side driving topology"
msgstr "Spelar ingen roll drivsida drivtopologi"

msgid "``pgr_withPointsCostMatrix`` - Calculates a cost matrix using :doc:`pgr_withPoints`."
msgstr "``pgr_withPointsCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_withPoints`."

msgid "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])"
msgstr "pgr_withPointsCostMatrix(`Edges SQL`_, `Points SQL`_, **start vids**, [**driving side**] [**options**])"

msgid "Cost matrix for points :math:`\\{1, 6\\}` and vertices :math:`\\{10, 11\\}` on an **undirected** graph"
msgstr "Kostnadsmatris för punkterna :math:`\\{1, 6\\}` och hörnen :math:`\\{10, 11\\}` i en **omdirigerad** graf"

msgid "Returning a **symmetrical** cost matrix"
msgstr "Returnerar en **symmetrisk** kostnadsmatris"

msgid "Using the default ``side`` value on the **points_sql** query"
msgstr "Använda standardvärdet ``side`` på **points_sql**-frågan"

msgid "Using the default ``driving side`` value"
msgstr "Använda standardvärdet för \"körsida"

msgid "Find the matrix cost of the routes from vertex :math:`1` and the two closest locations on the graph of point `(2.9, 1.8)`."
msgstr "Hitta matriskostnaden för rutterna från toppunkten :math:`1` och de två närmaste platserna på grafen för punkten `(2,9, 1,8)`."

msgid "``pgr_withPointsDD`` - Returns the driving **distance** from a starting point."
msgstr "``pgr_withPointsDD`` - Returnerar köravståndet **från** en startpunkt."

msgid "Output columns standardized to |result-spantree|"
msgstr "Utgångskolumner standardiserade till |result-spantree|"

msgid "When ``details`` is ``false``:"
msgstr "När ``details`` är ``false``:"

msgid "Points reached within the distance are not included."
msgstr "Punkter som nås inom avståndet ingår inte."

msgid "Deprecated signatures:"
msgstr "Föråldrade signaturer:"

msgid "Modify the graph to include points and using Dijkstra algorithm, extracts all the nodes and points that have costs less than or equal to the value ``**distance**`` from the starting point. The edges extracted will conform the corresponding spanning tree."
msgstr "Modifiera grafen så att den inkluderar punkter och använd Dijkstra-algoritmen för att extrahera alla noder och punkter som har kostnader som är mindre än eller lika med värdet ``**avstånd**`` från startpunkten. De extraherade kanterna kommer att överensstämma med motsvarande spännträd."

msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])"
msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options A**])"

msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])"
msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options B**])"

msgid "**options A:** ``[directed, details]``"
msgstr "**options A:** ``[directed, details]``"

msgid "**options B:** ``[directed, details, equicost]``"
msgstr "**options B:** ``[directed, details, equicost]``"

msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])"
msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vid**, **distance**, [**driving side**], [**options**])"

msgid "Right side driving topology, from point :math:`1` within a distance of :math:`3.3` with details."
msgstr "Höger sida körtopologi, från punkt :math:`1` inom ett avstånd av :math:`3.3` med detaljer."

msgid "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])"
msgstr "pgr_withPointsDD(`Edges SQL`_, `Points SQL`_, **root vids**, **distance**, [**driving side**], [**options**])"

msgid "**options:** ``[directed, details, equicost]``"
msgstr "**options:** ``[directed, details, equicost]``"

msgid "From point :math:`1` and vertex :math:`16` within a distance of :math:`3.3` with ``equicost`` on a directed graph"
msgstr "Från punkt :math:`1` och toppunkt :math:`16` inom ett avstånd av :math:`3.3` med ``equicost`` på en riktad graf"

msgid "Negative values represent a point"
msgstr "Negativa värden representerar en punkt"

msgid "Find the driving distance from the two closest locations on the graph of point `(2.9, 1.8)`."
msgstr "Hitta köravståndet från de två närmaste platserna på grafen för punkten `(2,9, 1,8)`."

msgid "Point :math:`-1` corresponds to the closest edge from point :math:`(2.9, 1.8)`."
msgstr "Punkt :math:`-1` motsvarar den närmaste kanten från punkt :math:`(2,9, 1,8)`."

msgid "Point :math:`-2` corresponds to the next close edge from point :math:`(2.9, 1.8)`."
msgstr "Punkt :math:`-2` motsvarar nästa nära kant från punkt :math:`(2,9, 1,8)`."

msgid "Driving side does not matter"
msgstr "Körsidan spelar ingen roll"

msgid "From point :math:`1` within a distance of :math:`3.3`, does not matter driving side, with details."
msgstr "Från punkt :math:`1` inom ett avstånd av :math:`3.3`, spelar ingen roll körsida, med detaljer."

msgid "``pgr_withPointsKSP``"
msgstr "``pgr_withPointsKSP``"

msgid "``pgr_withPointsKSP`` — Yen's algorithm for K shortest paths using Dijkstra."
msgstr "``pgr_withPointsKSP`` - Yen's algoritm för K kortaste vägar med hjälp av Dijkstra."

msgid "pgr_withPointsKSP(One to Many)"
msgstr "pgr_withPointsKSP(One to Many)"

msgid "pgr_withPointsKSP(Many to One)"
msgstr "pgr_withPointsKSP(Many to One)"

msgid "pgr_withPointsKSP(Many to Many)"
msgstr "pgr_withPointsKSP(Many to Many)"

msgid "pgr_withPointsKSP(Combinations)"
msgstr "pgr_withPointsKSP(Combinations)"

msgid "Modifies the graph to include the points defined in the `Points SQL`_ and using Yen algorithm, finds the :math:`K` shortest paths."
msgstr "Modifierar grafen så att den innehåller de punkter som definieras i `Points SQL`_ och använder Yen-algoritmen för att hitta de :math:`K` kortaste vägarna."

msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, [**driving side**], [**options**])"
msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **slut vid**, **K**, [**drivande sida**], [**alternativ**])"

msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, [**driving side**], [**options**])"
msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, **K**, [**drivande sida**], [**alternativ**])"

msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, [**driving side**], [**options**])"
msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vid**, **K**, [**drivande sida**], [**alternativ**])"

msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, [**driving side**], [**options**])"
msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, **start vids**, **slut vids**, **K**, [**drivande sida**], [**alternativ**])"

msgid "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])"
msgstr "pgr_withPointsKSP(`Edges SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, [**driving side**], [**options**])"

msgid "**options:** ``[directed, heap_paths, details]``"
msgstr "**options:** ``[directed, heap_paths, details]``"

msgid "Get 2 paths from Point :math:`1` to point :math:`2` on a directed graph with **left** side driving."
msgstr "Få 2 vägar från punkt :math:`1` till punkt :math:`2` på en riktad graf med **vänster** sida som kör."

msgid "For a directed graph."
msgstr "För en riktad graf."

msgid "No details are given about distance of other points of the query."
msgstr "Inga detaljer ges om avståndet till andra punkter i frågan."

msgid "No heap paths are returned."
msgstr "Inga heap-sökvägar returneras."

msgid "Get 2 paths from point :math:`1` to point :math:`3` and vertex :math:`7` on an undirected graph"
msgstr "Hämta 2 vägar från punkt :math:`1` till punkt :math:`3` och toppunkt :math:`7` i en ostyrd graf"

msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` on a **directed** graph with **right** side driving and **details** set to **True**"
msgstr "Hämta en väg från punkt :math:`1` och vertex :math:`6` till punkt :math:`3` i en **riktad** graf med **höger** sida och **detaljer** inställt på **True**"

msgid "Get a path from point :math:`1` and vertex :math:`6` to point :math:`3` and vertex :math:`1` on a **directed** graph with **left** side driving and **heap_paths** set to **True**"
msgstr "Hämta en väg från punkt :math:`1` och toppunkt :math:`6` till punkt :math:`3` och toppunkt :math:`1` i en **directed** graf med **left** side driving och **heap_paths** satt till **True**"

msgid "Using a combinations table on an **directed** graph"
msgstr "Använda en kombinationstabell på en **riktad** graf"

msgid "Number of required paths"
msgstr "Antal nödvändiga sökvägar"

msgid "withPointsKSP optional parameters"
msgstr "withPointsKSP valfria parametrar"

msgid "Get :math:`2` paths using left side driving topology, from vertex :math:`1` to the closest location on the graph of point `(2.9, 1.8)`."
msgstr "Skaffa :math:`2` banor med hjälp av vänstersidig körtopologi, från toppunkten :math:`1` till den närmaste platsen på grafen för punkten `(2,9, 1,8)`."

msgid "Left driving side"
msgstr "Vänster körsida"

msgid "Get :math:`2` paths using left side driving topology, from point :math:`1` to point :math:`3` with details."
msgstr "Få :math:`2` banor med hjälp av vänstersidig drivtopologi, från punkt :math:`1` till punkt :math:`3` med detaljer."

msgid "Right driving side"
msgstr "Höger körsida"

msgid "Get :math:`2` paths using right side driving topology from, point :math:`1` to point :math:`2` with heap paths and details."
msgstr "Få :math:`2` banor med hjälp av höger sidas drivande topologi från, punkt :math:`1` till punkt :math:`2` med högbanor och detaljer."

msgid "``pgr_withPointsVia``"
msgstr "``pgr_withPointsVia``"

msgid "``pgr_withPointsVia`` - Route that goes through a list of vertices and/or points."
msgstr "``pgr_withPointsVia`` - Rutt som går genom en lista med toppar och/eller punkter."

msgid "Given a graph, a set of points on the graphs edges and a list of vertices, this function is equivalent to finding the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` (where :math:`vertex` can be a vertex or a point on the graph) for all :math:`i < size\\_of(via\\;vertices)`."
msgstr "Med tanke på en graf, en uppsättning punkter på grafens kanter och en lista med hörnpunkter är denna funktion likvärdig med att hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` (där :math:`vertex` kan vara en hörnpunkt eller en punkt i grafen) för alla :math:`i < size\\_of(via\\;vertices)`."

msgid "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])"
msgstr "pgr_withPointsVia(`Edges SQL`_, `Points SQL`_, **via vertices**, [**driving side**] [**options**])"

msgid "Find the route that visits the vertices :math:`\\{ -6, 15, -1\\}` in that order with right driving side in directed graph.."
msgstr "Hitta rutten som besöker topparna :math:`\\{ -6, 15, -1\\\\}` i den ordningen med höger körsida i riktad graf..."

msgid "Use :doc:`pgr_findCloseEdges` in the `Points SQL`_"
msgstr "Använd :doc:`pgr_findCloseEdges` i `Points SQL`_"

msgid "All this examples are about the route that visits the vertices :math:`\\{-1, 7, -3, 16, 15\\}` in that order on a **directed** graph."
msgstr "Alla dessa exempel handlar om den rutt som besöker topparna :math:`\\{-1, 7, -3, 16, 15\\}` i den ordningen i en **riktad** graf."

msgid "Prim - Family of functions"
msgstr "Prim - Familj av funktioner"

msgid "The prim algorithm was developed in 1930 by Czech mathematician Vojtěch Jarník. It is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex."
msgstr "Prim-algoritmen utvecklades 1930 av den tjeckiske matematikern Vojtěch Jarník. Det är en girig algoritm som hittar ett träd med minsta spännvidd för en viktad oiktad graf. Detta innebär att den hittar en delmängd av kanterna som bildar ett träd som inkluderar varje vertex, där den totala vikten av alla kanter i trädet minimeras. Algoritmen bygger trädet ett vertex i taget, från ett godtyckligt startvertex, och lägger i varje steg till den billigaste möjliga förbindelsen från trädet till ett annat vertex."

msgid "This algorithms find the minimum spanning forest in a possibly disconnected graph; in contrast, the most basic form of Prim's algorithm only finds minimum spanning trees in connected graphs. However, running Prim's algorithm separately for each connected component of the graph, then it is called minimum spanning forest."
msgstr "Den här algoritmen hittar den minsta överspännande skogen i en eventuellt frånkopplad graf; däremot hittar den mest grundläggande formen av Prims algoritm bara minsta överspännande träd i sammanhängande grafer. Men om man kör Prims algoritm separat för varje ansluten komponent i grafen kallas den minsta spännvidden för skog."

msgid "From boost Graph: \"The algorithm as implemented in Boost.Graph does not produce correct results on graphs with parallel edges.\""
msgstr "Från Boost Graph: \"Algoritmen som den implementeras i Boost.Graph ger inte korrekta resultat på grafer med parallella kanter.\""

msgid "Boost: `Prim's algorithm <https://www.boost.org/libs/graph/doc/prim_minimum_spanning_tree.html>`__"
msgstr "Boost: `Prims algoritm <https://www.boost.org/libs/graph/doc/prim_minimum_spanning_tree.html>`__"

msgid "Wikipedia: `Prim's algorithm <https://en.wikipedia.org/wiki/Prim%27s_algorithm>`__"
msgstr "Wikipedia: `Prims algoritm <https://en.wikipedia.org/wiki/Prim%27s_algorithm>`__"

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

msgid ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph."
msgstr ":doc:`pgr_lineGraph` - Transformation algorithm for generating a Line Graph."

msgid "Reference"
msgstr "Referens"

msgid "Release Notes"
msgstr "Versionsinformation"

msgid "To see the full list of changes check the list of `Git commits <https://github.com/pgRouting/pgrouting/commits>`_ on Github."
msgstr "För att se den fullständiga listan över ändringar, se listan över `Git commits <https://github.com/pgRouting/pgrouting/commits>`_ på Github."

msgid "Mayors"
msgstr "Borgmästare"

msgid "pgRouting 4"
msgstr "pgRouting 4"

msgid "Minors 4.x"
msgstr "Minors 4.x"

msgid "pgRouting 4.1"
msgstr "pgRouting 4.1"

msgid "pgRouting 4.1.0 Release Notes"
msgstr "Versionsinformation för pgRouting 4.1.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 4.1.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.1.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 4.1.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.1.0%22>`__"

msgid "Bug Fixes"
msgstr "Buggfixar"

msgid "`#2966 <https://github.com/pgRouting/pgrouting/issues/2966>`__: pgr_withPoints does not pick optimal route when fraction = 1"
msgstr "`#2966 <https://github.com/pgRouting/pgrouting/issues/2966>`__: pgr_withPoints väljer inte optimal rutt när fraction = 1"

msgid "Code enhancement"
msgstr "Förbättring av kod"

msgid "`#3025 <https://github.com/pgRouting/pgrouting/issues/3025>`__: Ordering functions standardized"
msgstr "`#3025 <https://github.com/pgRouting/pgrouting/issues/3025>`__: Ordningsfunktioner standardiserade"

msgid "pgRouting 3"
msgstr "pgRouting 3"

msgid "Minors 3.x"
msgstr "Minors 3.x"

msgid "pgRouting 3.8"
msgstr "pgRouting 3.8"

msgid "pgRouting 3.8.0 Release Notes"
msgstr "Versionsinformation för pgRouting 3.8.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.8.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.8.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.8.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.8.0%22>`__"

msgid "Promotion to official function of pgRouting."
msgstr "Befordran till officiell funktion för pgRouting."

msgid "Metric"
msgstr "Metriska"

msgid "`#2760 <https://github.com/pgRouting/pgrouting/issues/2760>`__: Promoted to official pgr_degree in version 3.8"
msgstr "`#2760 <https://github.com/pgRouting/pgrouting/issues/2760>`__: Befordrad till officiell pgr_grad i version 3.8"

msgid "Utilities"
msgstr "Verktyg"

msgid "`#2772 <https://github.com/pgRouting/pgrouting/issues/2772>`__: Promoted to official pgr_extractVertices in version 3.8"
msgstr "`#2772 <https://github.com/pgRouting/pgrouting/issues/2772>`__: Befordrad till officiell pgr_extractVertices i version 3.8"

msgid "`#2774 <https://github.com/pgRouting/pgrouting/issues/2774>`__: Promoted to official pgr_findCloseEdges in version 3.8"
msgstr "`#2774 <https://github.com/pgRouting/pgrouting/issues/2774>`__: Befordrad till officiell pgr_findCloseEdges i version 3.8"

msgid "`#2873 <https://github.com/pgRouting/pgrouting/issues/2873>`__: Promoted to official pgr_separateCrossing in version 3.8"
msgstr "`#2873 <https://github.com/pgRouting/pgrouting/issues/2873>`__: Befordrad till officiell pgr_separateCrossing i version 3.8"

msgid "`#2874 <https://github.com/pgRouting/pgrouting/issues/2874>`__: Promoted to official pgr_separateTouching in version 3.8"
msgstr "`#2874 <https://github.com/pgRouting/pgrouting/issues/2874>`__: Befordrad till officiell pgr_separateTouching i version 3.8"

msgid "Proposed functions"
msgstr "Föreslagna funktioner"

msgid "Contraction"
msgstr "Sammandragning"

msgid "`#2790 <https://github.com/pgRouting/pgrouting/issues/2790>`__: pgr_contractionDeadEnd new contraction function"
msgstr "`#2790 <https://github.com/pgRouting/pgrouting/issues/2790>`__: pgr_contractionDeadEnd ny funktion för sammandragning"

msgid "`#2791 <https://github.com/pgRouting/pgrouting/issues/2791>`__: pgr_contractionLinear new contraction function"
msgstr "`#2791 <https://github.com/pgRouting/pgrouting/issues/2791>`__: pgr_contractionLinear ny funktion för sammandragning"

msgid "`#2536 <https://github.com/pgRouting/pgrouting/issues/2536>`__: Support for contraction hierarchies (pgr_contractionHierarchies)"
msgstr "`#2536 <https://github.com/pgRouting/pgrouting/issues/2536>`__: Stöd för sammandragningshierarkier (pgr_contractionHierarchies)"

msgid "`#2848 <https://github.com/pgRouting/pgrouting/issues/2848>`__: Create pgr_separateCrossing new utility function"
msgstr "`#2848 <https://github.com/pgRouting/pgrouting/issues/2848>`__: Skapa pgr_separateCrossing ny verktygsfunktion"

msgid "`#2849 <https://github.com/pgRouting/pgrouting/issues/2849>`__: Create of pgr_separateTouching new utility function"
msgstr "`#2849 <https://github.com/pgRouting/pgrouting/issues/2849>`__: Skapande av pgr_separateTouching ny verktygsfunktion"

msgid "Official functions changes"
msgstr "Förändringar i officiella funktioner"

msgid "`#2786 <https://github.com/pgRouting/pgrouting/issues/2786>`__: pgr_contraction(edges) new signature"
msgstr "`#2786 <https://github.com/pgRouting/pgrouting/issues/2786>`__: pgr_contraction(edges) ny signatur"

msgid "C/C++ code enhancements"
msgstr "Förbättringar av C/C++-kod"

msgid "`#2802 <https://github.com/pgRouting/pgrouting/issues/2802>`__: Code reorganization on pgr_contraction"
msgstr "`#2802 <https://github.com/pgRouting/pgrouting/issues/2802>`__: Omorganisering av kod för pgr_contraction"

msgid "Other enhancements:"
msgstr "Andra förbättringar:"

msgid "`#2869 <https://github.com/pgRouting/pgrouting/issues/2869>`__:"
msgstr "`#2869 <https://github.com/pgRouting/pgrouting/issues/2869>`__:"

msgid "SQL code enhancements"
msgstr "Förbättringar av SQL-kod"

msgid "`#2850 <https://github.com/pgRouting/pgrouting/issues/2850>`__: Rewrite pgr_nodeNetwork"
msgstr "`#2850 <https://github.com/pgRouting/pgrouting/issues/2850>`__: Skriv om pgr_nodeNetwork"

msgid "Deprecation of SQL functions"
msgstr "Utfasning av SQL-funktioner"

msgid "`#2749 <https://github.com/pgRouting/pgrouting/issues/2749>`__: Deprecate pgr_AlphaShape in 3.8"
msgstr "`#2749 <https://github.com/pgRouting/pgrouting/issues/2749>`__: Avveckla pgr_AlphaShape i 3.8"

msgid "`#2750 <https://github.com/pgRouting/pgrouting/issues/2750>`__: Deprecate pgr_CreateTopology in 3.8"
msgstr "`#2750 <https://github.com/pgRouting/pgrouting/issues/2750>`__: Avveckla pgr_CreateTopology i 3.8"

msgid "`#2753 <https://github.com/pgRouting/pgrouting/issues/2753>`__: Deprecate pgr_analyzeGraph in 3.8"
msgstr "`#2753 <https://github.com/pgRouting/pgrouting/issues/2753>`__: Avveckla pgr_analyzeGraph i 3.8"

msgid "`#2754 <https://github.com/pgRouting/pgrouting/issues/2754>`__: Deprecate pgr_analyzeOneWay in 3.8"
msgstr "`#2754 <https://github.com/pgRouting/pgrouting/issues/2754>`__: Avveckla pgr_analyzeOneWay i 3.8"

msgid "`#2826 <https://github.com/pgRouting/pgrouting/issues/2826>`__: Deprecate pgr_createVerticesTable in 3.8"
msgstr "`#2826 <https://github.com/pgRouting/pgrouting/issues/2826>`__: Avveckla pgr_createVerticesTable i 3.8"

msgid "In the deprecated functions:"
msgstr "I de föråldrade funktionerna:"

msgid "Migration section is created."
msgstr "Migrationsavsnittet skapas."

msgid "The use of the functions is removed in the documentation."
msgstr "Användningen av funktionerna har tagits bort i dokumentationen."

msgid "pgRouting 3.7"
msgstr "pgRouting 3.7"

msgid "pgRouting 3.7.3 Release Notes"
msgstr "Versionsinformation för pgRouting 3.7.3"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.3%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.3%22>`__"

msgid "`#2731 <https://github.com/pgRouting/pgrouting/issues/2731>`__: Build Failure on Ubuntu 22"
msgstr "`#2731 <https://github.com/pgRouting/pgrouting/issues/2731>`__: Byggfel på Ubuntu 22"

msgid "pgRouting 3.7.2 Release Notes"
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 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.2%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.2%22>`__"

msgid "`#2713 <https://github.com/pgRouting/pgrouting/issues/2713>`__: cmake missing some policies and min version"
msgstr "`#2713 <https://github.com/pgRouting/pgrouting/issues/2713>`__: cmake saknar vissa policyer och min-version"

msgid "Using OLD policies: CMP0148, CMP0144, CMP0167"
msgstr "Använda gamla policyer: CMP0148, CMP0144, CMP0167"

msgid "Minimum cmake version 3.12"
msgstr "Minsta cmake-version 3.12"

msgid "`#2707 <https://github.com/pgRouting/pgrouting/issues/2707>`__: Build failure in pgRouting 3.7.1 on Alpine"
msgstr "`#2707 <https://github.com/pgRouting/pgrouting/issues/2707>`__: Byggfel i pgRouting 3.7.1 på Alpine"

msgid "`#2706 <https://github.com/pgRouting/pgrouting/issues/2706>`__: winnie crashing on pgr_betweennessCentrality"
msgstr "`#2706 <https://github.com/pgRouting/pgrouting/issues/2706>`__: winnie kraschar på pgr_betweennessCentrality"

msgid "pgRouting 3.7.1 Release Notes"
msgstr "Versionsinformation för pgRouting 3.7.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.1%22>`__"

msgid "`#2680 <https://github.com/pgRouting/pgrouting/issues/2680>`__: fails to compile under mingw64 gcc 13.2"
msgstr "`#2680 <https://github.com/pgRouting/pgrouting/issues/2680>`__: går inte att kompilera under mingw64 gcc 13.2"

msgid "`#2689 <https://github.com/pgRouting/pgrouting/issues/2689>`__: When point is a vertex, the withPoints family do not return results."
msgstr "`#2689 <https://github.com/pgRouting/pgrouting/issues/2689>`__: När en punkt är en vertex ger inte withPoints-familjen något resultat."

msgid "C/C++ code enhancemet"
msgstr "Förbättring av C/C++-kod"

msgid "TRSP family"
msgstr "TRSP-familjen"

msgid "pgRouting 3.7.0 Release Notes"
msgstr "Versionsinformation för pgRouting 3.7.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.7.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.7.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.0%22>`__"

msgid "Support"
msgstr "Support"

msgid "`#2656 <https://github.com/pgRouting/pgrouting/issues/2656>`__: Stop support of PostgreSQL12 on pgrouting v3.7"
msgstr "`#2656 <https://github.com/pgRouting/pgrouting/issues/2656>`__: Stoppa stöd för PostgreSQL12 på pgrouting v3.7"

msgid "Stopping support of PostgreSQL 12"
msgstr "Stoppa stöd för PostgreSQL 12"

msgid "CI does not test for PostgreSQL 12"
msgstr "CI testar inte för PostgreSQL 12"

msgid "pgr_betweennessCentrality"
msgstr "pgr_betweennessCentrality"

msgid "`#2605 <https://github.com/pgRouting/pgrouting/issues/2605>`__: Standardize spanning tree functions output"
msgstr "`#2605 <https://github.com/pgRouting/pgrouting/issues/2605>`__: Standardisera utdata för funktioner för spänningsträd"

msgid "Functions:"
msgstr "Funktioner:"

msgid "Experimental promoted to proposed."
msgstr "Experimentell befordrad till föreslagen."

msgid "`#2635 <https://github.com/pgRouting/pgrouting/issues/2635>`__: pgr_LineGraph ignores directed flag and use negative values for identifiers."
msgstr "`#2635 <https://github.com/pgRouting/pgrouting/issues/2635>`__: pgr_LineGraph ignorerar directed flag och använder negativa värden för identifierare."

msgid "``pgr_lineGraph``"
msgstr "``pgr_lineGraph``"

msgid "`#2599 <https://github.com/pgRouting/pgrouting/issues/2599>`__: Driving distance cleanup"
msgstr "`#2599 <https://github.com/pgRouting/pgrouting/issues/2599>`__: Körsträcka uppstädning"

msgid "`#2607 <https://github.com/pgRouting/pgrouting/issues/2607>`__: Read postgresql data on C++"
msgstr "`#2607 <https://github.com/pgRouting/pgrouting/issues/2607>`__: Läsa postgresql-data på C++"

msgid "`#2614 <https://github.com/pgRouting/pgrouting/issues/2614>`__: Clang tidy does not work"
msgstr "`#2614 <https://github.com/pgRouting/pgrouting/issues/2614>`__: Clang tidy fungerar inte"

msgid "pgRouting 3.6"
msgstr "pgRouting 3.6"

msgid "pgRouting 3.6.3 Release Notes"
msgstr "Versionsinformation för pgRouting 3.6.3"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.3%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.3%22>`__"

msgid "Explicit minimum requirements:"
msgstr "Uttryckliga minimikrav:"

msgid "postgres 11.0.0"
msgstr "postgres 11.0.0"

msgid "postgis 3.0.0"
msgstr "postgis 3.0.0"

msgid "g++ 13+ is supported"
msgstr "g++ 13+ stöds"

msgid "Code fixes"
msgstr "Kodkorrigeringar"

msgid "Fix warnings from cpplint."
msgstr "Fixa varningar från cpplint."

msgid "Fix warnings from clang 18."
msgstr "Fixa varningar från clang 18."

msgid "CI tests"
msgstr "CI-test"

msgid "Add a clang tidy test on changed files."
msgstr "Lägg till ett clang tidy-test på ändrade filer."

msgid "Update test not done on versions: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, 3.1.2"
msgstr "Uppdateringstest inte gjort på versioner: 3.0.1, 3.0.2, 3.0.3, 3.0.4, 3.1.0, 3.1.1, 3.1.2"

msgid "Documentation"
msgstr "Dokumentation"

msgid "Results of documentation queries adujsted to boost 1.83.0 version:"
msgstr "Resultat av dokumentationsförfrågningar adujsted till boost 1.83.0 version:"

msgid "pgr_stoerWagner"
msgstr "pgr_stoerWagner"

msgid "pgtap tests"
msgstr "pgtap-test"

msgid "bug fixes"
msgstr "buggfixar"

msgid "pgRouting 3.6.2 Release Notes"
msgstr "Versionsinformation för pgRouting 3.6.2"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.2%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.2%22>`__"

msgid "Upgrade fix"
msgstr "Fix för uppgradering"

msgid "The upgrade was failing for same minor"
msgstr "Uppgraderingen misslyckades på grund av samma mindre"

msgid "Fix warnings from cpplint"
msgstr "Fixa varningar från cpplint"

msgid "Others"
msgstr "Andra"

msgid "Adjust NEWS generator"
msgstr "Justera NEWS-generatorn"

msgid "Name change to `NEWS.md` for better visualization on GitHub"
msgstr "Namnändring till `NEWS.md` för bättre visualisering på GitHub"

msgid "pgRouting 3.6.1 Release Notes"
msgstr "Versionsinformation för pgRouting 3.6.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.1%22>`__"

msgid "`#2588 <https://github.com/pgRouting/pgrouting/issues/2588>`__: pgrouting 3.6.0 fails to build on OSX"
msgstr "`#2588 <https://github.com/pgRouting/pgrouting/issues/2588>`__: pgrouting 3.6.0 går inte att bygga under OSX"

msgid "pgRouting 3.6.0 Release Notes"
msgstr "Versionsinformation för pgRouting 3.6.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.6.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.6.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.0%22>`__"

msgid "`#2516 <https://github.com/pgRouting/pgrouting/issues/2516>`__: Standardize output pgr_aStar"
msgstr "`#2516 <https://github.com/pgRouting/pgrouting/issues/2516>`__: Standardisera utdata pgr_aStar"

msgid "Standardize output columns to |short-generic-result|"
msgstr "Standardisera utdatakolumner till |short-generic-result|"

msgid "`#2523 <https://github.com/pgRouting/pgrouting/issues/2523>`__: Standardize output pgr_bdAstar"
msgstr "`#2523 <https://github.com/pgRouting/pgrouting/issues/2523>`__: Standardisera utdata pgr_bdAstar"

msgid "`#2547 <https://github.com/pgRouting/pgrouting/issues/2547>`__: Standardize output and modifying signature pgr_KSP"
msgstr "`#2547 <https://github.com/pgRouting/pgrouting/issues/2547>`__: Standardisera utdata och modifiera signatur pgr_KSP"

msgid "`#2548 <https://github.com/pgRouting/pgrouting/issues/2548>`__: Standardize output pgr_drivingDistance"
msgstr "`#2548 <https://github.com/pgRouting/pgrouting/issues/2548>`__: Standardisera utdata pgr_drivingDistance"

msgid "Proposed functions changes"
msgstr "Föreslagna ändringar av funktioner"

msgid "`#2544 <https://github.com/pgRouting/pgrouting/issues/2544>`__: Standardize output and modifying signature pgr_withPointsDD"
msgstr "`#2544 <https://github.com/pgRouting/pgrouting/issues/2544>`__: Standardisera utdata och modifiera signaturen pgr_withPointsDD"

msgid "`#2546 <https://github.com/pgRouting/pgrouting/issues/2546>`__: Standardize output and modifying signature pgr_withPointsKSP"
msgstr "`#2546 <https://github.com/pgRouting/pgrouting/issues/2546>`__: Standardisera utdata och modifiera signaturen pgr_withPointsKSP"

msgid "`#2504 <https://github.com/pgRouting/pgrouting/issues/2504>`__: To C++ pg data get, fetch and check."
msgstr "`#2504 <https://github.com/pgRouting/pgrouting/issues/2504>`__: Till C++ pg-data hämta, hämta och kontrollera."

msgid "Stopping support for compilation with MSVC."
msgstr "Stoppar stöd för kompilering med MSVC."

msgid "`#2505 <https://github.com/pgRouting/pgrouting/issues/2505>`__: Using namespace."
msgstr "`#2505 <https://github.com/pgRouting/pgrouting/issues/2505>`__: Använder namnrymd."

msgid "`#2512 <https://github.com/pgRouting/pgrouting/issues/2512>`__: [Dijkstra] Removing duplicate code on Dijkstra."
msgstr "`#2512 <https://github.com/pgRouting/pgrouting/issues/2512>`__: [Dijkstra] Borttagning av duplicerad kod på Dijkstra."

msgid "`#2517 <https://github.com/pgRouting/pgrouting/issues/2517>`__: Astar code simplification."
msgstr "`#2517 <https://github.com/pgRouting/pgrouting/issues/2517>`__: Förenkling av Astar-kod."

msgid "`#2521 <https://github.com/pgRouting/pgrouting/issues/2521>`__: Dijkstra code simplification."
msgstr "`#2521 <https://github.com/pgRouting/pgrouting/issues/2521>`__: Förenkling av Dijkstra-kod."

msgid "`#2522 <https://github.com/pgRouting/pgrouting/issues/2522>`__: bdAstar code simplification."
msgstr "`#2522 <https://github.com/pgRouting/pgrouting/issues/2522>`__: Förenkling av bdAstar-koden."

msgid "`#2490 <https://github.com/pgRouting/pgrouting/issues/2490>`__: Automatic page history links."
msgstr "`#2490 <https://github.com/pgRouting/pgrouting/issues/2490>`__: Automatiska länkar till sidhistorik."

msgid "..rubric:: Standardize SQL"
msgstr "..rubric:: Standardize SQL"

msgid "`#2555 <https://github.com/pgRouting/pgrouting/issues/2555>`__: Standardize deprecated messages"
msgstr "`#2555 <https://github.com/pgRouting/pgrouting/issues/2555>`__: Standardisera föråldrade meddelanden"

msgid "On new internal function: do not use named parameters and default parameters."
msgstr "För nya interna funktioner: använd inte namngivna parametrar och standardparametrar."

msgid "pgRouting 3.5"
msgstr "pgRouting 3.5"

msgid "pgRouting 3.5.1 Release Notes"
msgstr "Versionsinformation för pgRouting 3.5.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.5.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.1%22>`__"

msgid "Documentation fixes"
msgstr "Dokumentationsfixar"

msgid "Changes on the documentation to the following:"
msgstr "Ändringar i dokumentationen till följande:"

msgid "pgr_degree"
msgstr "pgr_degree"

msgid "pgr_ksp"
msgstr "pgr_ksp"

msgid "Automatic page history links"
msgstr "Automatiska länkar till sidhistorik"

msgid "using bootstrap_version 2 because 3+ does not do dropdowns"
msgstr "använder bootstrap_version 2 eftersom 3+ inte gör dropdowns"

msgid "Issue fixes"
msgstr "Problemkorrigeringar"

msgid "`#2565 <https://github.com/pgRouting/pgrouting/issues/2565>`__: pgr_lengauerTarjanDominatorTree triggers an assertion"
msgstr "`#2565 <https://github.com/pgRouting/pgrouting/issues/2565>`__: pgr_lengauerTarjanDominatorTree utlöser ett påstående"

msgid "SQL enhancements"
msgstr "Förbättringar av SQL"

msgid "`#2561 <https://github.com/pgRouting/pgrouting/issues/2561>`__: Not use wildcards on SQL"
msgstr "`#2561 <https://github.com/pgRouting/pgrouting/issues/2561>`__: Använd inte jokertecken i SQL"

msgid "`#2559 <https://github.com/pgRouting/pgrouting/issues/2559>`__: pgtap test using sampledata"
msgstr "`#2559 <https://github.com/pgRouting/pgrouting/issues/2559>`__: pgtap-test med sampledata"

msgid "Build fixes"
msgstr "Byggfixar"

msgid "Fix winnie build"
msgstr "Fixa winnie build"

msgid "Fix clang warnings"
msgstr "Fixa clang-varningar"

msgid "Grouping headers of postgres readers"
msgstr "Gruppering av rubriker för postgres-läsare"

msgid "pgRouting 3.5.0 Release Notes"
msgstr "Versionsinformation för pgRouting 3.5.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.5.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.5.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.0%22>`__"

msgid "Dijkstra"
msgstr "Dijkstra"

msgid "pgRouting 3.4"
msgstr "pgRouting 3.4"

msgid "pgRouting 3.4.2 Release Notes"
msgstr "Versionsinformation för pgRouting 3.4.2"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.2%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.4.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.2%22>`__"

msgid "`#2394 <https://github.com/pgRouting/pgrouting/issues/2394>`__: pgr_bdAstar accumulates heuristic cost in visited node cost."
msgstr "`#2394 <https://github.com/pgRouting/pgrouting/issues/2394>`__: pgr_bdAstar ackumulerar heuristisk kostnad i besökt nodkostnad."

msgid "`#2427 <https://github.com/pgRouting/pgrouting/issues/2427>`__: pgr_createVerticesTable & pgr_createTopology, variable should be of type Record."
msgstr "`#2427 <https://github.com/pgRouting/pgrouting/issues/2427>`__: pgr_createVerticesTable & pgr_createTopology, variabeln ska vara av typen Record."

msgid "pgRouting 3.4.1 Release Notes"
msgstr "Versionsinformation för pgRouting 3.4.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.4.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.1%22>`__"

msgid "`#2401 <https://github.com/pgRouting/pgrouting/issues/2401>`__: pgRouting 3.4.0 do not build docs when sphinx is too low or missing"
msgstr "`#2401 <https://github.com/pgRouting/pgrouting/issues/2401>`__: pgRouting 3.4.0 bygger inte dokument när sphinx är för låg eller saknas"

msgid "`#2398 <https://github.com/pgRouting/pgrouting/issues/2398>`__: v3.4.0 does not upgrade from 3.3.3"
msgstr "`#2398 <https://github.com/pgRouting/pgrouting/issues/2398>`__: v3.4.0 uppgraderar inte från 3.3.3"

msgid "pgRouting 3.4.0 Release Notes"
msgstr "Versionsinformation för pgRouting 3.4.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.4.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.4.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.0%22>`__"

msgid "`#1891 <https://github.com/pgRouting/pgrouting/issues/1891>`__: pgr_ksp doesn't give all correct shortest path"
msgstr "`#1891 <https://github.com/pgRouting/pgrouting/issues/1891>`__: pgr_ksp ger inte alla korrekta kortaste vägar"

msgid "New proposed functions."
msgstr "Nya föreslagna funktioner."

msgid "With points"
msgstr "Med punkt"

msgid "pgr_withPointsVia(One Via)"
msgstr "pgr_withPointsVia(One Via)"

msgid "Turn Restrictions"
msgstr "Begränsningar för sväng"

msgid "Via with turn restrictions"
msgstr "Via med svängrestriktioner"

msgid "pgr_trspVia(One Via)"
msgstr "pgr_trspVia(One Via)"

msgid "pgr_trspVia_withPoints(One Via)"
msgstr "pgr_trspVia_withPoints(One Via)"

msgid "pgr_trsp_withPoints(One to One)"
msgstr "pgr_trsp_withPoints(One to One)"

msgid "pgr_trsp_withPoints(One to Many)"
msgstr "pgr_trsp_withPoints(One to Many)"

msgid "pgr_trsp_withPoints(Many to One)"
msgstr "pgr_trsp_withPoints(Many to One)"

msgid "pgr_trsp_withPoints(Many to Many)"
msgstr "pgr_trsp_withPoints(Many to Many)"

msgid "pgr_trsp_withPoints(Combinations)"
msgstr "pgr_trsp_withPoints(Combinations)"

msgid "Topology"
msgstr "Topologi"

msgid "pgr_findCloseEdges(One point)"
msgstr "pgr_findCloseEdges(One point)"

msgid "pgr_findCloseEdges(Many points)"
msgstr "pgr_findCloseEdges(Many points)"

msgid "pgr_cuthillMckeeOrdering"
msgstr "pgr_cuthillMckeeOrdering"

msgid "Unclassified"
msgstr "Oklassificerade"

msgid "pgr_hawickCircuits"
msgstr "pgr_hawickCircuits"

msgid "Flow functions"
msgstr "Flödesfunktioner"

msgid "pgr_maxCardinalityMatch(text)"
msgstr "pgr_maxCardinalityMatch(text)"

msgid "Deprecating: pgr_maxCardinalityMatch(text,boolean)"
msgstr "Föråldrad: pgr_maxCardinalityMatch(text,boolean)"

msgid "Deprecated Functions"
msgstr "Föråldrade funktioner"

msgid "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)"
msgstr "pgr_trsp(text,integer,float8,integer,float8,boolean,boolean,text)"

msgid "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)"
msgstr "pgr_trspViaEdges(text,integer[],float[],boolean,boolean,text)"

msgid "pgRouting 3.3"
msgstr "pgRouting 3.3"

msgid "pgRouting 3.3.5 Release Notes"
msgstr "Versionsinformation för pgRouting 3.3.5"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.5 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.5%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.5 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.5%22>`__"

msgid "pgRouting 3.3.4 Release Notes"
msgstr "Versionsinformation för pgRouting 3.3.4"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%22>`__"

msgid "`#2400 <https://github.com/pgRouting/pgrouting/issues/2400>`__: pgRouting 3.3.3 does not build in focal"
msgstr "`#2400 <https://github.com/pgRouting/pgrouting/issues/2400>`__: pgRouting 3.3.3 kan inte byggas i fokal"

msgid "pgRouting 3.3.3 Release Notes"
msgstr "Versionsinformation för pgRouting 3.3.3"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.3%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.3%22>`__"

msgid "Ignoring optional boolean parameter, as the algorithm works only for undirected graphs."
msgstr "Ignorerar den valfria booleska parametern, eftersom algoritmen endast fungerar för oriktade grafer."

msgid "pgRouting 3.3.2 Release Notes"
msgstr "Versionsinformation för pgRouting 3.3.2"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.2%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.2%22>`__"

msgid "Revised documentation"
msgstr "Reviderad dokumentation"

msgid "Simplifying table names and table columns, for example:"
msgstr "Förenkling av t.ex. tabellnamn och tabellkolumner:"

msgid "``edges`` instead of ``edge_table``"
msgstr "``edges`` i stället för ``edge_table``"

msgid "Removing unused columns ``category_id`` and ``reverse_category_id``."
msgstr "Ta bort oanvända kolumner ``category_id`` och ``reverse_category_id``."

msgid "``combinations`` instead of ``combinations_table``"
msgstr "``combinations`` i stället för ``combinations_table``"

msgid "Using PostGIS standard for geometry column."
msgstr "Använda PostGIS-standard för geometrikolumn."

msgid "``geom`` instead of ``the_geom``"
msgstr "``geom`` i stället för ``the_geom``"

msgid "Avoiding usage of functions that modify indexes, columns etc on tables."
msgstr "Undvika användning av funktioner som modifierar index, kolumner etc. i tabeller."

msgid "Using ``pgr_extractVertices`` to create a routing topology"
msgstr "Använda ``pgr_extractVertices`` för att skapa en routningstopologi"

msgid "Restructure of the pgRouting concepts page."
msgstr "Omstrukturering av sidan med pgRouting-koncept."

msgid "`#2276 <https://github.com/pgRouting/pgrouting/issues/2276>`__: edgeDisjointPaths issues with start_vid and combinations"
msgstr "`#2276 <https://github.com/pgRouting/pgrouting/issues/2276>`__: edgeDisjointPaths-problem med start_vid och kombinationer"

msgid "`#2312 <https://github.com/pgRouting/pgrouting/issues/2312>`__: pgr_extractVertices error when target is not BIGINT"
msgstr "`#2312 <https://github.com/pgRouting/pgrouting/issues/2312>`__: pgr_extractVertices fel när målet inte är BIGINT"

msgid "`#2357 <https://github.com/pgRouting/pgrouting/issues/2357>`__: Apply clang-tidy performance-*"
msgstr "`#2357 <https://github.com/pgRouting/pgrouting/issues/2357>`__: Tillämpa clang-tidy prestanda-*"

msgid "pgRouting 3.3.1 Release Notes"
msgstr "Versionsinformation för pgRouting 3.3.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.1%22>`__"

msgid "`#2216 <https://github.com/pgRouting/pgrouting/issues/2216>`__: Warnings when using clang"
msgstr "`#2216 <https://github.com/pgRouting/pgrouting/issues/2216>`__: Varningar vid användning av clang"

msgid "`#2266 <https://github.com/pgRouting/pgrouting/issues/2266>`__: Error processing restrictions"
msgstr "`#2266 <https://github.com/pgRouting/pgrouting/issues/2266>`__: Fel vid bearbetning av restriktioner"

msgid "pgRouting 3.3.0 Release Notes"
msgstr "Versionsinformation för pgRouting 3.3.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.3.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.3.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.0%22>`__"

msgid "`#2057 <https://github.com/pgRouting/pgrouting/issues/2057>`__: trspViaEdges columns in different order"
msgstr "`#2057 <https://github.com/pgRouting/pgrouting/issues/2057>`__: trspViaEdges-kolumner i olika ordning"

msgid "`#2087 <https://github.com/pgRouting/pgrouting/issues/2087>`__: pgr_extractVertices to proposed"
msgstr "`#2087 <https://github.com/pgRouting/pgrouting/issues/2087>`__: pgr_extractVertices till förslag"

msgid "`#2201 <https://github.com/pgRouting/pgrouting/issues/2201>`__: pgr_depthFirstSearch to proposed"
msgstr "`#2201 <https://github.com/pgRouting/pgrouting/issues/2201>`__: pgr_depthFirstSearch till proposed"

msgid "`#2202 <https://github.com/pgRouting/pgrouting/issues/2202>`__: pgr_sequentialVertexColoring to proposed"
msgstr "`#2202 <https://github.com/pgRouting/pgrouting/issues/2202>`__: pgr_sequentialVertexColoring till föreslagen"

msgid "`#2203 <https://github.com/pgRouting/pgrouting/issues/2203>`__: pgr_dijkstraNear and pgr_dijkstraNearCost to proposed"
msgstr "`#2203 <https://github.com/pgRouting/pgrouting/issues/2203>`__: pgr_dijkstraNear och pgr_dijkstraNearCost till föreslagna"

msgid "Coloring"
msgstr "Färgläggning"

msgid "Experimental promoted to Proposed"
msgstr "Experimentell befordrad till Föreslagen"

msgid "pgr_dijkstraNear(Combinations)"
msgstr "pgr_dijkstraNear(Combinations)"

msgid "pgr_dijkstraNear(Many to Many)"
msgstr "pgr_dijkstraNear(Many to Many)"

msgid "pgr_dijkstraNear(Many to One)"
msgstr "pgr_dijkstraNear(Many to One)"

msgid "pgr_dijkstraNear(One to Many)"
msgstr "pgr_dijkstraNear(One to Many)"

msgid "pgr_dijkstraNearCost(Combinations)"
msgstr "pgr_dijkstraNearCost(Combinations)"

msgid "pgr_dijkstraNearCost(Many to Many)"
msgstr "pgr_dijkstraNearCost(Many to Many)"

msgid "pgr_dijkstraNearCost(Many to One)"
msgstr "pgr_dijkstraNearCost(Many to One)"

msgid "pgr_dijkstraNearCost(One to Many)"
msgstr "pgr_dijkstraNearCost(One to Many)"

msgid "pgr_extractVertices"
msgstr "pgr_extractVertices"

msgid "Traversal"
msgstr "Traversal"

msgid "pgr_depthFirstSearch(Multiple vertices)"
msgstr "pgr_depthFirstSearch(Multiple vertices)"

msgid "pgr_depthFirstSearch(Single vertex)"
msgstr "pgr_depthFirstSearch(Single vertex)"

msgid "pgRouting 3.2"
msgstr "pgRouting 3.2"

msgid "pgRouting 3.2.2 Release Notes"
msgstr "Versionsinformation för pgRouting 3.2.2"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.2%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.2.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.2%22>`__"

msgid "`#2093 <https://github.com/pgRouting/pgrouting/issues/2093>`__: Compilation on Visual Studio"
msgstr "`#2093 <https://github.com/pgRouting/pgrouting/issues/2093>`__: Kompilering i Visual Studio"

msgid "`#2189 <https://github.com/pgRouting/pgrouting/issues/2189>`__: Build error on RHEL 7"
msgstr "`#2189 <https://github.com/pgRouting/pgrouting/issues/2189>`__: Byggfel på RHEL 7"

msgid "pgRouting 3.2.1 Release Notes"
msgstr "Versionsinformation för pgRouting 3.2.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.2.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.1%22>`__"

msgid "`#1883 <https://github.com/pgRouting/pgrouting/issues/1883>`__: pgr_TSPEuclidean crashes connection on Windows"
msgstr "`#1883 <https://github.com/pgRouting/pgrouting/issues/1883>`__: pgr_TSPEuclidean kraschar anslutningen i Windows"

msgid "The solution is to use Boost::graph::metric_tsp_approx"
msgstr "Lösningen är att använda Boost::graph::metric_tsp_approx"

msgid "To not break user's code the optional parameters related to the TSP Annaeling are ignored"
msgstr "För att inte bryta användarens kod ignoreras de valfria parametrarna som är relaterade till TSP Annaeling"

msgid "The function with the annaeling optional parameters is deprecated"
msgstr "Funktionen med de valfria parametrarna annaeling är föråldrad"

msgid "pgRouting 3.2.0 Release Notes"
msgstr "Versionsinformation för pgRouting 3.2.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.2.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.2.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.0%22>`__"

msgid "`#1850 <https://github.com/pgRouting/pgrouting/issues/1850>`__: Change Boost min version to 1.56"
msgstr "`#1850 <https://github.com/pgRouting/pgrouting/issues/1850>`__: Ändra Boost min-version till 1.56"

msgid "Removing support for Boost v1.53, v1.54 & v1.55"
msgstr "Borttagande av stöd för Boost v1.53, v1.54 & v1.55"

msgid "Dijkstra Near"
msgstr "Dijkstra Nära"

msgid "pgr_isPlanar"
msgstr "pgr_isPlanar"

msgid "pgr_lengauerTarjanDominatorTree"
msgstr "pgr_lengauerTarjanDominatorTree"

msgid "pgr_makeConnected"
msgstr "pgr_makeConnected"

msgid "Astar"
msgstr "Astar"

msgid "Bidirectional Astar"
msgstr "Dubbelriktad Astar"

msgid "Bidirectional Dijkstra"
msgstr "Dubbelriktad Dijkstra"

msgid "pgRouting 3.1"
msgstr "pgRouting 3.1"

msgid "pgRouting 3.1.4 Release Notes"
msgstr "Versionsinformation för pgRouting 3.1.4"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.4%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.4%22>`__"

msgid "Issues fixes"
msgstr "Problemlösningar"

msgid "pgRouting 3.1.3 Release Notes"
msgstr "Versionsinformation för pgRouting 3.1.3"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.3%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.3%22>`__"

msgid "`#1825 <https://github.com/pgRouting/pgrouting/issues/1825>`__: Boost versions are not honored"
msgstr "`#1825 <https://github.com/pgRouting/pgrouting/issues/1825>`__: Boost-versioner respekteras inte"

msgid "`#1849 <https://github.com/pgRouting/pgrouting/issues/1849>`__: Boost 1.75.0 geometry \"point_xy.hpp\" build error on macOS environment"
msgstr "`#1849 <https://github.com/pgRouting/pgrouting/issues/1849>`__: Boost 1.75.0 geometri \"point_xy.hpp\" byggfel i macOS-miljö"

msgid "`#1861 <https://github.com/pgRouting/pgrouting/issues/1861>`__: vrp functions crash server"
msgstr "`#1861 <https://github.com/pgRouting/pgrouting/issues/1861>`__: vrp-funktioner kraschar server"

msgid "pgRouting 3.1.2 Release Notes"
msgstr "Versionsinformation för pgRouting 3.1.2"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.2%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.2%22>`__"

msgid "`#1304 <https://github.com/pgRouting/pgrouting/issues/1304>`__: FreeBSD 12 64-bit crashes on pgr_vrOneDepot tests Experimental Function"
msgstr "`#1304 <https://github.com/pgRouting/pgrouting/issues/1304>`__: FreeBSD 12 64-bit kraschar på pgr_vrOneDepot-tester Experimentell funktion"

msgid "`#1356 <https://github.com/pgRouting/pgrouting/issues/1356>`__: tools/testers/pg_prove_tests.sh fails when PostgreSQL port is not passed"
msgstr "`#1356 <https://github.com/pgRouting/pgrouting/issues/1356>`__: tools/testers/pg_prove_tests.sh misslyckas när PostgreSQL-porten inte är godkänd"

msgid "`#1725 <https://github.com/pgRouting/pgrouting/issues/1725>`__: Server crash on pgr_pickDeliver and pgr_vrpOneDepot on openbsd"
msgstr "`#1725 <https://github.com/pgRouting/pgrouting/issues/1725>`__: Serverkrasch på pgr_pickDeliver och pgr_vrpOneDepot på openbsd"

msgid "`#1760 <https://github.com/pgRouting/pgrouting/issues/1760>`__: TSP server crash on ubuntu 20.04 #1760"
msgstr "`#1760 <https://github.com/pgRouting/pgrouting/issues/1760>`__: TSP-serverkrasch på ubuntu 20.04 #1760"

msgid "`#1770 <https://github.com/pgRouting/pgrouting/issues/1770>`__: Remove warnings when using clang compiler"
msgstr "`#1770 <https://github.com/pgRouting/pgrouting/issues/1770>`__: Ta bort varningar vid användning av clang-kompilatorn"

msgid "pgRouting 3.1.1 Release Notes"
msgstr "Versionsinformation för pgRouting 3.1.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.1%22>`__"

msgid "`#1733 <https://github.com/pgRouting/pgrouting/issues/1733>`__: pgr_bdAstar fails when source or target vertex does not exist in the graph"
msgstr "`#1733 <https://github.com/pgRouting/pgrouting/issues/1733>`__: pgr_bdAstar misslyckas när käll- eller målvertexen inte finns i grafen"

msgid "`#1647 <https://github.com/pgRouting/pgrouting/issues/1647>`__: Linear Contraction contracts self loops"
msgstr "`#1647 <https://github.com/pgRouting/pgrouting/issues/1647>`__: Linjär sammandragning kontrakterar självloopar"

msgid "`#1640 <https://github.com/pgRouting/pgrouting/issues/1640>`__: pgr_withPoints fails when points_sql is empty"
msgstr "`#1640 <https://github.com/pgRouting/pgrouting/issues/1640>`__: pgr_withPoints misslyckas när points_sql är tom"

msgid "`#1616 <https://github.com/pgRouting/pgrouting/issues/1616>`__: Path evaluation on C++ not updated before the results go back to C"
msgstr "`#1616 <https://github.com/pgRouting/pgrouting/issues/1616>`__: Banutvärdering på C++ uppdateras inte innan resultaten går tillbaka till C"

msgid "`#1300 <https://github.com/pgRouting/pgrouting/issues/1300>`__: pgr_chinesePostman crash on test data"
msgstr "`#1300 <https://github.com/pgRouting/pgrouting/issues/1300>`__: pgr_chinesePostman kraschar på testdata"

msgid "pgRouting 3.1.0 Release Notes"
msgstr "Versionsinformation för pgRouting 3.1.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.1.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.1.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.0%22>`__"

msgid "pgr_dijkstra(combinations)"
msgstr "pgr_dijkstra(combinations)"

msgid "pgr_dijkstraCost(combinations)"
msgstr "pgr_dijkstraCost(combinations)"

msgid "Build changes"
msgstr "Förändringar i byggnaden"

msgid "Minimal requirement for Sphinx: version 1.8"
msgstr "Minimikrav för Sphinx: version 1.8"

msgid "pgRouting 3.0"
msgstr "pgRouting 3.0"

msgid "pgRouting 3.0.6 Release Notes"
msgstr "Versionsinformation för pgRouting 3.0.6"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.6 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.6%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.6 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.6%22>`__"

msgid "pgRouting 3.0.5 Release Notes"
msgstr "Versionsinformation för pgRouting 3.0.5"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.5 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.5%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.5 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.5%22>`__"

msgid "Backport issue fixes"
msgstr "Fixar problem med backport"

msgid "pgRouting 3.0.4 Release Notes"
msgstr "Versionsinformation för pgRouting 3.0.4"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.4%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.4%22>`__"

msgid "pgRouting 3.0.3 Release Notes"
msgstr "Versionsinformation för pgRouting 3.0.3"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.3%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.3%22>`__"

msgid "pgRouting 3.0.2 Release Notes"
msgstr "Versionsinformation för pgRouting 3.0.2"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.2%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.2%22>`__"

msgid "`#1378 <https://github.com/pgRouting/pgrouting/issues/1378>`__: Visual Studio build failing"
msgstr "`#1378 <https://github.com/pgRouting/pgrouting/issues/1378>`__: Visual Studio-byggnad misslyckas"

msgid "pgRouting 3.0.1 Release Notes"
msgstr "Versionsinformation för pgRouting 3.0.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.1%22>`__"

msgid "`#232 <https://github.com/pgRouting/pgrouting/issues/232>`__: Honor client cancel requests in C /C++ code"
msgstr "`#232 <https://github.com/pgRouting/pgrouting/issues/232>`__: Uppfylla begäran om avbrytande av klient i C/C++-kod"

msgid "pgRouting 3.0.0 Release Notes"
msgstr "Versionsinformation för pgRouting 3.0.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 3.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 3.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.0%22>`__"

msgid "Fixed Issues"
msgstr "Korrigerade problem"

msgid "`#1153 <https://github.com/pgRouting/pgrouting/issues/1153>`__: Renamed pgr_eucledianTSP to pgr_TSPeuclidean"
msgstr "`#1153 <https://github.com/pgRouting/pgrouting/issues/1153>`__: Bytte namn på pgr_eucledianTSP till pgr_TSPeuclidean"

msgid "`#1188 <https://github.com/pgRouting/pgrouting/issues/1188>`__: Removed CGAL dependency"
msgstr "`#1188 <https://github.com/pgRouting/pgrouting/issues/1188>`__: Borttaget CGAL-beroende"

msgid "`#1002 <https://github.com/pgRouting/pgrouting/issues/1002>`__: Fixed contraction issues:"
msgstr "`#1002 <https://github.com/pgRouting/pgrouting/issues/1002>`__: Fixade problem med sammandragning:"

msgid "`#1004 <https://github.com/pgRouting/pgrouting/issues/1004>`__: Contracts when forbidden vertices do not belong to graph"
msgstr "`#1004 <https://github.com/pgRouting/pgrouting/issues/1004>`__: Kontrakt när förbjudna toppar inte tillhör grafen"

msgid "`#1005 <https://github.com/pgRouting/pgrouting/issues/1005>`__: Intermideate results eliminated"
msgstr "`#1005 <https://github.com/pgRouting/pgrouting/issues/1005>`__: Medelmåttiga resultat eliminerade"

msgid "`#1006 <https://github.com/pgRouting/pgrouting/issues/1006>`__: No loss of information"
msgstr "`#1006 <https://github.com/pgRouting/pgrouting/issues/1006>`__: Ingen förlust av information"

msgid "New Functions"
msgstr "Nya funktioner"

msgid "Kruskal family"
msgstr "Familjen Kruskal"

msgid "pgr_kruskal"
msgstr "pgr_kruskal"

msgid "pgr_kruskalBFS"
msgstr "pgr_kruskalBFS"

msgid "pgr_kruskalDD"
msgstr "pgr_kruskalDD"

msgid "pgr_kruskalDFS"
msgstr "pgr_kruskalDFS"

msgid "Prim family"
msgstr "Familjen Prim"

msgid "pgr_prim"
msgstr "pgr_prim"

msgid "pgr_primDD"
msgstr "pgr_primDD"

msgid "pgr_primDFS"
msgstr "pgr_primDFS"

msgid "pgr_primBFS"
msgstr "pgr_primBFS"

msgid "Proposed moved to official on pgRouting"
msgstr "Föreslagen flyttad till officiell på pgRouting"

msgid "aStar Family"
msgstr "aStar-familjen"

msgid "pgr_aStarCost(One to One)"
msgstr "pgr_aStarCost(One to One)"

msgid "pgr_aStarCost(One to Many)"
msgstr "pgr_aStarCost(One to Many)"

msgid "pgr_aStarCost(Many to One)"
msgstr "pgr_aStarCost(Many to One)"

msgid "pgr_aStarCost(Many to Many)"
msgstr "pgr_aStarCost(Many to Many)"

msgid "pgr_aStarCostMatrix"
msgstr "pgr_aStarCostMatrix"

msgid "bdAstar Family"
msgstr "bdAstar Familj"

msgid "pgr_bdAstarCost(One to One)"
msgstr "pgr_bdAstarCost(One to One)"

msgid "pgr_bdAstarCost(One to Many)"
msgstr "pgr_bdAstarCost(One to Many)"

msgid "pgr_bdAstarCost(Many to One)"
msgstr "pgr_bdAstarCost(Many to One)"

msgid "pgr_bdAstarCost(Many to Many)"
msgstr "pgr_bdAstarCost(Many to Many)"

msgid "pgr_bdAstarCostMatrix"
msgstr "pgr_bdAstarCostMatrix"

msgid "bdDijkstra Family"
msgstr "familjen bdDijkstra"

msgid "pgr_bdDijkstraCost(One to One)"
msgstr "pgr_bdDijkstraCost(One to One)"

msgid "pgr_bdDijkstraCost(One to Many)"
msgstr "pgr_bdDijkstraCost(One to Many)"

msgid "pgr_bdDijkstraCost(Many to One)"
msgstr "pgr_bdDijkstraCost(Many to One)"

msgid "pgr_bdDijkstraCost(Many to Many)"
msgstr "pgr_bdDijkstraCost(Many to Many)"

msgid "pgr_bdDijkstraCostMatrix"
msgstr "pgr_bdDijkstraCostMatrix"

msgid "Flow Family"
msgstr "Flödesfamilj"

msgid "pgr_pushRelabel(One to One)"
msgstr "pgr_pushRelabel(One to One)"

msgid "pgr_pushRelabel(One to Many)"
msgstr "pgr_pushRelabel(One to Many)"

msgid "pgr_pushRelabel(Many to One)"
msgstr "pgr_pushRelabel(Many to One)"

msgid "pgr_pushRelabel(Many to Many)"
msgstr "pgr_pushRelabel(Many to Many)"

msgid "pgr_edmondsKarp(One to One)"
msgstr "pgr_edmondsKarp(One to One)"

msgid "pgr_edmondsKarp(One to Many)"
msgstr "pgr_edmondsKarp(One to Many)"

msgid "pgr_edmondsKarp(Many to One)"
msgstr "pgr_edmondsKarp(Many to One)"

msgid "pgr_edmondsKarp(Many to Many)"
msgstr "pgr_edmondsKarp(Many to Many)"

msgid "pgr_boykovKolmogorov (One to One)"
msgstr "pgr_boykovKolmogorov (One to One)"

msgid "pgr_boykovKolmogorov (One to Many)"
msgstr "pgr_boykovKolmogorov (One to Many)"

msgid "pgr_boykovKolmogorov (Many to One)"
msgstr "pgr_boykovKolmogorov (Many to One)"

msgid "pgr_boykovKolmogorov (Many to Many)"
msgstr "pgr_boykovKolmogorov (Many to Many)"

msgid "pgr_maxCardinalityMatching"
msgstr "pgr_maxCardinalityMatching"

msgid "pgr_edgeDisjointPaths(One to One)"
msgstr "pgr_edgeDisjointPaths(One to One)"

msgid "pgr_edgeDisjointPaths(One to Many)"
msgstr "pgr_edgeDisjointPaths(One to Many)"

msgid "pgr_edgeDisjointPaths(Many to One)"
msgstr "pgr_edgeDisjointPaths(Many to One)"

msgid "pgr_edgeDisjointPaths(Many to Many)"
msgstr "pgr_edgeDisjointPaths(Many to Many)"

msgid "Components family"
msgstr "Komponenter familj"

msgid "pgr_connectedComponents"
msgstr "pgr_connectedComponents"

msgid "pgr_strongComponents"
msgstr "pgr_strongComponents"

msgid "pgr_biconnectedComponents"
msgstr "pgr_biconnectedComponents"

msgid "pgr_articulationPoints"
msgstr "pgr_articulationPoints"

msgid "pgr_bridges"
msgstr "pgr_bridges"

msgid "Contraction:"
msgstr "Sammandragning:"

msgid "Removed unnecessary column seq"
msgstr "Tog bort onödig kolumn seq"

msgid "pgr_maxFlowMinCost"
msgstr "pgr_maxFlowMinCost"

msgid "pgr_maxFlowMinCost_Cost"
msgstr "pgr_maxFlowMinCost_Cost"

msgid "pgr_dagShortestpath"
msgstr "pgr_dagShortestpath"

msgid "VRP category"
msgstr "VRP-kategori"

msgid "pgr_pickDeliverEuclidean"
msgstr "pgr_pickDeliverEuclidean"

msgid "pgr_pickDeliver"
msgstr "pgr_pickDeliver"

msgid "Chinese Postman family"
msgstr "Chinese Postman family"

msgid "pgr_chinesePostman"
msgstr "pgr_chinesePostman"

msgid "pgr_chinesePostmanCost"
msgstr "pgr_chinesePostmanCost"

msgid "Breadth First Search family"
msgstr "Breadth First Search family"

msgid "Bellman Ford family"
msgstr "Bellman Ford family"

msgid "Moved to legacy"
msgstr "Flyttat till legacy"

msgid "pgr_labelGraph - Use the components family of functions instead."
msgstr "pgr_labelGraph - Use the components family of functions instead."

msgid "Max flow - functions were renamed on v2.5.0"
msgstr "Maxflöde - funktioner döptes om i v2.5.0"

msgid "pgr_maxFlowPushRelabel"
msgstr "pgr_maxFlowPushRelabel"

msgid "pgr_maxFlowBoykovKolmogorov"
msgstr "pgr_maxFlowBoykovKolmogorov"

msgid "pgr_maxFlowEdmondsKarp"
msgstr "pgr_maxFlowEdmondsKarp"

msgid "pgr_maximumcardinalitymatching"
msgstr "pgr_maximumcardinalitymatching"

msgid "VRP"
msgstr "VRP"

msgid "pgr_gsoc_vrppdtw"
msgstr "pgr_gsoc_vrppdtw"

msgid "TSP old signatures"
msgstr "TSP gamla signaturer"

msgid "pgr_pointsAsPolygon"
msgstr "pgr_pointsAsPolygon"

msgid "pgr_alphaShape old signature"
msgstr "pgr_alphaShape old signature"

msgid "pgRouting 2"
msgstr "pgRouting 2"

msgid "Minors 2.x"
msgstr "Minors 2.x"

msgid "pgRouting 2.6"
msgstr "pgRouting 2.6"

msgid "pgRouting 2.6.3 Release Notes"
msgstr "Versionsinformation för pgRouting 2.6.3"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.3%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.3%22>`__"

msgid "`#1219 <https://github.com/pgRouting/pgrouting/issues/1219>`__: Implicit cast for via_path integer to text"
msgstr "`#1219 <https://github.com/pgRouting/pgrouting/issues/1219>`__: Implicit kast för via_path heltal till text"

msgid "`#1193 <https://github.com/pgRouting/pgrouting/issues/1193>`__: Fixed pgr_pointsAsPolygon breaking when comparing strings in WHERE clause"
msgstr "`#1193 <https://github.com/pgRouting/pgrouting/issues/1193>`__: Fixat att pgr_pointsAsPolygon bröts när strängar jämfördes i WHERE-satsen"

msgid "`#1185 <https://github.com/pgRouting/pgrouting/issues/1185>`__: Improve FindPostgreSQL.cmake"
msgstr "`#1185 <https://github.com/pgRouting/pgrouting/issues/1185>`__: Förbättra FindPostgreSQL.cmake"

msgid "pgRouting 2.6.2 Release Notes"
msgstr "Versionsinformation för pgRouting 2.6.2"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.2%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.2%22>`__"

msgid "`#1152 <https://github.com/pgRouting/pgrouting/issues/1152>`__: Fixes driving distance when vertex is not part of the graph"
msgstr "`#1152 <https://github.com/pgRouting/pgrouting/issues/1152>`__: Fixar körsträcka när vertex inte är en del av grafen"

msgid "`#1098 <https://github.com/pgRouting/pgrouting/issues/1098>`__: Fixes windows test"
msgstr "`#1098 <https://github.com/pgRouting/pgrouting/issues/1098>`__: Åtgärdar Windows-test"

msgid "`#1165 <https://github.com/pgRouting/pgrouting/issues/1165>`__: Fixes build for python3 and perl5"
msgstr "`#1165 <https://github.com/pgRouting/pgrouting/issues/1165>`__: Fixar byggandet för python3 och perl5"

msgid "pgRouting 2.6.1 Release Notes"
msgstr "Versionsinformation för pgRouting 2.6.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.1%22>`__"

msgid "Fixes server crash on several functions."
msgstr "Fixar serverkrasch på flera funktioner."

msgid "pgr_floydWarshall"
msgstr "pgr_floydWarshall"

msgid "pgr_johnson"
msgstr "pgr_johnson"

msgid "pgr_bdDijstra"
msgstr "pgr_bdDijstra"

msgid "pgr_alphashape"
msgstr "pgr_alphashape"

msgid "pgr_dijkstraCostMatrix"
msgstr "pgr_dijkstraCostMatrix"

msgid "pgr_drivingDistance"
msgstr "pgr_drivingDistance"

msgid "pgr_dijkstraVia (proposed)"
msgstr "pgr_dijkstraVia (proposed)"

msgid "pgr_boykovKolmogorov (proposed)"
msgstr "pgr_boykovKolmogorov (proposed)"

msgid "pgr_edgeDisjointPaths (proposed)"
msgstr "pgr_edgeDisjointPaths (proposed)"

msgid "pgr_edmondsKarp (proposed)"
msgstr "pgr_edmondsKarp (proposed)"

msgid "pgr_maxCardinalityMatch (proposed)"
msgstr "pgr_maxCardinalityMatch (proposed)"

msgid "pgr_maxFlow (proposed)"
msgstr "pgr_maxFlow (proposed)"

msgid "pgr_withPoints (proposed)"
msgstr "pgr_withPoints (proposed)"

msgid "pgr_withPointsCost (proposed)"
msgstr "pgr_withPointsCost (proposed)"

msgid "pgr_withPointsKSP (proposed)"
msgstr "pgr_withPointsKSP (proposed)"

msgid "pgr_withPointsDD (proposed)"
msgstr "pgr_withPointsDD (proposed)"

msgid "pgr_withPointsCostMatrix (proposed)"
msgstr "pgr_withPointsCostMatrix (proposed)"

msgid "pgr_contractGraph (experimental)"
msgstr "pgr_contractGraph (experimental)"

msgid "pgr_pushRelabel (experimental)"
msgstr "pgr_pushRelabel (experimental)"

msgid "pgr_vrpOneDepot (experimental)"
msgstr "pgr_vrpOneDepot (experimental)"

msgid "pgr_gsoc_vrppdtw (experimental)"
msgstr "pgr_gsoc_vrppdtw (experimental)"

msgid "Fixes for deprecated functions where also applied but not tested"
msgstr "Fixar för föråldrade funktioner som också tillämpas men inte testas"

msgid "Removed compilation warning for g++8"
msgstr "Borttagen kompileringsvarning för g++8"

msgid "Fixed a fallthrugh on Astar and bdAstar."
msgstr "Åtgärdat ett fel på Astar och bdAstar."

msgid "pgRouting 2.6.0 Release Notes"
msgstr "Versionsinformation för pgRouting 2.6.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.6.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.6.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.0%22>`__"

msgid "pgr_lineGraphFull"
msgstr "pgr_lineGraphFull"

msgid "Fix pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean[,text])"
msgstr "Fix pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean[,text])"

msgid "without restrictions"
msgstr "utan begränsningar"

msgid "calls pgr_dijkstra when both end points have a fraction IN (0,1)"
msgstr "anropar pgr_dijkstra när båda ändpunkterna har en fraktion IN (0,1)"

msgid "calls pgr_withPoints when at least one fraction NOT IN (0,1)"
msgstr "anropar pgr_withPoints när minst en fraktion INTE ÄR I (0,1)"

msgid "with restrictions"
msgstr "med begränsningar"

msgid "calls original trsp code"
msgstr "samtal original trsp kod"

msgid "Internal code"
msgstr "Intern kod"

msgid "Cleaned the internal code of trsp(text,integer,integer,boolean,boolean [, text])"
msgstr "Rensade den interna koden för trsp(text,heltal,heltal,boolean,boolean [, text])"

msgid "Removed the use of pointers"
msgstr "Tog bort användningen av pekare"

msgid "Internal code can accept BIGINT"
msgstr "Intern kod kan acceptera BIGINT"

msgid "Cleaned the internal code of withPoints"
msgstr "Rensade den interna koden för withPoints"

msgid "pgRouting 2.5"
msgstr "pgRouting 2.5"

msgid "pgRouting 2.5.5 Release Notes"
msgstr "Versionsinformation för pgRouting 2.5.5"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.5 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.5%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.5 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.5%22>`__"

msgid "Fixes driving distance when vertex is not part of the graph"
msgstr "Fixar körsträcka när toppunkten inte är en del av grafen"

msgid "Fixes windows test"
msgstr "Åtgärdar Windows-test"

msgid "Fixes build for python3 and perl5"
msgstr "Fixar byggsätt för python3 och perl5"

msgid "pgRouting 2.5.4 Release Notes"
msgstr "Versionsinformation för pgRouting 2.5.4"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.4%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.4%22>`__"

msgid "pgRouting 2.5.3 Release Notes"
msgstr "Versionsinformation för pgRouting 2.5.3"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.3%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.3%22>`__"

msgid "Fix for postgresql 11: Removed a compilation error when compiling with postgreSQL"
msgstr "Fix för postgresql 11: Tog bort ett kompileringsfel vid kompilering med postgreSQL"

msgid "pgRouting 2.5.2 Release Notes"
msgstr "Versionsinformation för pgRouting 2.5.2"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.2%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.2%22>`__"

msgid "Fix for postgresql 10.1: Removed a compiler condition"
msgstr "Fix för postgresql 10.1: Tog bort ett kompilatorvillkor"

msgid "pgRouting 2.5.1 Release Notes"
msgstr "Versionsinformation för pgRouting 2.5.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.1%22>`__"

msgid "Fixed prerequisite minimum version of: cmake"
msgstr "Fixad förkunskapskrav för minsta version av: cmake"

msgid "pgRouting 2.5.0 Release Notes"
msgstr "Versionsinformation för pgRouting 2.5.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.5.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.5.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.0%22>`__"

msgid "enhancement:"
msgstr "förbättring:"

msgid "pgr_version is now on SQL language"
msgstr "pgr_version is now on SQL language"

msgid "Breaking change on:"
msgstr "Bryter förändring på:"

msgid "pgr_edgeDisjointPaths:"
msgstr "pgr_edgeDisjointPaths:"

msgid "Added path_id, cost and agg_cost columns on the result"
msgstr "Lagt till kolumnerna path_id, cost och agg_cost i resultatet"

msgid "Parameter names changed"
msgstr "Namn på parametrar ändrade"

msgid "The many version results are the union of the One to One version"
msgstr "Resultaten för många versioner är en sammanslagning av One to One-versionen"

msgid "New Signatures"
msgstr "Nya signaturer"

msgid "pgr_bdAstar(One to One)"
msgstr "pgr_bdAstar(One to One)"

msgid "pgr_lineGraph"
msgstr "pgr_lineGraph"

msgid "pgr_bdastar - use pgr_bdAstar instead"
msgstr "pgr_bdastar - use pgr_bdAstar instead"

msgid "Renamed functions"
msgstr "Omdöpta funktioner"

msgid "pgr_maxFlowPushRelabel - use pgr_pushRelabel instead"
msgstr "pgr_maxFlowPushRelabel - use pgr_pushRelabel instead"

msgid "pgr_maxFlowEdmondsKarp -use pgr_edmondsKarp instead"
msgstr "pgr_maxFlowEdmondsKarp -use pgr_edmondsKarp instead"

msgid "pgr_maxFlowBoykovKolmogorov - use pgr_boykovKolmogorov instead"
msgstr "pgr_maxFlowBoykovKolmogorov - use pgr_boykovKolmogorov instead"

msgid "pgr_maximumCardinalityMatching - use pgr_maxCardinalityMatch instead"
msgstr "pgr_maximumCardinalityMatching - use pgr_maxCardinalityMatch instead"

msgid "Deprecated Function"
msgstr "Föråldrad funktion"

msgid "pgr_pointToEdgeNode"
msgstr "pgr_pointToEdgeNode"

msgid "pgRouting 2.4"
msgstr "pgRouting 2.4"

msgid "pgRouting 2.4.2 Release Notes"
msgstr "Versionsinformation för pgRouting 2.4.2"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.2%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.4.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.2%22>`__"

msgid "Improvement"
msgstr "Förbättring"

msgid "Works for postgreSQL 10"
msgstr "Fungerar för postgreSQL 10"

msgid "Fixed: Unexpected error column \"cname\""
msgstr "Fast: Oväntad felkolumn \"cname\""

msgid "Replace __linux__ with __GLIBC__ for glibc-specific headers and functions"
msgstr "Ersätt __linux__ med __GLIBC__ för glibc-specifika rubriker och funktioner"

msgid "pgRouting 2.4.1 Release Notes"
msgstr "Versionsinformation för pgRouting 2.4.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.4.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.1%22>`__"

msgid "Fixed compiling error on macOS"
msgstr "Fixat kompileringsfel på macOS"

msgid "Condition error on pgr_withPoints"
msgstr "Villkorligt fel på pgr_withPoints"

msgid "pgRouting 2.4.0 Release Notes"
msgstr "Versionsinformation för pgRouting 2.4.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.4.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.4.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.0%22>`__"

msgid "Deprecated signatures."
msgstr "Föråldrade signaturer."

msgid "pgr_bddijkstra - use pgr_bdDijkstra instead"
msgstr "pgr_bddijkstra - use pgr_bdDijkstra instead"

msgid "pgr_pointsToVids"
msgstr "pgr_pointsToVids"

msgid "Bug fixes on proposed functions"
msgstr "Buggfixar på föreslagna funktioner"

msgid "pgr_withPointsKSP: fixed ordering"
msgstr "pgr_withPointsKSP: fixed ordering"

msgid "TRSP original code is used with no changes on the compilation warnings"
msgstr "TRSP:s originalkod används utan ändringar i sammanställningsvarningarna"

msgid "pgRouting 2.3"
msgstr "pgRouting 2.3"

msgid "pgRouting 2.3.2 Release Notes"
msgstr "Versionsinformation för pgRouting 2.3.2"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.3.2%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.3.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.3.2%22>`__"

msgid "Fixed pgr_gsoc_vrppdtw crash when all orders fit on one truck."
msgstr "Fixad pgr_gsoc_vrppdtw-krasch när alla order får plats på en lastbil."

msgid "Fixed pgr_trsp:"
msgstr "Fixat pgr_trsp:"

msgid "Alternate code is not executed when the point is in reality a vertex"
msgstr "Alternativ kod utförs inte när punkten i själva verket är en topp"

msgid "Fixed ambiguity on seq"
msgstr "Fixad tvetydighet på seq"

msgid "pgRouting 2.3.1 Release Notes"
msgstr "Versionsinformation för pgRouting 2.3.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.3.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.3.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.3.1%22>`__"

msgid "Leaks on proposed max_flow functions"
msgstr "Läckor om föreslagna max_flow-funktioner"

msgid "Regression error on pgr_trsp"
msgstr "Regressionsfel på pgr_trsp"

msgid "Types discrepancy on pgr_createVerticesTable"
msgstr "Typer diskrepans på pgr_createVerticesTable"

msgid "pgRouting 2.3.0 Release Notes"
msgstr "Versionsinformation för pgRouting 2.3.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.3.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.3.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.3.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.3.0%22>`__"

msgid "pgr_eucledianTSP"
msgstr "pgr_eucledianTSP"

msgid "pgr_maxFlowPushRelabel(One to One)"
msgstr "pgr_maxFlowPushRelabel(One to One)"

msgid "pgr_maxFlowPushRelabel(One to Many)"
msgstr "pgr_maxFlowPushRelabel(One to Many)"

msgid "pgr_maxFlowPushRelabel(Many to One)"
msgstr "pgr_maxFlowPushRelabel(Many to One)"

msgid "pgr_maxFlowPushRelabel(Many to Many)"
msgstr "pgr_maxFlowPushRelabel(Many to Many)"

msgid "pgr_maxFlowEdmondsKarp(One to One)"
msgstr "pgr_maxFlowEdmondsKarp(One to One)"

msgid "pgr_maxFlowEdmondsKarp(One to Many)"
msgstr "pgr_maxFlowEdmondsKarp(One to Many)"

msgid "pgr_maxFlowEdmondsKarp(Many to One)"
msgstr "pgr_maxFlowEdmondsKarp(Many to One)"

msgid "pgr_maxFlowEdmondsKarp(Many to Many)"
msgstr "pgr_maxFlowEdmondsKarp(Many to Many)"

msgid "pgr_maxFlowBoykovKolmogorov (One to One)"
msgstr "pgr_maxFlowBoykovKolmogorov (One to One)"

msgid "pgr_maxFlowBoykovKolmogorov (One to Many)"
msgstr "pgr_maxFlowBoykovKolmogorov (One to Many)"

msgid "pgr_maxFlowBoykovKolmogorov (Many to One)"
msgstr "pgr_maxFlowBoykovKolmogorov (Many to One)"

msgid "pgr_maxFlowBoykovKolmogorov (Many to Many)"
msgstr "pgr_maxFlowBoykovKolmogorov (Many to Many)"

msgid "pgr_maximumCardinalityMatching"
msgstr "pgr_maximumCardinalityMatching"

msgid "pgr_contractGraph"
msgstr "pgr_contractGraph"

msgid "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead"
msgstr "pgr_tsp - use pgr_TSP or pgr_eucledianTSP instead"

msgid "pgr_aStar - use pgr_aStar instead"
msgstr "pgr_aStar - use pgr_aStar instead"

msgid "pgr_flip_edges"
msgstr "pgr_flip_edges"

msgid "pgr_vidsToDmatrix"
msgstr "pgr_vidsToDmatrix"

msgid "pgr_pointsToDMatrix"
msgstr "pgr_pointsToDMatrix"

msgid "pgr_textToPoints"
msgstr "pgr_textToPoints"

msgid "pgRouting 2.2"
msgstr "pgRouting 2.2"

msgid "pgRouting 2.2.4 Release Notes"
msgstr "Versionsinformation för pgRouting 2.2.4"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.4%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.4%22>`__"

msgid "Bogus uses of extern \"C\""
msgstr "Felaktig användning av extern \"C\""

msgid "Build error on Fedora 24 + GCC 6.0"
msgstr "Byggfel på Fedora 24 + GCC 6.0"

msgid "Regression error pgr_nodeNetwork"
msgstr "Regressionsfel pgr_nodeNetwork"

msgid "pgRouting 2.2.3 Release Notes"
msgstr "Versionsinformation för pgRouting 2.2.3"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.3%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.3%22>`__"

msgid "Fixed compatibility issues with PostgreSQL 9.6."
msgstr "Fixade kompatibilitetsproblem med PostgreSQL 9.6."

msgid "pgRouting 2.2.2 Release Notes"
msgstr "Versionsinformation för pgRouting 2.2.2"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.2%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.2%22>`__"

msgid "Fixed regression error on pgr_drivingDistance"
msgstr "Åtgärdat regressionsfel på pgr_drivingDistance"

msgid "pgRouting 2.2.1 Release Notes"
msgstr "Versionsinformation för pgRouting 2.2.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.1%22>`__"

msgid "Server crash fix on pgr_alphaShape"
msgstr "Fix för serverkrasch på pgr_alphaShape"

msgid "Bug fix on With Points family of functions"
msgstr "Buggfix för funktionerna i With Points-familjen"

msgid "pgRouting 2.2.0 Release Notes"
msgstr "Versionsinformation för pgRouting 2.2.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.2.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.2.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.2.0%22>`__"

msgid "Improvements"
msgstr "Förbättringar"

msgid "pgr_nodeNetwork"
msgstr "pgr_nodeNetwork"

msgid "Adding a row_where and outall optional parameters"
msgstr "Lägga till en row_where och outall valfria parametrar"

msgid "Signature fix"
msgstr "Signaturfix"

msgid "pgr_dijkstra -- to match what is documented"
msgstr "pgr_dijkstra -- to match what is documented"

msgid "pgr_Johnson"
msgstr "pgr_Johnson"

msgid "pgr_dijkstraCost(One to One)"
msgstr "pgr_dijkstraCost(One to One)"

msgid "pgr_dijkstraCost(One to Many)"
msgstr "pgr_dijkstraCost(One to Many)"

msgid "pgr_dijkstraCost(Many to One)"
msgstr "pgr_dijkstraCost(Many to One)"

msgid "pgr_dijkstraCost(Many to Many)"
msgstr "pgr_dijkstraCost(Many to Many)"

msgid "Proposed Functionality"
msgstr "Föreslagen funktionalitet"

msgid "pgr_withPoints(One to One)"
msgstr "pgr_withPoints(One to One)"

msgid "pgr_withPoints(One to Many)"
msgstr "pgr_withPoints(One to Many)"

msgid "pgr_withPoints(Many to One)"
msgstr "pgr_withPoints(Many to One)"

msgid "pgr_withPoints(Many to Many)"
msgstr "pgr_withPoints(Many to Many)"

msgid "pgr_withPointsCost(One to One)"
msgstr "pgr_withPointsCost(One to One)"

msgid "pgr_withPointsCost(One to Many)"
msgstr "pgr_withPointsCost(One to Many)"

msgid "pgr_withPointsCost(Many to One)"
msgstr "pgr_withPointsCost(Many to One)"

msgid "pgr_withPointsCost(Many to Many)"
msgstr "pgr_withPointsCost(Many to Many)"

msgid "pgr_withPointsDD(single vertex)"
msgstr "pgr_withPointsDD(single vertex)"

msgid "pgr_withPointsDD(multiple vertices)"
msgstr "pgr_withPointsDD(multiple vertices)"

msgid "pgr_apspWarshall use pgr_floydWarshall instead"
msgstr "pgr_apspWarshall use pgr_floydWarshall instead"

msgid "pgr_apspJohnson use pgr_Johnson instead"
msgstr "pgr_apspJohnson use pgr_Johnson instead"

msgid "pgr_kDijkstraCost use pgr_dijkstraCost instead"
msgstr "pgr_kDijkstraCost use pgr_dijkstraCost instead"

msgid "pgr_kDijkstraPath use pgr_dijkstra instead"
msgstr "pgr_kDijkstraPath use pgr_dijkstra instead"

msgid "Renamed and Deprecated Function"
msgstr "Omdöpta och utfasade funktioner"

msgid "pgr_makeDistanceMatrix renamed to _pgr_makeDistanceMatrix"
msgstr "pgr_makeDistanceMatrix renamed to _pgr_makeDistanceMatrix"

msgid "pgRouting 2.1"
msgstr "pgRouting 2.1"

msgid "pgRouting 2.1.0 Release Notes"
msgstr "Versionsinformation för pgRouting 2.1.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.1.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.1.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.1.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.1.0%22>`__"

msgid "Refactored"
msgstr "Refaktoriserad"

msgid "pgr_dijkstra(One to One)"
msgstr "pgr_dijkstra(One to One)"

msgid "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter."
msgstr "pgr_alphaShape function now can generate better (multi)polygon with holes and alpha parameter."

msgid "Proposed functions from Steve Woodbridge, (Classified as Convenience by the author.)"
msgstr "Föreslagna funktioner från Steve Woodbridge, (Klassificeras som bekvämlighet av författaren.)"

msgid "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge."
msgstr "pgr_pointToEdgeNode - convert a point geometry to a vertex_id based on closest edge."

msgid "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end."
msgstr "pgr_flipEdges - flip the edges in an array of geometries so the connect end to end."

msgid "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries."
msgstr "pgr_textToPoints - convert a string of x,y;x,y;... locations into point geometries."

msgid "pgr_pointsToVids - convert an array of point geometries into vertex ids."
msgstr "pgr_pointsToVids - convert an array of point geometries into vertex ids."

msgid "pgr_pointsToDMatrix - Create a distance matrix from an array of points."
msgstr "pgr_pointsToDMatrix - Create a distance matrix from an array of points."

msgid "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id."
msgstr "pgr_vidsToDMatrix - Create a distance matrix from an array of vertix_id."

msgid "Added proposed functions from GSoc Projects:"
msgstr "Lagt till föreslagna funktioner från GSoc Projects:"

msgid "pgr_vrppdtw"
msgstr "pgr_vrppdtw"

msgid "pgr_vrponedepot"
msgstr "pgr_vrponedepot"

msgid "pgr_getColumnName"
msgstr "pgr_getColumnName"

msgid "pgr_getTableName"
msgstr "pgr_getTableName"

msgid "pgr_isColumnCndexed"
msgstr "pgr_isColumnCndexed"

msgid "pgr_isColumnInTable"
msgstr "pgr_isColumnInTable"

msgid "pgr_quote_ident"
msgstr "pgr_quote_ident"

msgid "pgr_versionless"
msgstr "pgr_versionless"

msgid "pgr_startPoint"
msgstr "pgr_startPoint"

msgid "pgr_endPoint"
msgstr "pgr_endPoint"

msgid "pgr_pointToId"
msgstr "pgr_pointToId"

msgid "No longer supported"
msgstr "Stöds inte längre"

msgid "Removed the 1.x legacy functions"
msgstr "Borttagning av äldre funktioner från 1.x"

msgid "Some bug fixes in other functions"
msgstr "Några buggfixar i andra funktioner"

msgid "Refactoring Internal Code"
msgstr "Refaktorisering av intern kod"

msgid "A C and C++ library for developer was created"
msgstr "Ett C- och C++-bibliotek för utvecklare skapades"

msgid "encapsulates postgreSQL related functions"
msgstr "kapslar in postgreSQL-relaterade funktioner"

msgid "encapsulates Boost.Graph graphs"
msgstr "kapslar in Boost.Graph-grafer"

msgid "Directed Boost.Graph"
msgstr "Riktad Boost.graf"

msgid "Undirected Boost.graph."
msgstr "Oriktad Boost.graf."

msgid "allow any-integer in the id's"
msgstr "tillåta valfritt heltal i id:et"

msgid "allow any-numerical on the cost/reverse_cost columns"
msgstr "tillåta valfri numerisk i kostnads-/omvända_kostnadskolumnerna"

msgid "Instead of generating many libraries: - All functions are encapsulated in one library - The library has the prefix 2-1-0"
msgstr "Istället för att generera många bibliotek: - Alla funktioner är inkapslade i ett bibliotek - Biblioteket har prefixet 2-1-0"

msgid "pgRouting 2.0"
msgstr "pgRouting 2.0"

msgid "pgRouting 2.0.1 Release Notes"
msgstr "Versionsinformation för pgRouting 2.0.1"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.0.1%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.0.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.0.1%22>`__"

msgid "Minor bug fixes."
msgstr "Mindre buggfixar."

msgid "No track of the bug fixes were kept."
msgstr "Inga uppgifter om buggfixarna sparades."

msgid "pgRouting 2.0.0 Release Notes"
msgstr "Versionsinformation för pgRouting 2.0.0"

msgid "To see all issues & pull requests closed by this release see the `Github milestone for 2.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.0.0%22>`__"
msgstr "För att se alla problem och pull requests som stängts av denna release, se `Github milstolpe för 2.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.0.0%22>`__"

msgid "With the release of pgRouting 2.0.0 the library has abandoned backwards compatibility to `pgRouting 1.0`_ releases. The main Goals for this release are:"
msgstr "Med lanseringen av pgRouting 2.0.0 har biblioteket övergett bakåtkompatibilitet till `pgRouting 1.0`_-utgåvor. Huvudmålen för denna utgåva är:"

msgid "Major restructuring of pgRouting."
msgstr "Stor omstrukturering av pgRouting."

msgid "Standardization of the function naming"
msgstr "Standardisering av namngivning av funktioner"

msgid "Preparation of the project for future development."
msgstr "Förberedelse av projektet för framtida utveckling."

msgid "As a result of this effort:"
msgstr "Som ett resultat av denna insats:"

msgid "pgRouting has a simplified structure"
msgstr "pgRouting har en förenklad struktur"

msgid "Significant new functionality has being added"
msgstr "Betydande ny funktionalitet har lagts till"

msgid "Documentation has being integrated"
msgstr "Dokumentation har integrerats"

msgid "Testing has being integrated"
msgstr "Testning har integrerats"

msgid "And made it easier for multiple developers to make contributions."
msgstr "Och gjort det enklare för flera utvecklare att bidra."

msgid "Important Changes"
msgstr "Viktiga förändringar"

msgid "Graph Analytics - tools for detecting and fixing connection some problems in a graph"
msgstr "Graph Analytics - verktyg för att upptäcka och åtgärda vissa problem med kopplingar i en graf"

msgid "A collection of useful utility functions"
msgstr "En samling användbara nyttofunktioner"

msgid "Two new All Pairs Short Path algorithms (pgr_apspJohnson, pgr_apspWarshall)"
msgstr "Två nya algoritmer för korta vägar för alla par (pgr_apspJohnson, pgr_apspWarshall)"

msgid "Bi-directional Dijkstra and A-star search algorithms (pgr_bdAstar, pgr_bdDijkstra)"
msgstr "Dubbelriktade Dijkstra- och A-star-sökalgoritmer (pgr_bdAstar, pgr_bdDijkstra)"

msgid "One to many nodes search (pgr_kDijkstra)"
msgstr "Sökning från en till många noder (pgr_kDijkstra)"

msgid "K alternate paths shortest path (pgr_ksp)"
msgstr "K alternativa vägar kortaste vägen (pgr_ksp)"

msgid "New TSP solver that simplifies the code and the build process (pgr_tsp), dropped \"Gaul Library\" dependency"
msgstr "Ny TSP-lösare som förenklar koden och byggprocessen (pgr_tsp), har tagit bort beroendet av \"Gaul Library\""

msgid "Turn Restricted shortest path (pgr_trsp) that replaces Shooting Star"
msgstr "Turn Begränsad kortaste väg (pgr_trsp) som ersätter Shooting Star"

msgid "Dropped support for Shooting Star"
msgstr "Slopat stöd för Shooting Star"

msgid "Built a test infrastructure that is run before major code changes are checked in"
msgstr "Byggt upp en testinfrastruktur som körs innan större kodändringar checkas in"

msgid "Tested and fixed most all of the outstanding bugs reported against 1.x that existing in the 2.0-dev code base."
msgstr "Testat och åtgärdat de flesta av de utestående buggarna som rapporterats mot 1.x och som finns i 2.0-dev-kodbasen."

msgid "Improved build process for Windows"
msgstr "Förbättrad byggprocess för Windows"

msgid "Automated testing on Linux and Windows platforms trigger by every commit"
msgstr "Automatiserad testning på Linux- och Windows-plattformar som utlöses av varje åtagande"

msgid "Modular library design"
msgstr "Modulär biblioteksdesign"

msgid "Compatibility with PostgreSQL 9.1 or newer"
msgstr "Kompatibilitet med PostgreSQL 9.1 eller nyare"

msgid "Compatibility with PostGIS 2.0 or newer"
msgstr "Kompatibilitet med PostGIS 2.0 eller nyare"

msgid "Installs as PostgreSQL EXTENSION"
msgstr "Installeras som PostgreSQL EXTENSION"

msgid "Return types re factored and unified"
msgstr "Returtyperna är faktorerade och enhetliga"

msgid "Support for table SCHEMA in function parameters"
msgstr "Stöd för tabellen SCHEMA i funktionsparametrar"

msgid "Support for ``st_`` PostGIS function prefix"
msgstr "Stöd för PostGIS-funktionsprefixet ``st_``"

msgid "Added ``pgr_`` prefix to functions and types"
msgstr "Lagt till prefixet ``pgr_`` för funktioner och typer"

msgid "Better documentation: https://docs.pgrouting.org"
msgstr "Bättre dokumentation: https://docs.pgrouting.org"

msgid "shooting_star is discontinued"
msgstr "shooting_star är avvecklad"

msgid "pgRouting 1"
msgstr "pgRouting 1"

msgid "pgRouting 1.0"
msgstr "pgRouting 1.0"

msgid "To see the issues closed by this release see the `Git closed issues for 1.x <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+1.x%22+is%3Aclosed>`_ on Github. The following release notes have been copied from the previous ``RELEASE_NOTES`` file and are kept as a reference."
msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 1.x <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+1.x%22+is%3Aclosed>`_ på Github. Följande release notes har kopierats från den tidigare filen ``RELEASE_NOTES`` och behålls som en referens."

msgid "Changes for release 1.05"
msgstr "Ändringar för version 1.05"

msgid "Changes for release 1.03"
msgstr "Ändringar för version 1.03"

msgid "Much faster topology creation"
msgstr "Mycket snabbare skapande av topologi"

msgid "Changes for release 1.02"
msgstr "Ändringar för version 1.02"

msgid "Shooting* bug fixes"
msgstr "Fotografering* buggfixar"

msgid "Compilation problems solved"
msgstr "Kompileringsproblem lösta"

msgid "Changes for release 1.01"
msgstr "Ändringar för version 1.01"

msgid "Changes for release 1.0"
msgstr "Ändringar för version 1.0"

msgid "Core and extra functions are separated"
msgstr "Kärn- och extrafunktioner separeras"

msgid "Cmake build process"
msgstr "Byggprocess med Cmake"

msgid "Changes for release 1.0.0b"
msgstr "Ändringar för version 1.0.0b"

msgid "Additional SQL file with more simple names for wrapper functions"
msgstr "Ytterligare SQL-fil med enklare namn för wrapper-funktioner"

msgid "Changes for release 1.0.0a"
msgstr "Ändringar för version 1.0.0a"

msgid "Shooting* shortest path algorithm for real road networks"
msgstr "Algoritm för kortaste väg för verkliga vägnät"

msgid "Several SQL bugs were fixed"
msgstr "Flera SQL-buggar har åtgärdats"

msgid "Changes for release 0.9.9"
msgstr "Ändringar för version 0.9.9"

msgid "PostgreSQL 8.2 support"
msgstr "Stöd för PostgreSQL 8.2"

msgid "Shortest path functions return empty result if they could not find any path"
msgstr "Kortaste vägen-funktioner returnerar ett tomt resultat om de inte kunde hitta någon väg"

msgid "Changes for release 0.9.8"
msgstr "Ändringar för version 0.9.8"

msgid "Renumbering scheme was added to shortest path functions"
msgstr "Omnumreringssystem lades till för funktioner för kortaste vägen"

msgid "Directed shortest path functions were added"
msgstr "Directed shortest path-funktioner lades till"

msgid "routing_postgis.sql was modified to use dijkstra in TSP search"
msgstr "routing_postgis.sql modifierades för att använda dijkstra i TSP-sökning"

msgid "Function Families"
msgstr "Funktionsfamiljer"

msgid "Sample Data"
msgstr "Exempeldata"

msgid "The documentation provides very simple example queries based on a small sample network that resembles a city. To be able to execute the majority of the examples queries, follow the instructions below."
msgstr "Dokumentationen innehåller mycket enkla exempel på frågor som baseras på ett litet exempelnätverk som liknar en stad. Följ instruktionerna nedan för att kunna utföra de flesta av exempelfrågorna."

msgid "Main graph"
msgstr "Huvudgraf"

msgid "A graph consists of a set of edges and a set of vertices."
msgstr "En graf består av en uppsättning kanter och en uppsättning hörn."

msgid "The following city is to be inserted into the database:"
msgstr "Följande stad ska läggas in i databasen:"

msgid "Information known at this point is the geometry of the edges, cost values, capacity values, category values and some locations that are not in the graph."
msgstr "Information som är känd vid denna tidpunkt är geometrin för kanterna, kostnadsvärden, kapacitetsvärden, kategorivärden och vissa platser som inte finns i grafen."

msgid "The process to have working topology starts by inserting the edges. After that everything else is calculated."
msgstr "Processen för att få en fungerande topologi börjar med att lägga in kanterna. Efter det beräknas allt annat."

msgid "The database design for the documentation of pgRouting, keeps in the same row 2 segments, one in the direction of the geometry and the second in the opposite direction. Therefore some information has the ``reverse_`` prefix which corresponds to the segment on the opposite direction of the geometry."
msgstr "Databasdesignen för dokumentationen av pgRouting, håller i samma rad 2 segment, ett i geometrins riktning och det andra i motsatt riktning. Därför har viss information prefixet ``reverse_`` som motsvarar segmentet i geometrins motsatta riktning."

msgid "Identifier of the starting vertex of the geometry ``geom``."
msgstr "Identifierare av startpunkten för geometrin ``geom``."

msgid "Identifier of the ending vertex of the geometry ``geom``"
msgstr "Identifierare för geometrins slutpunkt ``geom``"

msgid "Cost to traverse from `source` to ``target``."
msgstr "Kostnad för att gå från `källa` till `mål`."

msgid "Cost to traverse from `target` to ``source``."
msgstr "Kostnad för att gå från `mål` till `källa`."

msgid "Flow capacity from `source` to ``target``."
msgstr "Flödeskapacitet från `källa` till `mål`."

msgid "Flow capacity from `target` to ``source``."
msgstr "Flödeskapacitet från `mål` till `källa`."

msgid "``category``"
msgstr "``category``"

msgid "``reverse_category``"
msgstr "``reverse_category``"

msgid ":math:`x` coordinate of the starting vertex of the geometry."
msgstr ":math:`x` coordinate of the starting vertex of the geometry."

msgid "For convenience it is saved on the table but can be calculated as ``ST_X(ST_StartPoint(geom))``."
msgstr "För enkelhetens skull sparas den i tabellen, men kan beräknas som ``ST_X(ST_StartPoint(geom))``."

msgid ":math:`y` coordinate of the ending vertex of the geometry."
msgstr ":math:`y` coordinate of the ending vertex of the geometry."

msgid "For convenience it is saved on the table but can be calculated as ``ST_Y(ST_EndPoint(geom))``."
msgstr "För enkelhetens skull sparas den i tabellen, men kan beräknas som ``ST_Y(ST_EndPoint(geom))``."

msgid "The geometry of the segments."
msgstr "Segmentens geometri."

msgid "Starting on PostgreSQL 12::"
msgstr "Börjar på PostgreSQL 12::"

msgid "Optionally indexes on different columns can be created. The recommendation is to have"
msgstr "Eventuellt kan index på olika kolumner skapas. Rekommendationen är att ha"

msgid "``id`` indexed."
msgstr "``id`` indexerad."

msgid "``source`` and ``target`` columns indexed to speed up pgRouting queries."
msgstr "kolumnerna ``källa`` och ``mål`` indexerade för att snabba upp pgRouting-frågor."

msgid "``geom`` indexed to speed up geometry processes that might be needed in the front end."
msgstr "``geom`` indexerad för att påskynda geometriska processer som kan behövas i frontend."

msgid "For this small example the indexes are skipped, except for ``id``"
msgstr "I det här lilla exemplet hoppas indexen över, utom för ``id``"

msgid "Edges data"
msgstr "Data om kanter"

msgid "Inserting into the database the information of the edges:"
msgstr "Lägga in informationen om kanterna i databasen:"

msgid "Negative values on the cost, capacity and category means that the edge do not exist."
msgstr "Negativa värden på kostnad, kapacitet och kategori innebär att kanten inte existerar."

msgid "Vertices"
msgstr "Hörn"

msgid "The vertex information is calculated based on the identifier of the edge and the geometry and saved on a table. Saving all the information provided by :doc:`pgr_extractVertices`:"
msgstr "Vertexinformationen beräknas utifrån kantidentifieraren och geometrin och sparas i en tabell. Sparar all information som tillhandahålls av :doc:`pgr_extractVertices`:"

msgid "In this case the because the ``CREATE`` statement was not used, the definition of an index on the table is needed."
msgstr "I det här fallet, eftersom ``CREATE``-satsen inte användes, behövs definitionen av ett index på tabellen."

msgid "The structure of the table is:"
msgstr "Tabellens struktur är:"

msgid "Vertices data"
msgstr "Data om vertikaler"

msgid "The saved information of the vertices is:"
msgstr "Den sparade informationen om topparna är:"

msgid "Here is where adding more columns to the vertices table can be done. Additional columns names and types will depend on the application."
msgstr "Här kan du lägga till fler kolumner i tabellen vertices. Namn och typer på ytterligare kolumner beror på tillämpningen."

msgid "The topology"
msgstr "Topologin"

msgid "This queries based on the vertices data create a topology by filling the ``source`` and ``target`` columns in the edges table."
msgstr "Denna fråga baseras på toppdata och skapar en topologi genom att fylla i kolumnerna \"källa\" och \"mål\" i tabellen \"kanter\"."

msgid "Topology data"
msgstr "Topologidata"

msgid "Points outside the graph"
msgstr "Punkter utanför grafen"

msgid "Support tables"
msgstr "Stödbord"

msgid "Many functions can be used with a combinations of ``(source, target)`` pairs when wanting a route from ``source`` to ``target``."
msgstr "Många funktioner kan användas med kombinationer av paren ``(källa, mål)`` när man vill ha en rutt från ``källa`` till ``mål``."

msgid "For convenience of this documentation, some combinations will be stored on a table:"
msgstr "För att underlätta denna dokumentation kommer vissa kombinationer att lagras på en tabell:"

msgid "Inserting the data:"
msgstr "Infoga data:"

msgid "Combinations data"
msgstr "Kombinationer data"

msgid "Some functions accept soft restrictions about the segments."
msgstr "Vissa funktioner accepterar mjuka begränsningar för segmenten."

msgid "Images"
msgstr "Bilder"

msgid "Red arrows correspond when ``cost`` > 0 in the edge table."
msgstr "Röda pilar motsvarar när ``cost`` > 0 i kanttabellen."

msgid "Blue arrows correspond when ``reverse_cost`` > 0 in the edge table."
msgstr "Blå pilar motsvarar när ``reverse_cost`` > 0 i edge-tabellen."

msgid "Points are outside the graph."
msgstr "Punkterna ligger utanför grafen."

msgid "Click on the graph to enlarge."
msgstr "Klicka på grafen för att förstora den."

msgid "Directed graph with ``cost`` and ``reverse_cost``"
msgstr "Riktad graf med ``kostnad`` och ``omvänd_kostnad``"

msgid "When working with city networks, this is recommended for point of view of vehicles."
msgstr "När du arbetar med stadsnät rekommenderas detta för fordonens synvinkel."

msgid "Directed, with cost and reverse_cost"
msgstr "Riktad, med kostnad och omvänd_kostnad"

msgid "Undirected graph with ``cost`` and ``reverse_cost``"
msgstr "Oriktad graf med ``kostnad`` och ``omvända_kostnader``"

msgid "When working with city networks, this is recommended for point of view of pedestrians."
msgstr "När du arbetar med stadsnät rekommenderas detta för fotgängarnas synvinkel."

msgid "Undirected, with cost and reverse cost"
msgstr "Ostyrd, med kostnad och omvänd kostnad"

msgid "Directed graph with ``cost``"
msgstr "Riktad graf med ``kostnad``"

msgid "Directed, with cost"
msgstr "Riktad, med kostnad"

msgid "Undirected graph with ``cost``"
msgstr "Oriktad graf med ``kostnad``"

msgid "Undirected, with cost"
msgstr "Ostyrd, med kostnad"

msgid "Pick & Deliver Data"
msgstr "Hämta och leverera data"

msgid "Spanning Tree - Category"
msgstr "Spanning Tree - Kategori"

msgid "A spanning tree of an undirected graph is a tree that includes all the vertices of G with the minimum possible number of edges."
msgstr "Ett spännträd för en odelad graf är ett träd som innehåller alla hörn i G med minsta möjliga antal kanter."

msgid "For a disconnected graph, there there is no single tree, but a spanning forest, consisting of a spanning tree of each connected component."
msgstr "För en frånkopplad graf finns det inte ett enda träd, utan en spänningsskog, som består av ett spänningsträd för varje ansluten komponent."

msgid "Characteristics:"
msgstr "Kännetecken:"

msgid "pgRouting community support is available through the `pgRouting website <https://pgrouting.org/support.html>`_, `documentation <https://docs.pgrouting.org>`_, tutorials, mailing lists and others. If you’re looking for :ref:`commercial support <support_commercial>`, find below a list of companies providing pgRouting development and consulting services."
msgstr "pgRouting community support är tillgängligt via `pgRouting webbplats <https://pgrouting.org/support.html>`_, `dokumentation <https://docs.pgrouting.org>`_, handledning, e-postlistor och andra. Om du letar efter :ref:`kommersiellt stöd <support_commercial>`, hittar du nedan en lista över företag som tillhandahåller pgRouting-utveckling och konsulttjänster."

msgid "Reporting Problems"
msgstr "Rapportering av problem"

msgid "Bugs are reported and managed in an `issue tracker <https://github.com/pgrouting/pgrouting/issues>`_. Please follow these steps:"
msgstr "Buggar rapporteras och hanteras i en `issue tracker <https://github.com/pgrouting/pgrouting/issues>`_. Vänligen följ dessa steg:"

msgid "Search the tickets to see if your problem has already been reported. If so, add any extra context you might have found, or at least indicate that you too are having the problem. This will help us prioritize common issues."
msgstr "Sök bland ärendena för att se om ditt problem redan har rapporterats. Om så är fallet kan du lägga till extra sammanhang som du kan ha hittat, eller åtminstone ange att du också har problemet. Detta hjälper oss att prioritera vanliga problem."

msgid "If your problem is unreported, create a `new issue <https://github.com/pgRouting/pgrouting/issues/new>`__ for it."
msgstr "Om ditt problem inte har rapporterats, skapa en ny fråga <https://github.com/pgRouting/pgrouting/issues/new>`__ för det."

msgid "In your report include explicit instructions to replicate your issue. The best tickets include the exact SQL necessary to replicate a problem."
msgstr "I din rapport inkluderar du uttryckliga instruktioner för att replikera ditt problem. De bästa ärendena innehåller den exakta SQL som krävs för att replikera ett problem."

msgid "If you can test older versions of PostGIS for your problem, please do. On your ticket, note the earliest version the problem appears."
msgstr "Om du kan testa äldre versioner av PostGIS för ditt problem, vänligen gör det. Notera den tidigaste versionen som problemet uppträder i ditt ärende."

msgid "For the versions where you can replicate the problem, note the operating system and version of pgRouting, PostGIS and PostgreSQL."
msgstr "För de versioner där du kan replikera problemet, notera operativsystemet och versionen av pgRouting, PostGIS och PostgreSQL."

msgid "It is recommended to use the following wrapper on the problem to pin point the step that is causing the problem."
msgstr "Vi rekommenderar att du använder följande wrapper på problemet för att hitta det steg som orsakar problemet."

msgid "Mailing List, Matrix, GIS StackExchange"
msgstr "Mailinglista, matris, GIS StackExchange"

msgid "There are two mailing lists for pgRouting hosted on OSGeo discourse server:"
msgstr "Det finns två e-postlistor för pgRouting som är värd på OSGeo diskurserver:"

msgid "User mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/"
msgstr "E-postlista för användare: https://discourse.osgeo.org/c/pgrouting/pgrouting-users/"

msgid "Developer mailing list: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/"
msgstr "E-postlista för utvecklare: https://discourse.osgeo.org/c/pgrouting/pgrouting-dev/"

msgid "Subscribe: https://discourse.osgeo.org/g/pgrouting-dev"
msgstr "Prenumerera: https://discourse.osgeo.org/g/pgrouting-dev"

msgid "For general questions and topics about how to use pgRouting, please write to the user mailing list."
msgstr "För allmänna frågor och ämnen om hur du använder pgRouting, vänligen skriv till e-postlistan för användare."

msgid "If you want to chat with fellow pgRouting users and contributors, you can join our matrix channel: `pgRouting matrix channel <https://matrix.to/#/#pgrouting:osgeo.org>`_."
msgstr "Om du vill chatta med andra pgRouting-användare och bidragsgivare kan du gå med i vår matriskanal: `pgRouting matriskanal <https://matrix.to/#/#pgrouting:osgeo.org>`_."

msgid "You can also ask at `GIS StackExchange <https://gis.stackexchange.com/>`_ and tag the question with ``pgrouting``. Find all questions tagged with ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting or subscribe to the `pgRouting questions feed <https://gis.stackexchange.com/feeds/tag?tagnames=pgrouting&sort=newest>`_."
msgstr "Du kan också ställa frågan på `GIS StackExchange <https://gis.stackexchange.com/>`_ och märka frågan med ``pgrouting``. Hitta alla frågor taggade med ``pgrouting`` under https://gis.stackexchange.com/questions/tagged/pgrouting eller prenumerera på `pgRouting questions feed <https://gis.stackexchange.com/feeds/tag?tagnames=pgrouting&sort=newest>`_."

msgid "Commercial Support"
msgstr "Kommersiellt stöd"

msgid "For users who require professional support, development and consulting services, consider contacting any of the following organizations, which have significantly contributed to the development of pgRouting:"
msgstr "För användare som behöver professionell support, utveckling och konsulttjänster kan du överväga att kontakta någon av följande organisationer, som har bidragit väsentligt till utvecklingen av pgRouting:"

msgid "**Company**"
msgstr "**Company**"

msgid "**Offices in**"
msgstr "**Kontor i**"

msgid "**Website**"
msgstr "**Webbplats**"

msgid "Germany, Japan"
msgstr "Tyskland, Japan"

msgid "https://georepublic.info"
msgstr "https://georepublic.info"

msgid "United States"
msgstr "USA"

msgid "https://www.paragoncorporation.com"
msgstr "https://www.paragoncorporation.com"

msgid "Netlab"
msgstr "Netlab"

msgid "Capranica, Italy"
msgstr "Capranica, Italien"

msgid "https://www.osgeo.org/service-providers/netlab/"
msgstr "https://www.osgeo.org/service-providers/netlab/"

msgid "Transformation - Family of functions"
msgstr "Transformation - Familj av funktioner"

msgid "This family of functions is used for transforming a given input graph :math:`G(V,E)` into a new graph :math:`G'(V',E')`."
msgstr "Denna familj av funktioner används för att omvandla en given indatagraf :math:`G(V,E)` till en ny graf :math:`G'(V',E')`."

msgid "Traversal - Family of functions"
msgstr "Traversal - Familj av funktioner"

msgid "Utility functions"
msgstr "Verktygsfunktioner"

msgid "Via - Category"
msgstr "Via - Kategori"

msgid "This category intends to solve the general problem:"
msgstr "Denna kategori avser att lösa det allmänna problemet:"

msgid "Given a graph and a list of vertices, find the shortest path between :math:`vertex_i` and :math:`vertex_{i+1}` for all vertices"
msgstr "Givet en graf och en lista med toppar, hitta den kortaste vägen mellan :math:`vertex_i` och :math:`vertex_{i+1}` för alla toppar"

msgid "In other words, find a continuous route that visits all the vertices in the order given."
msgstr "Med andra ord, hitta en kontinuerlig rutt som besöker alla toppar i den ordning som anges."

msgid "path"
msgstr "väg"

msgid "represents a section of a **route**."
msgstr "representerar en del av en **rutt**."

msgid "route"
msgstr "rutt"

msgid "is a sequence of **paths**"
msgstr "är en sekvens av **vägar**"

msgid "**Used in:**"
msgstr "**Används i:**"

msgid "Besides the compulsory parameters each function has, there are optional parameters that exist due to the kind of function."
msgstr "Förutom de obligatoriska parametrar som varje funktion har, finns det valfria parametrar som beror på vilken typ av funktion det är."

msgid "Used in all Via functions"
msgstr "Används i alla Via-funktioner"

msgid "Depending on the function one or more inner queries are needed."
msgstr "Beroende på funktion behövs en eller flera inre frågor."

msgid "withPoints - Category"
msgstr "withPoints - Kategori"

msgid "When points are added to the graph."
msgstr "När punkter läggs till i diagrammet."

msgid "The **with points** category modifies the graph on the fly by adding points on edges as required by the `Points SQL`_ query."
msgstr "Kategorin **with points** ändrar grafen i farten genom att lägga till punkter på kanterna enligt vad som krävs av SQL-frågan `Points`_."

msgid "The functions within this category give the ability to process between arbitrary points located outside the original graph."
msgstr "Funktionerna inom denna kategori ger möjlighet att bearbeta mellan godtyckliga punkter utanför den ursprungliga grafen."

msgid "This category of functions was thought for routing vehicles, but might as well work for some other application not involving vehicles."
msgstr "Denna kategori av funktioner var tänkt för att dirigera fordon, men kan lika gärna fungera för någon annan applikation som inte involverar fordon."

msgid "When given a point identifier ``pid`` that its being mapped to an edge with an identifier ``edge_id``, with a fraction from the source to the target along the edge ``fraction`` and some additional information about which side of the edge the point is on ``side``, then processing from arbitrary points can be done on fixed networks."
msgstr "När man får en punktidentifierare ``pid`` som mappas till en kant med en identifierare ``edge_id``, med en fraktion från källan till målet längs kanten ``fraktion`` och lite ytterligare information om vilken sida av kanten punkten ligger på ``side``, kan bearbetning från godtyckliga punkter göras på fasta nätverk."

msgid "All this functions consider as many traits from the \"real world\" as possible:"
msgstr "Alla dessa funktioner tar hänsyn till så många egenskaper från den \"verkliga världen\" som möjligt:"

msgid "Kind of graph:"
msgstr "Typ av graf:"

msgid "**directed** graph"
msgstr "**directed** graph"

msgid "**undirected** graph"
msgstr "**Omdirigerad** graf"

msgid "Arriving at the point:"
msgstr "Anländer till punkten:"

msgid "Compulsory arrival on the side of the segment where the point is located."
msgstr "Obligatorisk ankomst på den sida av segmentet där punkten är belägen."

msgid "On either side of the segment."
msgstr "På vardera sidan om segmentet."

msgid "Countries with:"
msgstr "Länder med:"

msgid "**Right** side driving"
msgstr "*körning på *höger** sida"

msgid "**Left** side driving"
msgstr "**Vänster** sida körning"

msgid "Some points are:"
msgstr "Några punkter är:"

msgid "**Permanent**: for example the set of points of clients stored in a table in the data base."
msgstr "**Permanent**: t.ex. en uppsättning punkter för kunder som lagras i en tabell i databasen."

msgid "The graph has been modified to permanently have those points as vertices."
msgstr "Grafen har ändrats så att den permanent har dessa punkter som hörn."

msgid "There is a table on the database that describes the points"
msgstr "Det finns en tabell i databasen som beskriver punkterna"

msgid "**Temporal**: for example points given through a web application"
msgstr "**Temporal**: till exempel punkt som ges via en webbapplikation"

msgid "The numbering of the points are handled with negative sign."
msgstr "Numreringen av punkterna hanteras med negativt tecken."

msgid "This sign change is to avoid confusion when there is a vertex with the same identifier as the point identifier."
msgstr "Denna teckenändring är till för att undvika förvirring när det finns en topp med samma identifierare som punktens identifierare."

msgid "Original point identifiers are to be positive."
msgstr "Ursprungliga punktidentifierare ska vara positiva."

msgid "Transformation to negative is done internally."
msgstr "Omvandling till negativ sker internt."

msgid "Interpretation of the sign on the node information of the output"
msgstr "Tolkning av tecknet på noden information om utdata"

msgid "positive sign is a vertex of the original graph"
msgstr "positivt tecken är ett toppunkt i den ursprungliga grafen"

msgid "negative sign is a point of the `Points SQL`_"
msgstr "negativt tecken är en punkt i `Points SQL`_"

msgid "About points"
msgstr "Om punkt"

msgid "For this section the following city (see :doc:`sampledata`) some interesting points such as restaurant, supermarket, post office, etc. will be used as example."
msgstr "I detta avsnitt kommer följande stad (se :doc:`sampledata`) att användas som exempel: några intressanta punkter såsom restaurang, snabbköp, postkontor etc."

msgid "The graph is **directed**"
msgstr "Grafen är **riktad**"

msgid "Red arrows show the ``(source, target)`` of the edge on the edge table"
msgstr "Röda pilar visar ``(källa, mål)`` för kanten i kanttabellen"

msgid "Blue arrows show the ``(target, source)`` of the edge on the edge table"
msgstr "Blå pilar visar ``(mål, källa)`` för kanten i kanttabellen"

msgid "Each point location shows where it is located with relation of the edge ``(source, target)``"
msgstr "Varje punktposition visar var den är belägen i förhållande till kanten ``(källa, mål)``"

msgid "On the right for points **2** and **4**."
msgstr "Till höger för punkterna **2** och **4**."

msgid "On the left for points **1**, **3** and **5**."
msgstr "Till vänster för punkterna **1**, **3** och **5**."

msgid "On both sides for point **6**."
msgstr "På båda sidor för punkt **6**."

msgid "The representation on the data base follows the `Points SQL`_ description, and for this example:"
msgstr "Representationen på databasen följer `Points SQL`_-beskrivningen, och för detta exempel:"

msgid "Driving side"
msgstr "Körning på sidan"

msgid "In the following images:"
msgstr "I följande bilder:"

msgid "The squared vertices are the temporary vertices,"
msgstr "De kvadrerade topparna är de tillfälliga topparna,"

msgid "The temporary vertices are added according to the driving side,"
msgstr "De tillfälliga topparna läggs till enligt körsidan,"

msgid "visually showing the differences on how depending on the driving side the data is interpreted."
msgstr "visar visuellt skillnaderna i hur data tolkas beroende på vilken sida som kör."

msgid "Point **1** located on edge ``(6, 5)``"
msgstr "Punkt **1** belägen på kanten ``(6, 5)``"

msgid "Point **2** located on edge ``(16, 17)``"
msgstr "Punkt **2** belägen på kanten ``(16, 17)``"

msgid "Point **3** located on edge ``(8, 12)``"
msgstr "Punkt **3** belägen på kanten ``(8, 12)``"

msgid "Point **4** located on edge ``(1, 3)``"
msgstr "Punkt **4** belägen på kanten ``(1, 3)``"

msgid "Point **5** located on edge ``(10, 11)``"
msgstr "Punkt **5** belägen på kanten ``(10, 11)``"

msgid "Point **6** located on edges ``(6, 7)`` and ``(7, 6)``"
msgstr "Punkt **6** belägen på kanterna ``(6, 7)`` och ``(7, 6)``"

msgid "Point **1** located on edge ``(5, 6)``"
msgstr "Punkt **1** belägen på kanten ``(5, 6)``"

msgid "Point **2** located on edge ``(17, 16)``"
msgstr "Punkt **2** belägen på kanten ``(17, 16)``"

msgid "Point **4** located on edge ``(3, 1)``"
msgstr "Punkt **4** belägen på kanten ``(3, 1)``"

msgid "Like having all points to be considered in both sides ``b``"
msgstr "Som att ha alla punkter att överväga på båda sidor ``b``"

msgid "Preferred usage on **undirected** graphs"
msgstr "Företrädesvis användning på **undirected** grafer"

msgid "On the :doc:`TRSP-family` this option is not valid"
msgstr "På :doc:`TRSP-family` är detta alternativ inte giltigt"

msgid "Point **1** located on edge ``(5, 6)`` and ``(6, 5)``"
msgstr "Punkt **1** belägen på kanten ``(5, 6)`` och ``(6, 5)``"

msgid "Point **2** located on edge ``(17, 16)``and ``16, 17``"
msgstr "Punkt **2** belägen på kanten ``(17, 16)`` och ``16, 17``"

msgid "Point **4** located on edge ``(3, 1)`` and ``(1, 3)``"
msgstr "Punkt **4** belägen på kanten ``(3, 1)`` och ``(1, 3)``"

msgid "Creating temporary vertices"
msgstr "Skapa tillfälliga vertikaler"

msgid "This section will demonstrate how a temporary vertex is created internally on the graph."
msgstr "I detta avsnitt visas hur ett tillfälligt toppunkt skapas internt i grafen."

msgid "Problem"
msgstr "Problem"

msgid "For edge:"
msgstr "För kant:"

msgid "insert point:"
msgstr "infoga punkt:"

msgid "On a right hand side driving network"
msgstr "På ett körfält med höger sida"

msgid "Arrival to point ``-2`` can be achieved only via vertex **16**."
msgstr "Ankomst till punkt ``-2`` kan endast ske via toppunkt **16**."

msgid "Does not affects edge ``(17, 16)``, therefore the edge is kept."
msgstr "Påverkar inte kanten ``(17, 16)``, därför behålls kanten."

msgid "It only affects the edge ``(16, 17)``, therefore the edge is removed."
msgstr "Det påverkar bara kanten ``(16, 17)``, därför tas kanten bort."

msgid "Create two new edges:"
msgstr "Skapa två nya kanter:"

msgid "Edge ``(16, -2)`` with cost ``0.4`` (original cost * fraction == :math:`1 * 0.4`)"
msgstr "Kant ``(16, -2)`` med kostnad ``0.4`` (ursprunglig kostnad * fraktion == :math:`1 * 0.4`)"

msgid "Edge ``(-2, 17)`` with cost ``0.6`` (the remaining cost)"
msgstr "Kant ``(-2, 17)`` med kostnad ``0,6`` (den återstående kostnaden)"

msgid "The total cost of the additional edges is equal to the original cost."
msgstr "Den totala kostnaden för de extra kanterna är lika stor som den ursprungliga kostnaden."

msgid "If more points are on the same edge, the process is repeated recursevly."
msgstr "Om fler punkter ligger på samma kant upprepas processen om och om igen."

msgid "On a left hand side driving network"
msgstr "På en vänster sida av körfältet"

msgid "Arrival to point ``-2`` can be achieved only via vertex **17**."
msgstr "Ankomst till punkt ``-2`` kan endast ske via toppunkt **17**."

msgid "Does not affects edge ``(16, 17)``, therefore the edge is kept."
msgstr "Påverkar inte kanten ``(16, 17)``, därför behålls kanten."

msgid "It only affects the edge ``(17, 16)``, therefore the edge is removed."
msgstr "Det påverkar bara kanten ``(17, 16)``, därför tas kanten bort."

msgid "Work with the original edge ``(16, 17)`` as the fraction is a fraction of the original:"
msgstr "Arbeta med den ursprungliga kanten ``(16, 17)`` eftersom bråkdelen är en bråkdel av den ursprungliga:"

msgid "Flip the Edges and add them to the graph:"
msgstr "Vänd på kanterna och lägg till dem i grafen:"

msgid "Edge ``(17, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph."
msgstr "Kanten ``(17, -2)`` blir ``(-2, 16)`` med kostnaden ``0,4`` och läggs till i grafen."

msgid "Edge ``(-2, 16)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph."
msgstr "Kanten ``(-2, 16)`` blir ``(17, -2)`` med kostnaden ``0,6`` och läggs till i grafen."

msgid "When driving side does not matter"
msgstr "När körsidan inte spelar någon roll"

msgid "Arrival to point ``-2`` can be achieved via vertices **16** or **17**."
msgstr "Ankomst till punkt ``-2`` kan uppnås via topparna **16** eller **17**."

msgid "Affects the edges ``(16, 17)`` and ``(17, 16)``, therefore the edges are removed."
msgstr "Påverkar kanterna ``(16, 17)`` och ``(17, 16)``, därför tas kanterna bort."

msgid "Create four new edges:"
msgstr "Skapa fyra nya kanter:"

msgid "Flip the Edges and add all the edges to the graph:"
msgstr "Vänd på Edges och lägg till alla kanter i grafen:"

msgid "Edge ``(16, -2)`` is added to the graph."
msgstr "Kanten ``(16, -2)`` läggs till i grafen."

msgid "Edge ``(-2, 17)`` is added to the graph."
msgstr "Kanten ``(-2, 17)`` läggs till i grafen."

msgid "Edge ``(16, -2)`` becomes ``(-2, 16)`` with cost ``0.4`` and is added to the graph."
msgstr "Kanten ``(16, -2)`` blir ``(-2, 16)`` med kostnaden ``0,4`` och läggs till i grafen."

msgid "Edge ``(-2, 17)`` becomes ``(17, -2)`` with cost ``0.6`` and is added to the graph."
msgstr "Kanten ``(-2, 17)`` blir ``(17, -2)`` med kostnaden ``0,6`` och läggs till i grafen."

msgid "withPoints - Family of functions"
msgstr "withPoints - Familj av funktioner"

msgid "This family of functions belongs to the :doc:`withPoints-category` and the functions that compose them are based one way or another on dijkstra algorithm."
msgstr "Denna familj av funktioner tillhör :doc:`withPoints-category` och de funktioner som ingår i dem är på ett eller annat sätt baserade på dijkstra-algoritmen."

msgid "Depending on the name:"
msgstr "Beroende på namnet:"

msgid "pgr_withPoints is pgr_dijkstra **with points**"
msgstr "pgr_withPoints is pgr_dijkstra **with points**"

msgid "pgr_withPointsCost is pgr_dijkstraCost **with points**"
msgstr "pgr_withPointsCost is pgr_dijkstraCost **with points**"

msgid "pgr_withPointsCostMatrix is pgr_dijkstraCostMatrix **with points**"
msgstr "pgr_withPointsCostMatrix is pgr_dijkstraCostMatrix **with points**"

msgid "pgr_withPointsKSP is pgr_ksp **with points**"
msgstr "pgr_withPointsKSP is pgr_ksp **with points**"

msgid "pgr_withPointsDD is pgr_drivingDistance **with points**"
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 "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara"
#~ msgstr "Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara"

#~ msgid "No changes yet"
#~ msgstr "Inga ändringar ännu"

#~ msgid "See also"
#~ msgstr "Se även"

#~ msgid "``pgr_bellmanFord - Experimental``"
#~ msgstr "``pgr_bellmanFord - Experimentell``"

#~ msgid "It is expected to terminate faster than pgr_aStar"
#~ msgstr "Den förväntas avslutas snabbare än pgr_aStar"

#~ msgid "pgRouting 4.0.0 Release Notes"
#~ msgstr "pgRouting 4.0.0 Release Notes"

#, fuzzy
#~ msgid "The user's documentation is build by default"
#~ msgstr "För användardokumentation"

#, fuzzy
#~ msgid "The translated languages (en, es, sv, zh_Hans) HTML documentation is build by default"
#~ msgstr "För användardokumentation"

#, fuzzy
#~ msgid "Developers's Documentation is not build when"
#~ msgstr "För dokumentation för utvecklare"

#~ msgid "New experimental functions"
#~ msgstr "Nya experimentella funktioner"

#, fuzzy
#~ msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__: pgr_DAGshortestPath"
#~ msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ pgr_DAGshortestPath"

#, fuzzy
#~ msgid "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__: pgr_turnRestrictedPaths"
#~ msgstr "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__ pgr_turnRestrictedPaths"

#~ msgid "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__: pgr_trspviaedges"
#~ msgstr "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__: pgr_trspviaedges"

#~ msgid "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__: pgr_trspviavertices"
#~ msgstr "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__: pgr_trspviavertices"

#, fuzzy
#~ msgid "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ _pgr_alphashape(text,double precision)"
#~ msgstr "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__: pgr_alphaShape"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_checkverttab(text,text[],integer,text)"
#~ msgstr "`#2827 <https://github.com/pgRouting/pgrouting/issues/2827>`__: pgr_createVerticesTable"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_createindex(text,text,text,integer,text)"
#~ msgstr "`#2786 <https://github.com/pgRouting/pgrouting/issues/2786>`__: pgr_contraction(edges) ny signatur"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_createindex(text,text,text,text,integer,text)"
#~ msgstr "`#2786 <https://github.com/pgRouting/pgrouting/issues/2786>`__: pgr_contraction(edges) ny signatur"

#, fuzzy
#~ msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean)"
#~ msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ pgr_DAGshortestPath"

#, fuzzy
#~ msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagshortestpath(text,text,boolean,boolean)"
#~ msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ pgr_DAGshortestPath"

#, fuzzy
#~ msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_dijkstra(Kombinationer)"

#, fuzzy
#~ msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_dijkstra(Kombinationer)"

#, fuzzy
#~ msgid "`#2730 <https://github.com/pgRouting/pgrouting/issues/2730>`__ _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_dijkstra(Kombinationer)"

#, fuzzy
#~ msgid "`#2735 <https://github.com/pgRouting/pgrouting/issues/2735>`__ _pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)"
#~ msgstr "#2735 _pgr_drivingdistance(text,valfri matris,dubbel precision,boolean,boolean)"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_endpoint(geometry)"
#~ msgstr "`#2886 <https://github.com/pgRouting/pgrouting/issues/2886>`__: pgr_nodeNetwork"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_getcolumnname(text,text,integer,text)"
#~ msgstr "`#2886 <https://github.com/pgRouting/pgrouting/issues/2886>`__: pgr_nodeNetwork"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_getcolumnname(text,text,text,integer,text)"
#~ msgstr "`#2786 <https://github.com/pgRouting/pgrouting/issues/2786>`__: pgr_contraction(edges) ny signatur"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_getcolumntype(text,text,integer,text)"
#~ msgstr "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__: pgr_trspviaedges"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_getcolumntype(text,text,text,integer,text)"
#~ msgstr "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__: pgr_trspviaedges"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_gettablename(text,integer,text)"
#~ msgstr "`#2886 <https://github.com/pgRouting/pgrouting/issues/2886>`__: pgr_nodeNetwork"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_iscolumnindexed(text,text,integer,text)"
#~ msgstr "`#2886 <https://github.com/pgRouting/pgrouting/issues/2886>`__: pgr_nodeNetwork"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_iscolumnindexed(text,text,text,integer,text)"
#~ msgstr "`#2786 <https://github.com/pgRouting/pgrouting/issues/2786>`__: pgr_contraction(edges) ny signatur"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_iscolumnintable(text,text)"
#~ msgstr "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__: pgr_trspviaedges"

#, fuzzy
#~ msgid "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__ _pgr_maxcardinalitymatch(text,boolean)"
#~ msgstr "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__: pgr_maxCardinalityMatch"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_startpoint(geometry)"
#~ msgstr "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__: pgr_trspviaedges"

#, fuzzy
#~ msgid "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__ _pgr_trspviavertices(text,integer[],boolean,boolean,text)"
#~ msgstr "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__: pgr_trspviavertices"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"
#~ msgstr "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"
#~ msgstr "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,tecken,boolean)"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ _pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)"
#~ msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__ pgr_trsp_withPoints"

#, fuzzy
#~ msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ _pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
#~ msgstr "#2901 _pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)"

#, fuzzy
#~ msgid "`#2861 <https://github.com/pgRouting/pgrouting/issues/2861>`__ _pgr_versionless(text,text)"
#~ msgstr "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__: pgr_trspviaedges"

#, fuzzy
#~ msgid "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ _pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)"
#~ msgstr "#2890 _pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)"

#, fuzzy
#~ msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)"
#~ msgstr "#2895 _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean,boolean)"

#, fuzzy
#~ msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"
#~ msgstr "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"

#, fuzzy
#~ msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ _pgr_withpointsksp(text,text,text,integer,character,boolean,boolean,boolean)"
#~ msgstr "#2895 _pgr_withpointsksp(text,text,text,heltal,tecken,boolean,boolean,boolean)"

#, fuzzy
#~ msgid "`#2741 <https://github.com/pgRouting/pgrouting/issues/2741>`__ _pgr_withpointsvia(text,bigint[],double precision[],boolean)"
#~ msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__ pgr_withPointsVia"

#, fuzzy
#~ msgid "`#2741 <https://github.com/pgRouting/pgrouting/issues/2741>`__ _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"
#~ msgstr "#2741 _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)"

#, fuzzy
#~ msgid "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__ pgr_maxcardinalitymatch(text,boolean)"
#~ msgstr "`#2899 <https://github.com/pgRouting/pgrouting/issues/2899>`__: pgr_maxCardinalityMatch"

#, fuzzy
#~ msgid "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__ pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)"
#~ msgstr "`#2681 <https://github.com/pgRouting/pgrouting/issues/2681>`__: pgr_trspviaedges"

#, fuzzy
#~ msgid "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__ pgr_trspviavertices(text,anyarray,boolean,boolean,text)"
#~ msgstr "`#2682 <https://github.com/pgRouting/pgrouting/issues/2682>`__: pgr_trspviavertices"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"
#~ msgstr "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"
#~ msgstr "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,tecken,boolean)"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)"
#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)"
#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)"
#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,tecken,boolean)"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)"
#~ msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__ pgr_trsp_withPoints"

#, fuzzy
#~ msgid "`#2901 <https://github.com/pgRouting/pgrouting/issues/2901>`__ pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
#~ msgstr "#2901 _pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withpointscostmatrix(text,text,anyarray,boolean,character)"
#~ msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ pgr_withPointsCostMatrix"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)"
#~ msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ pgr_withPointsCostMatrix"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withpointscost(text,text,anyarray,bigint,boolean,character)"
#~ msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ pgr_withPointsCostMatrix"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withpointscost(text,text,bigint,anyarray,boolean,character)"
#~ msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ pgr_withPointsCostMatrix"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withpointscost(text,text,bigint,bigint,boolean,character)"
#~ msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ pgr_withPointsCostMatrix"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withpointscost(text,text,text,boolean,character)"
#~ msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ pgr_withPointsCostMatrix"

#, fuzzy
#~ msgid "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)"
#~ msgstr "#2890 _pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)"

#, fuzzy
#~ msgid "`#2890 <https://github.com/pgRouting/pgrouting/issues/2890>`__ pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)"
#~ msgstr "#2890 pgr_withpointsdd(text,text,bigint,dubbel precision,boolean,tecken,boolean)"

#, fuzzy
#~ msgid "`#2895 <https://github.com/pgRouting/pgrouting/issues/2895>`__ pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"
#~ msgstr "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)"
#~ msgstr "#2919 pgr_withpoints(text,text,valfri matris,valfri matris,boolean,tecken,boolean)"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)"
#~ msgstr "#2919 pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)"
#~ msgstr "#2919 pgr_withpoints(text,text,bigint,anyarray,boolean,tecken,boolean)"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)"
#~ msgstr "#2919 pgr_withpoints(text,text,bigint,bigint,boolean,tecken,boolean)"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withpoints(text,text,text,boolean,character,boolean)"
#~ msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ pgr_withPointsCost"

#, fuzzy
#~ msgid "`#2919 <https://github.com/pgRouting/pgrouting/issues/2919>`__ pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"
#~ msgstr "#2919 pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)"

#~ msgid "_pgr_drivingdistance => _pgr_drivingdistancev4"
#~ msgstr "_pgr_drivingdistance => _pgr_drivingdistancev4"

#~ msgid "_pgr_withpointsdd => _pgr_withpointsddv4"
#~ msgstr "_pgr_withpointsdd => _pgr_withpointsddv4"

#~ msgid "_pgr_withpointsksp => _pgr_withpointsksp_v4"
#~ msgstr "_pgr_withpointsksp => _pgr_withpointsksp_v4"

#~ msgid "_pgr_trspvia_withpoints => _pgr_trspvia_withpoints_v4"
#~ msgstr "_pgr_trspvia_withpoints => _pgr_trspvia_withpoints_v4"

#~ msgid "_pgr_trsp_withpoints => _pgr_trsp_withpoints_v4"
#~ msgstr "_pgr_trsp_withpoints => _pgr_trsp_withpoints_v4"

#~ msgid "_pgr_withpointsvia => _pgr_withpointsvia_v4"
#~ msgstr "_pgr_withpointsvia => _pgr_withpointsvia_v4"

#, fuzzy
#~ msgid "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__ _pgr_alphashape"
#~ msgstr "`#2748 <https://github.com/pgRouting/pgrouting/issues/2748>`__: pgr_alphaShape"

#, fuzzy
#~ msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ _pgr_dagshortestpath"
#~ msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ pgr_DAGshortestPath"

#~ msgid "The ``pgr_aStarCost`` function summarizes of the cost of the shortest path using the A* algorithm."
#~ msgstr "Funktionen ``pgr_aStarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av A*-algoritmen."

#~ msgid "The results are equivalent to the union of the results of the pgr_bdAStar(One to One) on the:"
#~ msgstr "Resultaten motsvarar sammanslagningen av resultaten av pgr_bdAStar(One to One) på:"

#~ msgid "The ``pgr_bdAstarCost`` function summarizes of the cost of the shortest path using the bidirectional A* algorithm."
#~ msgstr "Funktionen ``pgr_bdAstarCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade A*-algoritmen."

#~ msgid "``pgr_bdAstarCostMatrix`` - Calculates the a cost matrix using :doc:`pgr_aStar`."
#~ msgstr "``pgr_bdAstarCostMatrix`` - Beräknar en kostnadsmatris med hjälp av :doc:`pgr_aStar`."

#~ msgid "Using internally the :doc:`pgr_bdAstar` algorithm"
#~ msgstr "Intern användning av :doc:`pgr_bdAstar`-algoritmen"

#~ msgid "Signature change on pgr_bdDijsktra(One to One)"
#~ msgstr "Ändring av signatur på pgr_bdDijsktra(One to One)"

#~ msgid "The ``pgr_bdDijkstraCost`` function summarizes of the cost of the shortest path using the bidirectional Dijkstra Algorithm."
#~ msgstr "Funktionen ``pgr_bdDijkstraCost`` sammanfattar kostnaden för den kortaste vägen med hjälp av den dubbelriktade Dijkstra-algoritmen."

#~ msgid "It is well-known that the shortest paths between a single source and all other vertices can be found using Breadth First Search in :math:`O(|E|)` in an unweighted graph, i.e. the distance is the minimal number of edges that you need to traverse from the source to another vertex. We can interpret such a graph also as a weighted graph, where every edge has the weight :math:`1`. If not all edges in graph have the same weight, that we need a more general algorithm, like Dijkstra's Algorithm which runs in :math:`O(|E|log|V|)` time."
#~ msgstr "Det är välkänt att de kortaste vägarna mellan en enda källa och alla andra toppar kan hittas med hjälp av Breadth First Search på :math:`O(|E|)` i en oviktad graf, dvs. avståndet är det minsta antalet kanter som du behöver korsa från källan till en annan topp. Vi kan också tolka en sådan graf som en viktad graf, där varje kant har vikten :math:`1`. Om inte alla kanter i grafen har samma vikt behöver vi en mer allmän algoritm, som Dijkstras algoritm, som går på :math:`O(|E|log|V|)` tid."

#~ msgid "New experimental function"
#~ msgstr "Ny experimentell funktion"

#~ msgid "..rubric:: Version 3.0.0"
#~ msgstr "..rubric:: Version 3.0.0"

#~ msgid "``pgr_dijkstraNear`` - Proposed"
#~ msgstr "``pgr_dijkstraNear`` - Förslag"

#~ msgid "``pgr_dijkstraNearCost`` - Proposed"
#~ msgstr "``pgr_dijkstraNearCost`` - Förslag"

#~ msgid "Boost `floyd-Warshall <https://www.boost.org/libs/graph/doc/floyd_warshall_shortest.html>`_"
#~ msgstr "Boost `floyd-Warshall <https://www.boost.org/libs/graph/doc/floyd_warshall_shortest.html>`_"

#, fuzzy
#~ msgid "``pgr_kingOrdering`` — Returns the King ordering of an undirected graphs"
#~ msgstr "``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-ordningen för en ostyrd graf"

#~ msgid "|boost| graph inside."
#~ msgstr "|boost| graf inuti."

#, fuzzy
#~ msgid "``pgr_sloanOrdering`` — Returns the sloan ordering of an undirected graph"
#~ msgstr "``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-ordningen för en ostyrd graf"

#, fuzzy
#~ msgid "|Boost| Boost Graph inside"
#~ msgstr "|Boost-graf inuti"

#, fuzzy
#~ msgid "..rubric::Summary"
#~ msgstr "..rubric:: Standardize SQL"

#~ msgid "Additionally there are 2 categories under this family"
#~ msgstr "Dessutom finns det 2 kategorier under denna familj"

#~ msgid "They will likely officially be part of the next mayor release:"
#~ msgstr "De kommer sannolikt officiellt att vara en del av nästa borgmästarutgåva:"

#~ msgid "The functions make use of ANY-INTEGER and ANY-NUMERICAL"
#~ msgstr "Funktionerna använder sig av ANY-INTEGER och ANY-NUMERICAL"

#~ msgid "Name might not change. (But still can)"
#~ msgstr "Namnet kanske inte ändras. (Men kan fortfarande göra det)"

#~ msgid "Signature might not change. (But still can)"
#~ msgstr "Signaturen kanske inte ändras. (Men kan fortfarande göra det)"

#~ 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."

#~ msgid "May lack documentation."
#~ msgstr "Kan sakna dokumentation."

#~ msgid "Documentation examples might need to be automatically generated."
#~ msgstr "Dokumentationsexempel kan behöva genereras automatiskt."

#~ msgid "Might depend on a proposed function of pgRouting"
#~ msgstr "Kan bero på en föreslagen funktion för pgRouting"

#~ msgid "Might depend on a deprecated function of pgRouting"
#~ msgstr "Kan vara beroende av en föråldrad funktion i pgRouting"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 4.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.0.0%22>`__"
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 4.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%204.0.0%22>`__"

#~ msgid "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__ pgr_trsp"
#~ msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__ pgr_trsp"

#~ msgid "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__ pgr_trspVia"
#~ msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__ pgr_trspVia"

#~ msgid "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__ pgr_trspVia_withPoints"
#~ msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__ pgr_trspVia_withPoints"

#~ msgid "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__ pgr_trsp_withPoints"
#~ msgstr "`#2701 <https://github.com/pgRouting/pgrouting/issues/2701>`__ pgr_trsp_withPoints"

#~ msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__ pgr_withPoints"
#~ msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__ pgr_withPoints"

#~ msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__ pgr_withPointsCost"
#~ msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__ pgr_medPointsCost"

#~ msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__ pgr_withPointsCostMatrix"
#~ msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__ pgr_withPointsCostMatrix"

#~ msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__ pgr_withPointsDD"
#~ msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__ pgr_medPointsDD"

#~ msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__ pgr_withPointsKSP"
#~ msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__ pgr_withPointsKSP"

#~ msgid "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__ pgr_withPointsVia"
#~ msgstr "`#2700 <https://github.com/pgRouting/pgrouting/issues/2700>`__ pgr_withPointsVia"

#~ msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_aStar(Combinations)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_aStar(Kombinationer)"

#~ msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_aStarCost(Combinations)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_aStarCost(Kombinationer)"

#~ msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_bdAstar(Combinations)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_bdAstar(Kombinationer)"

#~ msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_bdAstarCost(Combinations)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_bdAstarCost(Kombinationer)"

#~ msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_bdDijkstra(Combinations)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_bdDijkstra(Kombinationer)"

#~ msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_bdDijkstraCost(Combinations)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_bdDijkstraCost(Kombinationer)"

#~ msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_dijkstra(Combinations)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_dijkstra(Kombinationer)"

#~ msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_dijkstraCost(Combinations)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_dijkstraCost(Kombinationer)"

#~ msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_KSP(All signatures)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_KSP(Alla signaturer)"

#~ msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_boykovKolmogorov(Combinations)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_boykovKolmogorov(Kombinationer)"

#~ msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_edmondsKarp(Combinations)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_edmondsKarp(Kombinationer)"

#~ msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_maxFlow(Combinations)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_maxFlow(Kombinationer)"

#~ msgid "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_pushRelabel(Combinations)"
#~ msgstr "`#2718 <https://github.com/pgRouting/pgrouting/issues/2918>`__ pgr_pushRelabel(Kombinationer)"

#~ msgid "`#2904 <https://github.com/pgRouting/pgrouting/issues/2904>`__ Standardize output columns of functions with different output columns within overloads"
#~ msgstr "`#2904 <https://github.com/pgRouting/pgrouting/issues/2904>`__ Standardisera utdatakolumner för funktioner med olika utdatakolumner inom överbelastningar"

#~ msgid "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ pgr_withPoints"
#~ msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ pgr_withPoints"

#~ msgid "`#2906 <https://github.com/pgRouting/pgrouting/issues/2906>`__ pgr_bdDijkstra"
#~ msgstr "`#2906 <https://github.com/pgRouting/pgrouting/issues/2906>`__ pgr_bdDijkstra"

#~ msgid "`#2907 <https://github.com/pgRouting/pgrouting/issues/2907>`__ pgr_bellmanFord"
#~ msgstr "`#2907 <https://github.com/pgRouting/pgrouting/issues/2907>`__ pgr_bellmanFord"

#~ msgid "`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__ pgr_binaryBreadthFirstSearch"
#~ msgstr "`#2908 <https://github.com/pgRouting/pgrouting/issues/2908>`__ pgr_binaryBreadthFirstSearch"

#~ msgid "`#2910 <https://github.com/pgRouting/pgrouting/issues/2910>`__ pgr_edwardMoore"
#~ msgstr "`#2910 <https://github.com/pgRouting/pgrouting/issues/2910>`__ pgr_edwardMoore"

#~ msgid "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ pgr_DAGshortestPath"
#~ msgstr "`#2913 <https://github.com/pgRouting/pgrouting/issues/2913>`__ pgr_DAGshortestPath"

#~ msgid "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ pgr_withPointsCost"
#~ msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ pgr_withPointsCost"

#~ msgid "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ pgr_withPointsCostMatrix"
#~ msgstr "`#2905 <https://github.com/pgRouting/pgrouting/issues/2905>`__ pgr_withPointsCostMatrix"

#~ msgid "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__ pgr_edgeDisjointPaths"
#~ msgstr "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__ pgr_edgeDisjointPaths"

#~ msgid "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__ pgr_turnRestrictedPaths"
#~ msgstr "`#2909 <https://github.com/pgRouting/pgrouting/issues/2909>`__ pgr_turnRestrictedPaths"

#~ msgid "`#2924 <https://github.com/pgRouting/pgrouting/issues/2924>`__ pgr_edgeColoring"
#~ msgstr "`#2924 <https://github.com/pgRouting/pgrouting/issues/2924>`__ pgr_edgeColoring"

#~ msgid "`#2924 <https://github.com/pgRouting/pgrouting/issues/2924>`__ pgr_bipartite"
#~ msgstr "`#2924 <https://github.com/pgRouting/pgrouting/issues/2924>`__ pgr_bipartite"

#~ msgid "`#2927 <https://github.com/pgRouting/pgrouting/issues/2927>`__ pgr_sequentialVertexColoring"
#~ msgstr "`#2927 <https://github.com/pgRouting/pgrouting/issues/2927>`__ pgr_sequentialVertexColoring"

#~ msgid "`#2931 <https://github.com/pgRouting/pgrouting/issues/2931>`__ pgr_breadthFirstSearch"
#~ msgstr "`#2931 <https://github.com/pgRouting/pgrouting/issues/2931>`__ pgr_breadthFirstSearch"

#~ msgid "`#2931 <https://github.com/pgRouting/pgrouting/issues/2931>`__ pgr_depthFirstSearch"
#~ msgstr "`#2931 <https://github.com/pgRouting/pgrouting/issues/2931>`__ pgr_depthFirstSearch"

#~ msgid "`#2934 <https://github.com/pgRouting/pgrouting/issues/2934>`__ pgr_topologicalSort"
#~ msgstr "`#2934 <https://github.com/pgRouting/pgrouting/issues/2934>`__ pgr_topologicalSort"

#~ msgid "`#2934 <https://github.com/pgRouting/pgrouting/issues/2934>`__ pgr_transitiveClosure"
#~ msgstr "`#2934 <https://github.com/pgRouting/pgrouting/issues/2934>`__ pgr_transitiveClosure"

#~ msgid "`#2751 <https://github.com/pgRouting/pgrouting/issues/2851>`__: pgr_createTopology"
#~ msgstr "`#2751 <https://github.com/pgRouting/pgrouting/issues/2851>`__: pgr_createTopology"

#~ msgid "#2748 _pgr_alphashape(text,double precision)"
#~ msgstr "#2748 _pgr_alphashape(text,dubbel precision)"

#~ msgid "#2861 _pgr_checkverttab(text,text[],integer,text)"
#~ msgstr "#2861 _pgr_checkverttab(text,text[],heltal,text)"

#~ msgid "#2861 _pgr_createindex(text,text,text,integer,text)"
#~ msgstr "#2861 _pgr_createindex(text,text,text,heltal,text)"

#~ msgid "#2861 _pgr_createindex(text,text,text,text,integer,text)"
#~ msgstr "#2861 _pgr_createindex(text,text,text,text,text,heltal,text)"

#~ msgid "#2913 _pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean)"
#~ msgstr "#2913 _pgr_dagshortestpath(text,anyarray,anyarray,boolean,boolean)"

#~ msgid "#2913 _pgr_dagshortestpath(text,text,boolean,boolean)"
#~ msgstr "#2913 _pgr_dagshortestpath(text,text,boolean,boolean)"

#~ msgid "#2730 _pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)"
#~ msgstr "#2730 _pgr_dijkstranear(text,anyarray,anyarray,bigint,boolean)"

#~ msgid "#2730 _pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)"
#~ msgstr "#2730 _pgr_dijkstranear(text,anyarray,bigint,bigint,boolean)"

#~ msgid "#2730 _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)"
#~ msgstr "#2730 _pgr_dijkstranear(text,bigint,anyarray,bigint,boolean)"

#~ msgid "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)"
#~ msgstr "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint)"

#~ msgid "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)"
#~ msgstr "#2730 _pgr_dijkstra(text,anyarray,anyarray,boolean,boolean,boolean,bigint,boolean)"

#~ msgid "#2730 _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)"
#~ msgstr "#2730 _pgr_dijkstra(text,text,boolean,boolean,bigint,boolean)"

#~ msgid "#2730 _pgr_dijkstra(text,text,boolean,boolean,boolean)"
#~ msgstr "#2730 _pgr_dijkstra(text,text,boolean,boolean,boolean)"

#~ msgid "#2735 _pgr_drivingdistance(text,anyarray,double precision,boolean,boolean)"
#~ msgstr "#2735 _pgr_drivingdistance(text,valfri matris,dubbel precision,boolean,boolean)"

#~ msgid "#2861 _pgr_endpoint(geometry)"
#~ msgstr "#2861 _pgr_slutpunkt(geometri)"

#~ msgid "#2861 _pgr_getcolumnname(text,text,integer,text)"
#~ msgstr "#2861 _pgr_getcolumnname(text,text,heltal,text)"

#~ msgid "#2861 _pgr_getcolumnname(text,text,text,integer,text)"
#~ msgstr "#2861 _pgr_getcolumnname(text,text,text,heltal,text)"

#~ msgid "#2861 _pgr_getcolumntype(text,text,integer,text)"
#~ msgstr "#2861 _pgr_getcolumntype(text,text,heltal,text)"

#~ msgid "#2861 _pgr_getcolumntype(text,text,text,integer,text)"
#~ msgstr "#2861 _pgr_getcolumntype(text,text,text,heltal,text)"

#~ msgid "#2861 _pgr_gettablename(text,integer,text)"
#~ msgstr "#2861 _pgr_gettablename(text,heltal,text)"

#~ msgid "#2861 _pgr_iscolumnindexed(text,text,integer,text)"
#~ msgstr "#2861 _pgr_iscolumnindexed(text,text,heltal,text)"

#~ msgid "#2861 _pgr_iscolumnindexed(text,text,text,integer,text)"
#~ msgstr "#2861 _pgr_iscolumnindexed(text,text,text,heltal,text)"

#~ msgid "#2861 _pgr_iscolumnintable(text,text)"
#~ msgstr "#2861 _pgr_iscolumnintable(text,text)"

#~ msgid "#2745 _pgr_kruskal(text,anyarray,text,bigint,double precision)"
#~ msgstr "#2745 _pgr_kruskal(text,valfri matris,text,bigint,dubbel precision)"

#~ msgid "#2897 _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean)"
#~ msgstr "#2897 _pgr_ksp(text,anyarray,anyarray,integer,boolean,boolean,boolean,boolean)"

#~ msgid "#2897 _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)"
#~ msgstr "#2897 _pgr_ksp(text,bigint,bigint,integer,boolean,boolean)"

#~ msgid "#2897 _pgr_ksp(text,text,integer,boolean,boolean)"
#~ msgstr "#2897 _pgr_ksp(text,text,heltal,boolean,boolean)"

#~ msgid "#2899 _pgr_maxcardinalitymatch(text,boolean)"
#~ msgstr "#2899 _pgr_maxcardinalitymatch(text,boolean)"

#~ msgid "#2861 _pgr_msg(integer,text,text)"
#~ msgstr "#2861 _pgr_msg(heltal,text,text)"

#~ msgid "#2861 _pgr_onerror(boolean,integer,text,text,text,text)"
#~ msgstr "#2861 _pgr_onerror(boolean,heltal,text,text,text,text,text)"

#~ msgid "#2861 _pgr_pointtoid(geometry,double precision,text,integer)"
#~ msgstr "#2861 _pgr_pointtoid(geometri,dubbel precision,text,heltal)"

#~ msgid "#2743 _pgr_prim(text,anyarray,text,bigint,double precision)"
#~ msgstr "#2743 _pgr_prim(text,valfri matris,text,bigint,dubbel precision)"

#~ msgid "#2861 _pgr_quote_ident(text)"
#~ msgstr "#2861 _pgr_quote_ident(text)"

#~ msgid "#2861 _pgr_startpoint(geometry)"
#~ msgstr "#2861 _pgr_startpunkt(geometri)"

#~ msgid "#2683 _pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)"
#~ msgstr "#2683 _pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)"

#~ msgid "#2683 _pgr_trsp(text,text,anyarray,anyarray,boolean)"
#~ msgstr "#2683 _pgr_trsp(text,text,valfri matris,valfri matris,boolean)"

#~ msgid "#2683 _pgr_trsp(text,text,anyarray,bigint,boolean)"
#~ msgstr "#2683 _pgr_trsp(text,text,valfri matris,bigint,boolean)"

#~ msgid "#2683 _pgr_trsp(text,text,bigint,anyarray,boolean)"
#~ msgstr "#2683 _pgr_trsp(text,text,bigint,anyarray,boolean)"

#~ msgid "#2683 _pgr_trsp(text,text,bigint,bigint,boolean)"
#~ msgstr "#2683 _pgr_trsp(text,text,bigint,bigint,boolean)"

#~ msgid "#2682 _pgr_trspviavertices(text,integer[],boolean,boolean,text)"
#~ msgstr "#2682 _pgr_trspviavertices(text,heltal[],boolean,boolean,text)"

#~ msgid "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"
#~ msgstr "#2919 _pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"

#~ msgid "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"
#~ msgstr "#2919 _pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,tecken,boolean)"

#~ msgid "#2919 _pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)"
#~ msgstr "#2919 _pgr_trsp_withpoints(text,text,text,text,boolean,tecken,boolean)"

#~ msgid "#2901 _pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
#~ msgstr "#2901 _pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)"

#~ msgid "#2901 _pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
#~ msgstr "#2901 _pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)"

#~ msgid "#2861 _pgr_versionless(text,text)"
#~ msgstr "#2861 _pgr_versionless(text,text)"

#~ msgid "#2890 _pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)"
#~ msgstr "#2890 _pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)"

#~ msgid "#2895 _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean)"
#~ msgstr "#2895 _pgr_withpointsksp(text,text,anyarray,anyarray,integer,character,boolean,boolean,boolean,boolean,boolean)"

#~ msgid "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"
#~ msgstr "#2895 _pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"

#~ msgid "#2895 _pgr_withpointsksp(text,text,text,integer,character,boolean,boolean,boolean)"
#~ msgstr "#2895 _pgr_withpointsksp(text,text,text,heltal,tecken,boolean,boolean,boolean)"

#~ msgid "#2741 _pgr_withpointsvia(text,bigint[],double precision[],boolean)"
#~ msgstr "#2741 _pgr_withpointsvia(text,bigint[],dubbel precision[],boolean)"

#~ msgid "#2741 _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"
#~ msgstr "#2741 _pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)"

#~ msgid "#2683 _trsp(text,text,anyarray,anyarray,boolean)"
#~ msgstr "#2683 _trsp(text,text,valfri matris,valfri matris,boolean)"

#~ msgid "#2683 _v4trsp(text,text,anyarray,anyarray,boolean)"
#~ msgstr "#2683 _v4trsp(text,text,valfri matris,valfri matris,boolean)"

#~ msgid "#2683 _v4trsp(text,text,text,boolean)"
#~ msgstr "#2683 _v4trsp(text,text,text,boolean)"

#~ msgid "#2748 pgr_alphashape(geometry,double precision)"
#~ msgstr "#2748 pgr_alphashape(geometri,dubbel precision)"

#~ msgid "#2752 pgr_analyzegraph(text,double precision,text,text,text,text,text)"
#~ msgstr "#2752 pgr_analyzegraph(text,dubbel precision,text,text,text,text,text,text)"

#~ msgid "#2755 pgr_analyzeoneway(text,text[],text[],text[],text[],boolean,text,text,text)"
#~ msgstr "#2755 pgr_analyzeoneway(text,text[],text[],text[],text[],text[],boolean,text,text,text)"

#~ msgid "#2798 pgr_contraction(text,bigint[],integer,bigint[],boolean)"
#~ msgstr "#2798 pgr_contraction(text,bigint[],integer,bigint[],boolean)"

#~ msgid "#2751 pgr_createtopology(text,double precision,text,text,text,text,text,boolean)"
#~ msgstr "#2751 pgr_createtopology(text,dubbel precision,text,text,text,text,text,text,boolean)"

#~ msgid "#2827 pgr_createverticestable(text,text,text,text,text)"
#~ msgstr "#2827 pgr_createverticestable(text,text,text,text,text,text)"

#~ msgid "#2888 pgr_findcloseedges(text,geometry,double precision,integer,boolean,boolean)"
#~ msgstr "#2888 pgr_findcloseedges(text,geometry,dubbel precision,heltal,boolean,boolean)"

#~ msgid "#2888 pgr_findcloseedges(text,geometry[],double precision,integer,boolean,boolean)"
#~ msgstr "#2888 pgr_findcloseedges(text,geometry[],dubbel precision,heltal,boolean,boolean)"

#~ msgid "#2899 pgr_maxcardinalitymatch(text,boolean)"
#~ msgstr "#2899 pgr_maxcardinalitymatch(text,boolean)"

#~ msgid "#2886 pgr_nodenetwork(text,double precision,text,text,text,text,boolean)"
#~ msgstr "#2886 pgr_nodenetwork(text,dubbel precision,text,text,text,text,text,boolean)"

#~ msgid "#2683 pgr_trsp(text,integer,double precision,integer,double precision,boolean,boolean,text)"
#~ msgstr "#2683 pgr_trsp(text,heltal,dubbel precision,heltal,dubbel precision,boolean,boolean,text)"

#~ msgid "#2683 pgr_trsp(text,integer,integer,boolean,boolean,text)"
#~ msgstr "#2683 pgr_trsp(text,heltal,heltal,boolean,boolean,text)"

#~ msgid "#2681 pgr_trspviaedges(text,integer[],double precision[],boolean,boolean,text)"
#~ msgstr "#2681 pgr_trspviaedges(text,heltal[],dubbel precision[],boolean,boolean,text)"

#~ msgid "#2682 pgr_trspviavertices(text,anyarray,boolean,boolean,text)"
#~ msgstr "#2682 pgr_trspviavertices(text,valfri matris,boolean,boolean,text)"

#~ msgid "#2919 pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,character,boolean)"
#~ msgstr "#2919 pgr_trspvia_withpoints(text,text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)"

#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"
#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,anyarray,anyarray,boolean,character,boolean)"

#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)"
#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,anyarray,bigint,boolean,character,boolean)"

#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)"
#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,bigint,anyarray,boolean,character,boolean)"

#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,character,boolean)"
#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,bigint,bigint,boolean,tecken,boolean)"

#~ msgid "#2919 pgr_trsp_withpoints(text,text,text,text,boolean,character,boolean)"
#~ msgstr "#2919 pgr_trsp_withpoints(text,text,text,text,boolean,tecken,boolean)"

#~ msgid "#2901 pgr_tspeuclidean(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
#~ msgstr "#2901 pgr_tspeuclidean(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)"

#~ msgid "#2901 pgr_tsp(text,bigint,bigint,double precision,integer,integer,integer,double precision,double precision,double precision,boolean)"
#~ msgstr "#2901 pgr_tsp(text,bigint,bigint,dubbel precision,heltal,heltal,heltal,dubbel precision,dubbel precision,dubbel precision,boolean)"

#~ msgid "#2919 pgr_withpointscostmatrix(text,text,anyarray,boolean,character)"
#~ msgstr "#2919 pgr_withpointscostmatrix(text,text,anyarray,boolean,character)"

#~ msgid "#2919 pgr_withpointscost(text,text,anyarray,anyarray,boolean,character)"
#~ msgstr "#2919 pgr_withpointscost(text,text,valfri matris,valfri matris,boolean,tecken)"

#~ msgid "#2919 pgr_withpointscost(text,text,anyarray,bigint,boolean,character)"
#~ msgstr "#2919 pgr_withpointscost(text,text,anyarray,bigint,boolean,character)"

#~ msgid "#2919 pgr_withpointscost(text,text,bigint,anyarray,boolean,character)"
#~ msgstr "#2919 pgr_withpointscost(text,text,bigint,anyarray,boolean,character)"

#~ msgid "#2919 pgr_withpointscost(text,text,bigint,bigint,boolean,character)"
#~ msgstr "#2919 pgr_withpointscost(text,text,bigint,bigint,boolean,character)"

#~ msgid "#2919 pgr_withpointscost(text,text,text,boolean,character)"
#~ msgstr "#2919 pgr_withpointscost(text,text,text,boolean,tecken)"

#~ msgid "#2890 pgr_withpointsdd(text,text,anyarray,double precision,boolean,character,boolean,boolean)"
#~ msgstr "#2890 pgr_withpointsdd(text,text,valfri matris,dubbel precision,boolean,tecken,boolean,boolean)"

#~ msgid "#2890 pgr_withpointsdd(text,text,bigint,double precision,boolean,character,boolean)"
#~ msgstr "#2890 pgr_withpointsdd(text,text,bigint,dubbel precision,boolean,tecken,boolean)"

#~ msgid "#2895 pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"
#~ msgstr "#2895 pgr_withpointsksp(text,text,bigint,bigint,integer,boolean,boolean,character,boolean)"

#~ msgid "#2919 pgr_withpoints(text,text,anyarray,anyarray,boolean,character,boolean)"
#~ msgstr "#2919 pgr_withpoints(text,text,valfri matris,valfri matris,boolean,tecken,boolean)"

#~ msgid "#2919 pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)"
#~ msgstr "#2919 pgr_withpoints(text,text,anyarray,bigint,boolean,character,boolean)"

#~ msgid "#2919 pgr_withpoints(text,text,bigint,anyarray,boolean,character,boolean)"
#~ msgstr "#2919 pgr_withpoints(text,text,bigint,anyarray,boolean,tecken,boolean)"

#~ msgid "#2919 pgr_withpoints(text,text,bigint,bigint,boolean,character,boolean)"
#~ msgstr "#2919 pgr_withpoints(text,text,bigint,bigint,boolean,tecken,boolean)"

#~ msgid "#2919 pgr_withpoints(text,text,text,boolean,character,boolean)"
#~ msgstr "#2919 pgr_withpoints(text,text,text,boolean,tecken,boolean)"

#~ msgid "#2919 pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,character,boolean)"
#~ msgstr "#2919 pgr_withpointsvia(text,text,anyarray,boolean,boolean,boolean,boolean,character,boolean)"

#~ msgid "#2683 _trsp"
#~ msgstr "#2683 _trsp"

#~ msgid "#2683 _v4trsp"
#~ msgstr "#2683 _v4trsp"

#~ msgid "#2748 _pgr_alphashape"
#~ msgstr "#2748 _pgr_alphashape"

#~ msgid "#2913 _pgr_dagshortestpath"
#~ msgstr "#2913 _pgr_dagshortestpath"

#~ msgid "Validity of **driving side** parameter"
#~ msgstr "Giltighet för parametern **förarsida**"

#~ msgid "**driving side** parameter is unnamed compulsory, and valid values differ for directed and undirected graphs."
#~ msgstr "*parametern *driving side** är obligatorisk utan namn och giltiga värden skiljer sig åt för riktade och oriktade grafer."

#~ msgid "Does not have a default value."
#~ msgstr "Har inget förinställt värde."

#~ msgid "Using an invalid value throws an ``ERROR``."
#~ msgstr "Om du använder ett ogiltigt värde får du ett ``ERROR``."

#~ msgid "And ``driving side`` parameter changed from named optional to unnamed compulsory **driving side** and its validity differ for directed and undirected graphs."
#~ msgstr "Parametern ``driving side`` ändrades från namngiven valfri till icke namngiven obligatorisk **driving side** och dess giltighet skiljer sig åt för riktade och oriktade grafer."

#~ msgid "pgr_dijkstra(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])"
#~ msgstr "pgr_dijkstra(`Kanter SQL`_, **start vids**, **end vids**, [``directed``])"

#~ msgid ":ref:`install-short`"
#~ msgstr ":ref:`install-short`"

#~ msgid ":ref:`install_get_sources`"
#~ msgstr ":ref:`install_get_sources`"

#~ msgid ":ref:`install_enable_db`"
#~ msgstr ":ref:`install_enable_db`"

#~ msgid ":ref:`install_dependencies`"
#~ msgstr ":ref:`install_dependencies`"

#~ msgid ":ref:`install_configuring`"
#~ msgstr ":ref:`install_configuring`"

#~ msgid ":ref:`install_build`"
#~ msgstr ":ref:`install_build`"

#~ msgid ":ref:`install_testing`"
#~ msgstr ":ref:`install_testing`"

#~ msgid "To use pgRouting PostGIS needs to be installed, please read the information about installation in this `Install Guide <https://www.postgis.us/presentations/postgis_install_guide_22.html>`__"
#~ msgstr "För att använda pgRouting måste PostGIS installeras, läs informationen om installation i denna `Installationsguide <https://www.postgis.us/presentations/postgis_install_guide_22.html>`__"

#~ msgid "Postgresql version = Supported versions by PostgreSQL"
#~ msgstr "Postgresql-version = Versioner som stöds av PostgreSQL"

#~ 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"

#~ msgid "Sphinx >= 1.1"
#~ msgstr "Sphinx >= 1.1"

#~ msgid "Latex"
#~ msgstr "Latex"

#~ msgid "PostGIS version >= 2.2"
#~ msgstr "PostGIS version >= 2.2"

#~ msgid "Database dependencies"
#~ msgstr "Beroenden till databaser"

#~ msgid "Configuring PostgreSQL"
#~ msgstr "Konfigurera PostgreSQL"

#~ msgid "Entering psql console"
#~ msgstr "Gå in i psql-konsolen"

#~ msgid "To exit psql console"
#~ msgstr "Så här avslutar du psql-konsolen"

#~ msgid "Entering psql console directly without switching roles can be done by the following commands"
#~ msgstr "Du kan gå in i psql-konsolen direkt utan att byta roll med följande kommandon"

#~ msgid "Then use the above given method to exit out of the psql console"
#~ msgstr "Använd sedan ovanstående metod för att avsluta psql-konsolen"

#~ msgid "Checking PostgreSQL version"
#~ msgstr "Kontrollera PostgreSQL-versionen"

#~ msgid "or"
#~ msgstr "eller"

#~ msgid "Enter the psql console using above given method and then enter"
#~ msgstr "Gå in i psql-konsolen med hjälp av ovanstående metod och ange sedan"

#~ msgid "Creating PostgreSQL role"
#~ msgstr "Skapa PostgreSQL-roll"

#~ msgid "Default role provided by PostgreSQL is postgres. To create new roles you can use the above provided commands. The prompt will ask the user to type name of the role and then provide affirmation. Proceed with the steps and you will succeed in creating PostgreSQL role successfully."
#~ msgstr "Standardrollen som tillhandahålls av PostgreSQL är postgres. För att skapa nya roller kan du använda ovanstående kommandon. Prompten kommer att be användaren att skriva namnet på rollen och sedan ge bekräftelse. Fortsätt med stegen så kommer du att lyckas skapa PostgreSQL-rollen framgångsrikt."

#~ msgid "To add password to the role or change previously created password of the role use the following commands"
#~ msgstr "Använd följande kommandon om du vill lägga till ett lösenord för rollen eller ändra ett tidigare skapat lösenord för rollen"

#~ msgid "To get additional details on the flags associated with ``createuser`` below given command can be used"
#~ msgstr "För att få ytterligare information om de flaggor som är associerade med ``createuser`` kan nedanstående kommando användas"

#~ msgid "Creating Database in PostgreSQL"
#~ msgstr "Skapa databas i PostgreSQL"

#~ msgid "Connecting to a PostgreSQL Database"
#~ msgstr "Ansluta till en PostgreSQL-databas"

#~ msgid "Enter the psql console and type the following commands"
#~ msgstr "Gå till psql-konsolen och skriv följande kommandon"

#~ msgid "For documentation and testing"
#~ msgstr "För dokumentation och testning"

#~ msgid "Create the build directory"
#~ msgstr "Skapa byggkatalogen"

#~ msgid "WITH_DOC"
#~ msgstr "MED_DOK"

#~ msgid "Turn on/off building the documentation"
#~ msgstr "Aktivera/avaktivera skapandet av dokumentation"

#~ msgid "Configuring cmake to create documentation before building pgRouting"
#~ msgstr "Konfigurera cmake för att skapa dokumentation innan pgRouting byggs"

#~ msgid "Most of the effort of the documentation has been on the html files."
#~ msgstr "Det mesta av arbetet med dokumentationen har lagts på html-filerna."

#~ msgid "The following instructions start from *path/to/pgrouting/build*"
#~ msgstr "Följande instruktioner startar från *stig/till/pgrouting/build*"

#~ msgid "The sql signatures are configured and build in the ``cmake`` command."
#~ msgstr "Sql-signaturerna konfigureras och byggs i kommandot ``cmake``."

#~ msgid "MinGW on Windows"
#~ msgstr "MinGW på Windows"

#~ msgid "The following instructions start from *path/to/pgrouting*"
#~ msgstr "Följande instruktioner börjar från *väg/till/grouting*"

#~ msgid "To remove the build when the configuration changes, use the following code:"
#~ msgstr "Använd följande kod för att ta bort build när konfigurationen ändras:"

#~ msgid "and start the build process as mentioned previously."
#~ msgstr "och starta byggprocessen som tidigare nämnts."

#~ msgid "The following instructions start from *path/to/pgrouting/*"
#~ msgstr "Följande instruktioner startar från *stig/till/pgrouting/*"

#~ msgid "Individuals in this release v3.8.x (in alphabetical order)"
#~ msgstr "Individer i denna utgåva v3.8.x (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, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"
#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"

#~ msgid "New **experimental** function"
#~ msgstr "Ny **experimentell** funktion"

#~ msgid "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vid**, [**options**])"
#~ msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vid**, [**options**])"

#~ msgid "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vids**, [**options**])"
#~ msgstr "pgr_dijkstraNear(`Kanter SQL`_, **start vids**, **end vids**, [**options**])"

#~ msgid "``pgr_dijkstraVia`` - Proposed"
#~ msgstr "``pgr_dijkstraVia`` - Förslag"

#~ msgid "``pgr_johnson`` - Returns the sum of the costs of the shortest path for each pair of nodes in the graph using Floyd-Warshall algorithm."
#~ msgstr "``pgr_johnson`` - Returnerar summan av kostnaderna för den kortaste vägen för varje par av noder i grafen med hjälp av Floyd-Warshall-algoritmen."

#~ msgid "pgr_trspVia_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])"
#~ msgstr "pgr_trspVia_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])"

#~ msgid "**driving side**"
#~ msgstr "**körning på sidan**"

#~ msgid "[``r``, ``R``] for right driving side (for directed graph only)"
#~ msgstr "[``r``, ``R``] för höger körsida (endast för riktad graf)"

#~ msgid "[``l``, ``L``] for left driving side (for directed graph only)"
#~ msgstr "[``l``, ``L``] för vänster körsida (endast för riktad graf)"

#~ msgid "[``b``, ``B``] for both (only for undirected graph)"
#~ msgstr "[``b``, ``B``] för båda (endast för oriktad graf)"

#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**options**])"
#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vid**, [**options**])"

#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])"
#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, [**options**])"

#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**options**])"
#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vid**, [**options**])"

#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**options**])"
#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vids**, **end vids**, [**options**])"

#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Combinations SQL`_, `Points SQL`_, [**options**])"
#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Combinations SQL`_, `Points SQL`_, [**options**])"

#~ msgid "**options:** ``[directed, driving_side, details]``"
#~ msgstr "**options:** ``[directed, driving_side, details]``"

#~ msgid "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])"
#~ msgstr "pgr_trsp_withPoints(`Kanter SQL`_, `Restrictions SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])"

#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])"
#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])"

#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])"
#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])"

#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])"
#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])"

#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])"
#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])"

#~ msgid "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])"
#~ msgstr "pgr_withPoints(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])"

#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **driving side** [**options**])"

#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **driving side** [**options**])"

#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **driving side** [**options**])"

#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **driving side** [**options**])"

#~ msgid "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])"
#~ msgstr "pgr_withPointsCost(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **driving side** [**options**])"

#~ msgid "pgr_withPointsCostMatrix(`Kanter SQL`_, `Points SQL`_, **start vids**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsCostMatrix(`Kanter SQL`_, `Points SQL`_, **start vids**, **driving side** [**options**])"

#~ msgid "Using the default ``driving_side`` value"
#~ msgstr "Använda standardvärdet för ``driving_side``"

#~ msgid "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options A**])"
#~ msgstr "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options A**])"

#~ msgid "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options B**])"
#~ msgstr "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options B**])"

#~ msgid "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options**])"
#~ msgstr "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vid**, **distance**, **driving side**, [**options**])"

#~ msgid "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options**])"
#~ msgstr "pgr_withPointsDD(`Kanter SQL`_, `Points SQL`_, **root vids**, **distance**, **driving side**, [**options**])"

#~ msgid "``r``, ``R`` for right driving side,"
#~ msgstr "``R``, ``R`` för höger körsida,"

#~ msgid "``l``, ``L`` for left driving side."
#~ msgstr "``L``, ``L`` för vänster körsida."

#~ msgid "``b``, ``B`` for both."
#~ msgstr "``B``, ``B`` för båda."

#~ msgid "Valid values differ for directed and undirected graphs:"
#~ msgstr "Giltiga värden skiljer sig åt för riktade och oriktade grafer:"

#~ msgid "In directed graphs: [``r``, ``R``, ``l``, ``L``]."
#~ msgstr "I riktade grafer: [``r``, ``R``, ``l``, ``L``]."

#~ msgid "In undirected graphs: [``b``, ``B``]."
#~ msgstr "I oriktade grafer: [``b``, ``B``]."

#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])"
#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vid**, **K**, **driving_side**, [**options**])"

#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])"
#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vid**, **end vids**, **K**, **driving_side**, [**options**])"

#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])"
#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vid**, **K**, **driving_side**, [**options**])"

#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])"
#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, **start vids**, **end vids**, **K**, **driving_side**, [**options**])"

#~ msgid "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])"
#~ msgstr "pgr_withPointsKSP(`Kanter SQL`_, `Points SQL`_, `Combinations SQL`_, **K**, **driving_side**, [**options**])"

#~ msgid "pgr_withPointsVia(`Kanter SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])"
#~ msgstr "pgr_withPointsVia(`Kanter SQL`_, `Points SQL`_, **via vertices**, **driving side** [**options**])"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.8.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.8.0%22>`__"
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.8.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.8.0%22>`__"

#~ msgid "Other enhancements: `#2869 <https://github.com/pgRouting/pgrouting/issues/2869>`__"
#~ msgstr "Andra förbättringar: `#2869 <https://github.com/pgRouting/pgrouting/issues/2869>`__"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.3%22>`__"
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.7.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.3%22>`__"

#~ msgid "`#2731 <https://github.com/pgRouting/pgrouting/pull/2731>`__ Build Failure on Ubuntu 22"
#~ msgstr "`#2731 <https://github.com/pgRouting/pgrouting/pull/2731>`__ Byggfel på Ubuntu 22"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.2%22>`__"
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git-stängd milstolpe för 3.7.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.2%22>`__"

#~ msgid "`#2713 <https://github.com/pgRouting/pgrouting/pull/2713>`__ cmake missing some policies and min version"
#~ msgstr "`#2713 <https://github.com/pgRouting/pgrouting/pull/2713>`__ cmake saknar vissa policyer och min-version"

#~ msgid "`#2707 <https://github.com/pgRouting/pgrouting/pull/2707>`__ Build failure in pgRouting 3.7.1 on Alpine"
#~ msgstr "`#2707 <https://github.com/pgRouting/pgrouting/pull/2707>`__ Byggfel i pgRouting 3.7.1 på Alpine"

#~ msgid "`#2706 <https://github.com/pgRouting/pgrouting/pull/2706>`__ winnie crashing on pgr_betweennessCentrality"
#~ msgstr "`#2706 <https://github.com/pgRouting/pgrouting/pull/2706>`__ winnie kraschar på pgr_betweennessCentrality"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.1%22>`__"
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git-stängd milstolpe för 3.7.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.1%22>`__"

#~ msgid "`#2680 <https://github.com/pgRouting/pgrouting/pull/2680>`__ fails to compile under mingw64 gcc 13.2"
#~ msgstr "`#2680 <https://github.com/pgRouting/pgrouting/pull/2680>`__ kan inte kompileras under mingw64 gcc 13.2"

#~ msgid "`#2689 <https://github.com/pgRouting/pgrouting/pull/2689>`__ When point is a vertex, the withPoints family do not return results."
#~ msgstr "`#2689 <https://github.com/pgRouting/pgrouting/pull/2689>`__ När punkten är en vertex ger inte withPoints-familjen några resultat."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.7.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.0%22>`__"
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.7.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.7.0%22>`__"

#~ msgid "`#2656 <https://github.com/pgRouting/pgrouting/pull/2656>`__ Stop support of PostgreSQL12 on pgrouting v3.7"
#~ msgstr "`#2656 <https://github.com/pgRouting/pgrouting/pull/2656>`__ Stoppa stöd för PostgreSQL12 på pgrouting v3.7"

#~ msgid "`#2605 <https://github.com/pgRouting/pgrouting/pull/2605>`__ Standardize spanning tree functions output"
#~ msgstr "`#2605 <https://github.com/pgRouting/pgrouting/pull/2605>`__ Standardisera utdata för funktioner för spänningsträd"

#~ msgid "`#2635 <https://github.com/pgRouting/pgrouting/pull/2635>`__ pgr_LineGraph ignores directed flag and use negative values for identifiers."
#~ msgstr "`#2635 <https://github.com/pgRouting/pgrouting/pull/2635>`__ pgr_LineGraph ignorerar directed flag och använder negativa värden för identifierare."

#~ msgid "`#2599 <https://github.com/pgRouting/pgrouting/pull/2599>`__ Driving distance cleanup"
#~ msgstr "`#2599 <https://github.com/pgRouting/pgrouting/pull/2599>`__ Körsträcka uppstädning"

#~ msgid "`#2607 <https://github.com/pgRouting/pgrouting/pull/2607>`__ Read postgresql data on C++"
#~ msgstr "`#2607 <https://github.com/pgRouting/pgrouting/pull/2607>`__ Läsa postgresql-data på C++"

#~ msgid "`#2614 <https://github.com/pgRouting/pgrouting/pull/2614>`__ Clang tidy does not work"
#~ msgstr "`#2614 <https://github.com/pgRouting/pgrouting/pull/2614>`__ Clang tidy fungerar inte"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.3%22>`__"
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.6.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.3%22>`__"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.2%22>`__"
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git-stängd milstolpe för 3.6.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.2%22>`__"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.1%22>`_"
#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.6.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.1%22>`_"

#~ msgid "`#2588 <https://github.com/pgRouting/pgrouting/pull/2588>`__ pgrouting 3.6.0 fails to build on OSX"
#~ msgstr "`#2588 <https://github.com/pgRouting/pgrouting/pull/2588>`__ pgrouting 3.6.0 går inte att bygga under OSX"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.6.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.0%22>`_"
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.6.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.6.0%22>`_"

#~ msgid "`#2516 <https://github.com/pgRouting/pgrouting/pull/2516>`__ Standardize output pgr_aStar"
#~ msgstr "`#2516 <https://github.com/pgRouting/pgrouting/pull/2516>`__ Standardisera utdata pgr_aStar"

#~ msgid "`#2523 <https://github.com/pgRouting/pgrouting/pull/2523>`__ Standardize output pgr_bdAstar"
#~ msgstr "`#2523 <https://github.com/pgRouting/pgrouting/pull/2523>`__ Standardisera utdata pgr_bdAstar"

#~ msgid "`#2547 <https://github.com/pgRouting/pgrouting/pull/2547>`__ Standardize output and modifying signature pgr_KSP"
#~ msgstr "`#2547 <https://github.com/pgRouting/pgrouting/pull/2547>`__ Standardisera utdata och ändra signatur pgr_KSP"

#~ msgid "`#2548 <https://github.com/pgRouting/pgrouting/pull/2548>`__ Standardize output pgr_drivingDistance"
#~ msgstr "`#2548 <https://github.com/pgRouting/pgrouting/pull/2548>`__ Standardisera utdata pgr_drivingDistance"

#~ msgid "`#2544 <https://github.com/pgRouting/pgrouting/pull/2544>`__ Standardize output and modifying signature pgr_withPointsDD"
#~ msgstr "`#2544 <https://github.com/pgRouting/pgrouting/pull/2544>`__ Standardisera utdata och ändra signaturen pgr_withPointsDD"

#~ msgid "`#2546 <https://github.com/pgRouting/pgrouting/pull/2546>`__ Standardize output and modifying signature pgr_withPointsKSP"
#~ msgstr "`#2546 <https://github.com/pgRouting/pgrouting/pull/2546>`__ Standardisera utdata och ändra signaturen pgr_withPointsKSP"

#~ msgid "`#2504 <https://github.com/pgRouting/pgrouting/pull/2504>`__ To C++ pg data get, fetch and check."
#~ msgstr "`#2504 <https://github.com/pgRouting/pgrouting/pull/2504>`__ Till C++ pg-data hämta, hämta och kontrollera."

#~ msgid "`#2505 <https://github.com/pgRouting/pgrouting/pull/2505>`__ Using namespace."
#~ msgstr "`#2505 <https://github.com/pgRouting/pgrouting/pull/2505>`__ Använder namnområde."

#~ msgid "`#2512 <https://github.com/pgRouting/pgrouting/pull/2512>`__ [Dijkstra] Removing duplicate code on Dijkstra."
#~ msgstr "`#2512 <https://github.com/pgRouting/pgrouting/pull/2512>`__ [Dijkstra] Borttagning av duplicerad kod på Dijkstra."

#~ msgid "`#2517 <https://github.com/pgRouting/pgrouting/pull/2517>`__ Astar code simplification."
#~ msgstr "`#2517 <https://github.com/pgRouting/pgrouting/pull/2517>`__ Förenkling av Astar-koden."

#~ msgid "`#2521 <https://github.com/pgRouting/pgrouting/pull/2521>`__ Dijkstra code simplification."
#~ msgstr "`#2521 <https://github.com/pgRouting/pgrouting/pull/2521>`__ Dijkstra kodförenkling."

#~ msgid "`#2522 <https://github.com/pgRouting/pgrouting/pull/2522>`__ bdAstar code simplification."
#~ msgstr "`#2522 <https://github.com/pgRouting/pgrouting/pull/2522>`__ bdAstar kodförenkling."

#~ msgid "`#2490 <https://github.com/pgRouting/pgrouting/pull/2490>`__ Automatic page history links."
#~ msgstr "`#2490 <https://github.com/pgRouting/pgrouting/pull/2490>`__ Automatiska länkar till sidans historik."

#~ msgid "`#2555 <https://github.com/pgRouting/pgrouting/pull/2555>`__ Standardize deprecated messages"
#~ msgstr "`#2555 <https://github.com/pgRouting/pgrouting/pull/2555>`__ Standardisera föråldrade meddelanden"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.5.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.1%22>`_"
#~ msgstr "För att se alla problem och pull requests som stängts av den här versionen, se `Git stängd milstolpe för 3.5.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.1%22>`_"

#~ msgid "`#2565 <https://github.com/pgRouting/pgrouting/issues/2565>`__ pgr_lengauerTarjanDominatorTree triggers an assertion"
#~ msgstr "`#2565 <https://github.com/pgRouting/pgrouting/issues/2565>`__ pgr_lengauerTarjanDominatorTree utlöser ett påstående"

#~ msgid "`#2561 <https://github.com/pgRouting/pgrouting/issues/2561>`__ Not use wildcards on SQL"
#~ msgstr "`#2561 <https://github.com/pgRouting/pgrouting/issues/2561>`__ Använd inte jokertecken i SQL"

#~ msgid "`#2559 <https://github.com/pgRouting/pgrouting/issues/2559>`__ pgtap test using sampledata"
#~ msgstr "`#2559 <https://github.com/pgRouting/pgrouting/issues/2559>`__ pgtap-test med sampledata"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.5.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.0%22>`_"
#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.5.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.5.0%22>`_"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.4.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.2%22>`_"
#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.4.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.2%22>`_"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.4.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.1%22>`_"
#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.4.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.1%22>`_"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.4.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.0%22>`_"
#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.4.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.4.0%22>`_"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%22>`_"
#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.3.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.4%22>`_"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.3%22>`_"
#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.3.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.3%22>`_"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.2%22>`_"
#~ msgstr "För att se alla problem och pull requests som stängts av denna release, se `Git stängd milstolpe för 3.3.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.2%22>`_"

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.1%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.3.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.1%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.3.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.0%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.3.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.3.0%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.2.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.2%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.2.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.2%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.2.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.1%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.2.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.1%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.2.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.0%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.2.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.2.0%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.4%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.4%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.3%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.3%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.2%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.2%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.1%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.1%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.1.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.0%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.1.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.1.0%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.6 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.6%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.6 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.6%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.5 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.5%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.5 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.5%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.4%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.4%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.2%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.2%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.1%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.1%22>`_ på Github."

#~ msgid "To see all issues & pull requests closed by this release see the `Git closed milestone for 3.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.0%22>`_ on Github."
#~ msgstr "För att se alla problem och pull requests som stängts av den här utgåvan, se `Git stängd milstolpe för 3.0.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%203.0.0%22>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.6.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.3%22%20>`_ on Github."
#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.6.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.3%22%20>`_ på Github."

#~ msgid "`#1219 <https://github.com/pgRouting/pgrouting/pull/1219>`__ Implicit cast for via_path integer to text"
#~ msgstr "`#1219 <https://github.com/pgRouting/pgrouting/pull/1219>`__ Implicit kast för via_path integer till text"

#~ msgid "`#1193 <https://github.com/pgRouting/pgrouting/pull/1193>`__ Fixed pgr_pointsAsPolygon breaking when comparing strings in WHERE clause"
#~ msgstr "`#1193 <https://github.com/pgRouting/pgrouting/pull/1193>`__ Fixat att pgr_pointsAsPolygon gick sönder när strängar jämfördes i WHERE-satsen"

#~ msgid "`#1185 <https://github.com/pgRouting/pgrouting/pull/1185>`__ Improve FindPostgreSQL.cmake"
#~ msgstr "`#1185 <https://github.com/pgRouting/pgrouting/pull/1185>`__ Förbättra FindPostgreSQL.cmake"

#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.6.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.2%22%20>`_ on Github."
#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.6.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.2%22%20>`_ på Github."

#~ msgid "`#1152 <https://github.com/pgRouting/pgrouting/issues/1152>`__ Fixes driving distance when vertex is not part of the graph"
#~ msgstr "`#1152 <https://github.com/pgRouting/pgrouting/issues/1152>`__ Korrigerar körsträcka när toppunkten inte är en del av grafen"

#~ msgid "`#1098 <https://github.com/pgRouting/pgrouting/issues/1098>`__ Fixes windows test"
#~ msgstr "`#1098 <https://github.com/pgRouting/pgrouting/issues/1098>`__ Åtgärdar Windows-test"

#~ msgid "`#1165 <https://github.com/pgRouting/pgrouting/issues/1165>`__ Fixes build for python3 and perl5"
#~ msgstr "`#1165 <https://github.com/pgRouting/pgrouting/issues/1165>`__ Fixar byggsätt för python3 och perl5"

#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.6.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.1%22%20>`_ on Github."
#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.6.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.1%22%20>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.6.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.0%22%20>`_ on Github."
#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.6.0 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.6.0%22%20>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.5 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.5%22%20>`_ on Github."
#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.5 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.5%22%20>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.4%22%20>`_ on Github."
#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.4 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.4%22%20>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.3%22%20>`_ on Github."
#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.3 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.3%22%20>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.2%22%20>`_ on Github."
#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.2%22%20>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.5.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.1%22%20>`_ on Github."
#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.5.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.5.1%22%20>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.5.0 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.5.0%22+is%3Aclosed>`_ on Github."
#~ msgstr "För att se de problem som stängdes av den här utgåvan, se `Git stängda problem för 2.5.0 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.5.0%22+is%3Aclosed>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.4.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.2%22%20>`_ on Github."
#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.4.2 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.2%22%20>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed milestone for 2.4.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.1%22%20>`_ on Github."
#~ msgstr "För att se de problem som stängdes med den här utgåvan, se `Git-stängd milstolpe för 2.4.1 <https://github.com/pgRouting/pgrouting/issues?utf8=%E2%9C%93&q=milestone%3A%22Release%202.4.1%22%20>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.4.0 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.4.0%22+is%3Aclosed>`_ on Github."
#~ msgstr "För att se de problem som stängdes av den här utgåvan, se `Git stängda problem för 2.4.0 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.4.0%22+is%3Aclosed>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.3.2 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.3.2%22+is%3Aclosed>`_ on Github."
#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.3.2 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.3.2%22+is%3Aclosed>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.3.1 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.3.1%22+is%3Aclosed>`_ on Github."
#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.3.1 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.3.1%22+is%3Aclosed>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.3.0 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.3.0%22+is%3Aclosed>`_ on Github."
#~ msgstr "För att se de problem som stängdes av den här utgåvan, se `Git stängda problem för 2.3.0 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.3.0%22+is%3Aclosed>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.4 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.2.4%22+is%3Aclosed>`_ on Github."
#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.2.4 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.2.4%22+is%3Aclosed>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.3 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.2.3%22+is%3Aclosed>`_ on Github."
#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.2.3 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.2.3%22+is%3Aclosed>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.2 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.2.2%22+is%3Aclosed>`_ on Github."
#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.2.2 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.2.2%22+is%3Aclosed>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.1 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A2.2.1+is%3Aclosed>`_ on Github."
#~ msgstr "För att se de problem som stängts av denna utgåva, se `Git stängda problem för 2.2.1 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A2.2.1+is%3Aclosed>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.2.0 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.2.0%22+is%3Aclosed>`_ on Github."
#~ msgstr "För att se de problem som stängdes av denna utgåva, se `Git stängda problem för 2.2.0 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.2.0%22+is%3Aclosed>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.1.0 <https://github.com/pgRouting/pgrouting/issues?q=is%3Aissue+milestone%3A%22Release+2.1.0%22+is%3Aclosed>`_ on Github."
#~ msgstr "För att se de problem som stängdes av denna utgåva, se `Git stängda problem för 2.1.0 <https://github.com/pgRouting/pgrouting/issues?q=is%3Aissue+milestone%3A%22Release+2.1.0%22+is%3Aclosed>`_ på Github."

#~ msgid "To see the issues closed by this release see the `Git closed issues for 2.0.0 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.0.0%22+is%3Aclosed>`_ on Github."
#~ msgstr "För att se de problem som stängdes av den här utgåvan, se `Git stängda problem för 2.0.0 <https://github.com/pgRouting/pgrouting/issues?q=milestone%3A%22Release+2.0.0%22+is%3Aclosed>`_ på Github."

#~ msgid "Mailing List and GIS StackExchange"
#~ msgstr "Mailinglista och GIS StackExchange"

#~ msgid "There are two mailing lists for pgRouting hosted on OSGeo mailing list server:"
#~ msgstr "Det finns två e-postlistor för pgRouting som finns på OSGeo mailing list server:"

#~ msgid "User mailing list: https://lists.osgeo.org/mailman/listinfo/pgrouting-users"
#~ msgstr "E-postlista för användare: https://lists.osgeo.org/mailman/listinfo/pgrouting-users"

#, fuzzy
#~ msgid "Regina Obe, Saloni kumari, Vicky Vergara"
#~ msgstr "Aurélie Bousquet, Regina Obe, Vicky Vergara"

#, fuzzy
#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"
#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"

#, fuzzy
#~ msgid ":doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graphs acyclic graph."
#~ msgstr ":doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph."

#, fuzzy
#~ msgid "Fan Wu Regina Obe, Saloni kumari, Vicky Vergara"
#~ msgstr "Aurélie Bousquet, Regina Obe, Vicky Vergara"

#, fuzzy
#~ msgid "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"
#~ msgstr "Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang"
