pgRouting/pgRouting — Spanish @ OSGeo Weblate: Miscellaneous Algoritms

Zen

	English	Spanish	Actions
	:doc:`components-family`	:doc:`components-family`
	:doc:`ordering-family`	:doc:`ordering-family`
	:doc:`pgr_cuthillMckeeOrdering` - Return reverse Cuthill-McKee ordering of an undirected graph.	:doc:`pgr_cuthillMckeeOrdering` - Ordenamiento Cuthill-McKee de grafo sin no dirigido.
	:doc:`pgr_topologicalSort` - Linear ordering of the vertices for directed acyclic graph.	:doc:`pgr_topologicalSort` - Orden lineal de los vértices para grafos acíclicos dirigidos.
	:doc:`metrics-family`	:doc:`metrics-family`
	:doc:`pgr_betweennessCentrality` - Calculates relative betweenness centrality using Brandes Algorithm	:doc:`pgr_betweennessCentrality` - Calcula la centralidad intermedia relativa mediante el algoritmo de Brandes
	:doc:`TRSP-family`	:doc:`TRSP-family`
	categories	Categorías
	:doc:`VRP-category`	:doc:`VRP-category`
	Shortest Path Category	Rutas más cortas Categoría
	:doc:`pgr_bellmanFord`	:doc:`pgr_bellmanFord`
	:doc:`pgr_dagShortestPath`	:doc:`pgr_dagShortestPath`
	:doc:`pgr_edwardMoore`	:doc:`pgr_edwardMoore`
	Planar Family	Familia Planar
	:doc:`pgr_isPlanar`	:doc:`pgr_isPlanar`
	Miscellaneous Algoritms
	:doc:`pgr_lengauerTarjanDominatorTree`	:doc:`pgr_lengauerTarjanDominatorTree`
	:doc:`pgr_stoerWagner`	:doc:`pgr_stoerWagner`
	:doc:`pgr_transitiveClosure`	:doc:`pgr_transitiveClosure`
	:doc:`pgr_hawickCircuits`	:doc:`pgr_hawickCircuits`
	Flow - Family of functions	Flow - Familia de funciones
	:doc:`pgr_maxFlow` - Only the Max flow calculation using Push and Relabel algorithm.	:doc:`pgr_maxFlow` - Solo el flujo máximo se calcula usando el algoritmo empuja y reetiquetado.
	:doc:`pgr_boykovKolmogorov` - Boykov and Kolmogorov with details of flow on edges.	:doc:`pgr_boykovKolmogorov` - Algoritmo Boykov y Kolmogorov con detalles del flujo en aristas.
	:doc:`pgr_edmondsKarp` - Edmonds and Karp algorithm with details of flow on edges.	:doc:`pgr_edmondsKarp` - Algoritmo Edmonds y Karp con detalles de flujo del flujo en aristas.
	:doc:`pgr_pushRelabel` - Push and relabel algorithm with details of flow on edges.	:doc:`pgr_pushRelabel` - Algoritmo empuja y reetiquetado con detalles del flujo en aristas.
	Applications	Aplicaciones
	:doc:`pgr_edgeDisjointPaths` - Calculates edge disjoint paths between two groups of vertices.	:doc:`pgr_edgeDisjointPaths` - Calcula rutas de aristas disjuntas entre dos grupos de vértices.
	:doc:`pgr_maxCardinalityMatch` - Calculates a maximum cardinality matching in a graph.	:doc:`pgr_maxCardinalityMatch` - Calcular una cardinalidad máxima de coincidencia dentro de un grafo.
	Flow Functions General Information	Información General de las Funciones de Flujo
	The graph is directed.	El grafo es dirigido.
	Process is done only on edges with positive capacities.	El proceso se realiza sólo en aristas con capacidades positivas.

Loading…

None String updated in the repository pgRouting pgRouting Spanish	English Miscellaneous Algoritms Spanish 19 characters edited Current translation Empty ~~Algoritmos diversos~~ 3 weeks ago
cvvergara Translation added pgRouting pgRouting Spanish	English Miscellaneous Algoritms Spanish 19 characters edited Translated Algoritmos diversos 3 weeks ago
mt:deepl Suggestion added pgRouting pgRouting Spanish	English Miscellaneous Algoritms Spanish 17 characters edited Algoritmos varios a month ago
None String added in the repository pgRouting pgRouting Spanish	English Miscellaneous Algoritms Spanish 0 characters edited Current translation Empty a month ago