Nota: La traducción de esta entrada está actualmente en revisión de calidad, por lo que parte del contenido se muestra temporalmente solo en inglés.
Esta entrada aún no se ha traducido a tu idioma, así que se muestra el original a continuación.
directed graph
This term is a technical specification used primarily in mathematics, computer science, and network theory. It describes a structure where the relationship between two nodes is asymmetrical, meaning a path from point A to point B does not automatically imply a path from point B to point A. This distinguishes it from an undirected graph, where edges are bidirectional by default.
In practical application, directed graphs are essential for modeling one-way systems such as website hyperlinks, social media following patterns, or dependency maps in software engineering. The term is almost exclusively used in formal, academic, or technical registers and is rarely encountered in casual conversation.
Meanings
Examples
A directed graph is used to model the flow of traffic in a city with one way streets.
We can represent the dependency between these software modules as a directed graph.
Is this a directed graph or an undirected one?
The state transitions of the finite automaton are mapped as a directed graph.
I need to implement a cycle detection algorithm for this directed graph.
The web is essentially a massive directed graph where pages are nodes and hyperlinks are edges.
The web is essentially a massive directed graph where pages are nodes and hyperlinks are edges.
Let us assume the network is represented by a weighted directed graph.
The project workflow is best visualized as a directed graph to show the sequence of tasks.