Undirected Graph
Last updated
What is Undirected Graph?
An undirected graph is graph, i.e., a set of objects (called vertices or nodes) that are connected together, where all the edges are bidirectional. An undirected graph is sometimes called an undirected network. In contrast, a graph where the edges point in a direction is called a directed graph.
Free resources to learn Undirected Graph
- ArticleUndirected Graph
More in stage 3: Asymptotic Notation
Undirected Graph: common questions
Can I learn Undirected 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 Undirected 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 Undirected Graph tutorial for beginners?
It is lesson 20 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.