directed graphs
[/dɪˈrɛktɪd ɡræfs/]
nounpl: directed graphs
grafos direcionados
1. A mathematical structure consisting of a set of vertices (nodes) connected by edges (arcs) where each edge has a direction associated with it, indicated by an arrow pointing from one vertex to another
In computer science, directed graphs are used to represent network topologies and dependencies between tasks.
Na ciência da computação, grafos direcionados são usados para representar topologias de rede e dependências entre tarefas.
2. A type of graph where each edge has a defined direction, allowing for asymmetric relationships between nodes
Directed graphs can model social networks where a follow relationship is not necessarily mutual.
Grafos direcionados podem modelar redes sociais onde uma relação de seguimento não é necessariamente mútua.
3. In graph theory, a graph in which edges are unidirectional, contrasting with undirected graphs where edges are bidirectional
The algorithm was optimized for directed graphs to efficiently compute shortest paths.
O algoritmo foi otimizado para grafos direcionados para calcular eficientemente os caminhos mais curtos.
Directed graphs are fundamental concepts in computer science and mathematics education globally. In Brazil, the term 'grafos direcionados' is standard in academic curricula at universities and technical courses. In Portugal, the term 'grafos orientados' is more commonly used in academic literature. This term is essential in the study of algorithms, network analysis, and data structure courses across both countries.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →