Directed Graph
Last updated
What is Directed Graph?
A directed graph is graph, i.e., a set of objects (called vertices or nodes) that are connected together, where all the edges are directed from one vertex to another. A directed graph is sometimes called a digraph or a directed network. In contrast, a graph where the edges are bidirectional is called an undirected graph.
Free resources to learn Directed Graph
- ArticleDirected Graph
More in stage 3: Asymptotic Notation
Directed Graph: common questions
Can I learn Directed Graph in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Directed Graph in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this Directed Graph tutorial for beginners?
It is lesson 19 of 188 in the free Computer Science roadmap, in stage 3, Asymptotic Notation. If you are new to Computer Science, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.