pgRouting/pgRouting — Spanish @ OSGeo Weblate: `Wikipedia: Graph coloring <https://en.wikipedia.org/wiki/Graph_coloring>`_

The translation is temporarily closed for contributions due to maintenance, please come back later.
The translation was automatically locked due to following alerts: Could not merge the repository.

Zen

Translation

English

Spanish

Needs editing

This translation is currently locked.

Skip

	English	Spanish	Actions
	An Edges SQL that represents a directed graph with the following columns	Un SQL de aristas que representa un grafo dirigido con las siguientes columnas
	Coloring - Family of functions	Coloración - Familia de funciones
	:doc:`pgr_sequentialVertexColoring` - Vertex coloring algorithm using greedy approach.	:doc:`pgr_sequentialVertexColoring`- Algoritmo de coloración de vértices mediante un enfoque codicioso.
	:doc:`pgr_bipartite` - Bipartite graph algorithm using a DFS-based coloring approach.	:doc:`pgr_bipartite` - Algoritmo de grafo bipartito mediante un enfoque de coloración basado en DFS.
	:doc:`pgr_edgeColoring` - Edge Coloring algorithm using Vizing's theorem.	:doc:`pgr_edgeColoring` - Algoritmo de coloración de segmentos utilizando el teorema de Vizing.
	Returns set of ``(vertex_id, color_id)``	Regresa el conjunto de ``(vertex_id, color_id)``
	``vertex_id``	``vertex_id``
	Identifier of the vertex.	Identificador del vértice.
	``color_id``	``color_id``
	Identifier of the color of the vertex.	Identificador del color del vértice.
	The minimum value of color is 1.	El valor mínimo de color es 1.
	Returns set of ``(edge_id, color_id)``	Regresa el conjunto de ``(edge_id, color_id)``
	``edge_id``	``edge_id``
	Identifier of the color of the edge.	Identificador del color del segmento.
	`Boost: Sequential Vertex Coloring algorithm documentation <https://www.boost.org/libs/graph/doc/sequential_vertex_coloring.html>`__	`Boost: Documentacion de Algoritmo de Coloración Secuencial de Vertices <https://www.boost.org/libs/graph/doc/sequential_vertex_coloring.html>`__
	`Wikipedia: Graph coloring <https://en.wikipedia.org/wiki/Graph_coloring>`__	`Wikipedia: Coloración de grafos <https://en.wikipedia.org/wiki/Graph_coloring>`__
	`Boost: is_bipartite <https://www.boost.org/libs/graph/doc/is_bipartite.html>`__	`Boost: es bipartido <https://www.boost.org/libs/graph/doc/is_bipartite.html>`__
	`Wikipedia: bipartite graph <https://en.wikipedia.org/wiki/Bipartite_graph>`__	`Wikipedia: grafo bipartito <https://en.wikipedia.org/wiki/Bipartite_graph>`__
	`Boost: Edge Coloring Algorithm documentation <https://www.boost.org/libs/graph/doc/edge_coloring.html>`__	`Boost: Algoritmo de Coloración de Segmentos <https://www.boost.org/libs/graph/doc/edge_coloring.html>`__
	`Wikipedia: Graph Coloring <https://en.wikipedia.org/wiki/Graph_coloring>`__	`Wikipedia: Coloración de grafos <https://en.wikipedia.org/wiki/Graph_coloring>`__
	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`
	In large graphs, like the road graphs, or electric networks, graph contraction can be used to speed up some graph algorithms. 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.	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 two algorithms:	Esta implementación proporciona un marco flexible para agregar algoritmos de contracción en el futuro, actualmente, admite dos algoritmos:

Loading…

None

String updated in the repository

English

Spanish 82 characters edited Current translation Translated

a year ago

Browse all string changes

Things to check

Reused translation

Other source string: “`Wikipedia: Graph Coloring <https://en.wikipedia.org/wiki/Graph_coloring>`__”

Reset

Glossary

English	Spanish
No related strings found in the glossary.

String information

String age

a year ago

Last updated

a year ago

Source string age

a year ago

Translation file

locale/es/LC_MESSAGES/pgrouting_doc_strings.po, string 841