← Glossary
What does "directed graph" mean in programming?
directed graph is one of the most common terms in software development. This guide explains what it means, how it is used in practice, and why it matters, with real examples from the developer world.
Definition
A graph where each edge has a direction, going from one vertex to another but not necessarily back. Also called a digraph. Used to model one-way relationships like web links, task dependencies, and Twitter follows.
Example
"A task dependency graph is directed: task B depends on A, but A does not depend on B."
Related terms
Ready to practice your English at work?
Lingua-e has interactive exercises built around real developer conversations: standups, code reviews, retrospectives, and more. Practice until it comes naturally.
Try Lingua-e for free