Undirected Graph
Last updated
What is Undirected Graph?
An Undirected Graph is a type of graph in which the edges are not directed. That is, they do not point in any specific direction and are not ordered pairs. They cannot be referred to as originating or ending node, instead, they are endpoints of the edges. In this type of graph, the edges essentially represent a two-way relationship, in the sense that, a travel can be made back and forth between the two vertices without any restriction. Every edge of the undirected graph always connects two different vertices or nodes.
More in stage 9: Graph Data Structures
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 44 of 107 in the free Data Structures & Algorithms roadmap, in stage 9, Graph Data Structures. If you are new to Data Structures & Algorithms, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.