pgRouting/pgRouting — Swedish @ OSGeo Weblate: Default value = 'r';

Zen

	English	Swedish	Actions
	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.
	The implementation targets undirected graphs.	Implementationen är för undirected grafer.
	Bandwidth minimization is an NP-complete problem; King ordering provides a practical local minimization approach.
	The time complexity is: :math:`O(m^2 \log(m)\|E\|)`	Körtidskomplexiteten är: :math:`O(m log(m)\|V\|)`
	where :math:`\|E\|` is the number of edges,	där :math:`\|V\|` är antalet toppar,
	:math:`m` is the maximum degree among all vertices.	:math:`m` is the maximum degree of the vertices in the graph.
	pgr_kingOrdering(`Edges SQL`_)	pgr_edgeColoring(`Kanter SQL`_)
	`Boost: King Ordering <https://www.boost.org/libs/graph/doc/king_ordering.html>`__	`Boost: Färgläggning av kanter <https://www.boost.org/libs/graph/doc/edge_coloring.html>`__
	:doc:`pgr_sloanOrdering` - Returns the sloan ordering of an undirected graph.	:doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph.
	:doc:`pgr_kingOrdering` - Returns the King ordering of an undirected graph.	``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-ordningen för en ostyrd graf
	pgr_sloanOrdering	Ordning
	Driving side parameter is positional unnamed.	Driving side parametern är positionell, namnlös och obligatorisk.
	`#2955 <https://github.com/pgRouting/pgrouting/issues/2955>`__: pgr_sloanOrdering	`#2924 <https://github.com/pgRouting/pgrouting/issues/2924>`__ pgr_edgeColoring
	Default value of driving side parameter	Giltighet för parametern förarsida
	driving side parameter is unnamed, and valid values differ for directed and undirected graphs.	parametern driving side** är obligatorisk utan namn och giltiga värden skiljer sig åt för riktade och oriktade grafer.
	Default value = 'r';	Med standardvärden
	Default value = 'b';	Med standardvärden
	And ``driving side`` parameter changed from named optional to unnamed driving side and its validity differ for directed and undirected graphs.	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.
	Bipasha Gayary, Fan Wu, Regina Obe, Saloni kumari, Vicky Vergara	Aurélie Bousquet, Regina Obe, Vicky Vergara
	Aasheesh Tiwari, Abhinav Jain, Aditya Pratap Singh, Adrien Berchet, Akio Takubo, Andrea Nardelli, Anthony Tasca, Anton Patrushev, Aryan Gupta, Ashraf Hossain, Ashish Kumar, Aurélie Bousquet, Bipasha Gayary, Cayetano Benavent, Christian Gonzalez, Daniel Kastl, Dapeng Wang, Dave Potts, David Techer, Denis Rykov, Ema Miyawaki, Esteban Zimanyi, Fan Wu, Florian Thurkow, Frederic Junod, Gerald Fenoy, Gudesa Venkata Sai Akhil, Hang Wu, Himanshu Raj, Imre Samu, Jay Mahadeokar, Jinfu Leng, Kai Behncke, Kishore Kumar, Ko Nagase, Mahmoud Sakr, Manikata Kondeti, Mario Basa, Martin Wiesenhaan, Maxim Dubinin, Maoguang Wang, Mohamed Bakli, Mohamed Zia, Mukul Priya, Nitish Chauhan, Rajat Shinde, Razequl Islam, Regina Obe, Rohith Reddy, Saloni Kumari, Sarthak Agarwal, Shobhit Chaurasia, Sourabh Garg, Stephen Woodbridge, Swapnil Joshi, Sylvain Housseman, Sylvain Pasche, Veenit Kumar, Vidhan Jain, Virginia Vergara, Yige Huang	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
	``pgr_dijkstraVia``	``pgr_dijkstra``
	``pgr_sloanOrdering`` - Experimental	``pgr_edgeColoring`` - Experimentell
	``pgr_sloanOrdering`` — Returns the sloan ordering of an undirected graph	``pgr_cuthillMckeeOrdering`` - Returnerar den omvända Cuthill-Mckee-ordningen för en ostyrd graf
	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.
	Finds a pseudoperipheral vertex pair to determine good starting points
	Uses a priority-based algorithm that balances vertex degree and distance from the start vertex.
	Aims to mininimize bandwidth (maximum difference between connected vertex indices.
	Typically produces better orderings than simple breadth-first approaches.
	Run time is 0.115846 seconds.
	\|Boost\| Boost Graph inside	\|Boost-graf inuti
	..rubric::Summary	..rubric:: Standardize SQL

Loading…

mt:deepl

Suggestion added

English

Swedish 12 characters edited

yesterday

None

String added in the repository

English

Swedish 18 characters edited Current translation Needs editing

yesterday

Browse all string changes

Things to check

Suggestions

There is 1 suggestion for this string.

View

Mismatched semicolon

Source and translation do not both end with a semicolon

Reset

Glossary

English	Swedish
No related strings found in the glossary.

String information

String age

yesterday

Last updated

yesterday

Source string age

yesterday

Translation file

locale/sv/LC_MESSAGES/pgrouting_doc_strings.po, string 5653