Examples of using Directed graph in English and their translations into Spanish
{-}
-
Colloquial
-
Official
The algorithm takes as input a directed graph D⟨ V,
El algoritmo toma como entrada un grafo directo D⟨ V,For instance, if I is the category of the directed graph•→•, then CI has as objects the morphisms of C,
Por ejemplo, si I es la categoría del grafo dirigido*->*, entonces CI tiene como objetos los morfismos de C,Martin Tompa proposed a directed graph version of the Erdős number problem, by orienting edges of the collaboration graph from the alphabetically earlier author to the alphabetically later author and defining the monotone Erdős number of an author to be the length of a longest path from Erdős to the author in this directed graph.
Martin Tompa propuso una versión de grafo dirigido del problema del número de Erdős, orientando los ejes del And directed graphs, as I said, when we poke at the path.
Y en los grafos dirigidos, como dije, nos asomamos al camino.Category: Directed graphs- Wikipedia,
Categoría: Coloreo de grafos- Wikipedia,Transitive closure of directed graphs Warshall's algorithm.
Cierre transitivo en grafos dirigidos algoritmo de Warshall.This function is for directed graphs.
Esta función es para grafos dirigidos.The implementations in this post represent the problems as directed graphs(digraph).
Las implementaciones en este post representan los problemas como grafos dirigidos(dígrafo).In the case of directed graphs, when we.
En el caso de los grafos dirigidos, continuemos.Shortest paths in directed graphs Floyd's algorithm.
Camino mínimo en grafos dirigidos algoritmo de Floyd.The statement that event-driven process chains are ordered graphs is also found in other directed graphs for which no explicit node ordering is provided.
La afirmación de que las Cadenas Proceso impulsado por Eventos son gráficos ordenados se encuentra también en grafos dirigidos para cuales no se ofrece un ordenamiento de nodo explícito.it is possible to obtain a solution by considering the properties of certain directed graphs associated with the system.
es posible obtener una solución considerando las propiedades de ciertos gráficos dirigidos asociados con el sistema.Thus, signal-flow graph theory builds on that of directed graphs(also called digraphs),
Por lo tanto, la teoría de los The all-pairs shortest paths problem for unweighted directed graphs was introduced by Shimbel(1953),
El problema para grafos dirigidos no ponderados fue introducido por Shimbel(1953), quien observóthe tree data structure can be generalized to represent directed graphs by removing the constraints that a node may have at most one parent, and that no cycles are allowed.
la estructura de datos de árbol se puede generalizar para representar un grafo dirigido mediante la eliminación de las restricciones de que un nodo puede solo tener a lo sumo un padre, y que no se permiten ciclos.while the linear relations between them appear in the form of directed edges connecting the nodes… The associated directed graphs in many cases can be set up directly by inspection of the physical system without the necessity of first formulating the→associated equations….
las relaciones lineales entre ellas aparecen en forma de bordes A directed graph Main article: Directed graph.
Grafo dirigido Artículo principal: Grafo dirigido.Directed graph- Wikipedia Open main menu.
Grafo dirigido- Wikipedia, la enciclopedia libre.Directed graph- Wikipedia,
Grafo dirigido- Wikipedia,The signature is for a directed graph.
La firma es para un grafo dirigido.
