pgRouting/pgRouting — Spanish @ OSGeo Weblate: This implementation gives a flexible framework for adding contraction algorithms …

Translation

English

Spanish

Needs editing

Skip

	English	Spanish	Actions
	Identifier of the color of the edge.	Identificador del color del segmento.
	`Boost: <https://www.boost.org/libs/graph/doc/table_of_contents.html>`__	`Boost: <https://www.boost.org/libs/graph/doc/table_of_contents.html>`__
	Components - Family of functions	Componentes - Familia de funciones
	:doc:`pgr_connectedComponents` - Connected components of an undirected graph.	:doc:`pgr_connectedComponents` - Componentes conectados de un grafo no dirigido.
	:doc:`pgr_strongComponents` - Strongly connected components of a directed graph.	:doc:`pgr_strongComponents` - Componentes fuertemente conectados de un grafo dirigido.
	:doc:`pgr_biconnectedComponents` - Biconnected components of an undirected graph.	:doc:`pgr_biconnectedComponents` - Componentes biconectados de un grafo no dirigido.
	:doc:`pgr_articulationPoints` - Articulation points of an undirected graph.	:doc:`pgr_articulationPoints` - Puntos de articulación de un grafo no dirigido.
	:doc:`pgr_bridges` - Bridges of an undirected graph.	:doc:`pgr_bridges` - Puentes de un grafo no dirigido.
	:doc:`pgr_makeConnected` - Details of edges to make graph connected.	:doc:`pgr_makeConnected` - Detalles de aristas para hacer grafos conectados.
	Contraction - Family of functions	Contraction - Familia de funciones
	:doc:`pgr_contraction`	:doc:`pgr_contraction`
	:doc:`pgr_contractionDeadEnd`	:doc:`pgr_contractionDeadEnd`
	:doc:`pgr_contractionLinear`	:doc:`pgr_contraction`
	:doc:`pgr_contractionHierarchies`	:doc:`pgr_contraction`
	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.	En grafos grandes, como los grafos de carretera o de redes eléctricas, la contracción de grafos se puede utilizar para acelerar algunos algoritmos. La contracción reduce el tamaño del grafo eliminando algunos de los vértices y aristas, por ejemplo, podría agregar aristas que representen una secuencia de las aristas originales disminuyendo el tiempo total y el espacio utilizados en los algoritmos de grafos.
	This implementation gives a flexible framework for adding contraction algorithms in the future. Currently, it supports three algorithms.	Esta implementación proporciona un marco flexible para agregar algoritmos de contracción en el futuro, actualmente, admite dos algoritmos:
	Dead end contraction	Contracción sin salida
	Linear contraction	Contracción lineal
	Contraction hierarchies	Contracción de un grafo
	The two first ones can be combined through a iterative procedure, via the ``pgr_contraction`` method. The third one is implemented on its own.
	All functions allow the user to forbid contraction on a set of nodes.	Prohíba la contracción en un conjunto de nodos.
	https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf	https://www.cs.cmu.edu/afs/cs/academic/class/15210-f12/www/lectures/lecture16.pdf
	https://ae.iti.kit.edu/download/diploma_thesis_geisberger.pdf	https://algo2.iti.kit.edu/documents/routeplanning/geisberger_dipl.pdf
	https://jlazarsfeld.github.io/ch.150.project/contents/
	Cost - Category	Costo - Categoría
	:doc:`pgr_aStarCost`	:doc:`pgr_aStarCost`
	:doc:`pgr_bdAstarCost`	:doc:`pgr_bdAstarCost`
	:doc:`pgr_dijkstraCost`	:doc:`pgr_dijkstraCost`
	:doc:`pgr_bdDijkstraCost`	:doc:`pgr_bdDijkstraCost`
	:doc:`pgr_dijkstraNearCost`	:doc:`pgr_dijkstraNearCost`
	:doc:`pgr_withPointsCost`	:doc:`pgr_withPointsCost`