Voozh

Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Misc7.7K+ articles

GATE CS1.1K+ articles

Hash831+ articles

Graph565+ articles

DFS360+ articles

Engineering Mathematics348+ articles

Discrete Mathematics48+ articles

Data Structures-Graph24+ articles

What is Chordal Graphs?

Last Updated: 23 July 2025

Chordal graphs, also known as triangulated graphs, are a class of undirected graphs characterized by the absence of "induced cycles" of length greater than three. This mea...read more

👁 article_image

Engineering Mathematics

Picked

graph-basics

Convert Adjacency List to Adjacency Matrix Representation of Graph

Last Updated: 27 October 2025

Given an adjacency list representation of a Graph, convert the given Adjacency List to Adjacency Matrix representation.Adjacency List: A list of lists where each list[i] s...read more

Add and Remove Edge in Adjacency Matrix representation of a Graph

Last Updated: 15 July 2025

Prerequisites: Graph and its representationsGiven an adjacency matrix g[][] of a graph consisting of N vertices, the task is to modify the matrix after insertion of all ed...read more

👁 article_image

Picked

DSA

interview-preparation

graph-basics

Visualize Graphs in Python

Last Updated: 15 July 2025

Prerequisites: Graph Data Structure And AlgorithmsA Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertice...read more

Last Updated: 12 July 2025

Parenthesis Theorem is used in DFS of graph. It states that the descendants in a depth-first-search tree have an interesting property. If v is a descendant of u, then the ...read more

👁 article_image

DSA

DFS

Data Structures-Graph

Algorithms-Graph Traversals

graph-basics

Maximize number of nodes which are not part of any edge in a Graph

Last Updated: 06 September 2022

Given a graph with n nodes and m edges. Find the maximum possible number of nodes which are not part of any edge (m will always be less than or equal to a number of edges ...read more

Basic Properties of a Graph

Last Updated: 23 January 2026

A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any...read more

👁 article_image

Graph

DSA

Data Structures-Graph

graph-basics

Find the Degree of a Particular vertex in a Graph

Last Updated: 01 August 2022

Given a graph G(V,E) as an adjacency matrix representation and a vertex, find the degree of the vertex v in the graph.Examples :0-----1|\ || \ || \|2-----3Input : ...read more

Graph representations using set and hash

Last Updated: 08 March 2023

We have introduced Graph implementation using array of vectors in Graph implementation using STL for competitive programming | Set 1. In this post, a different implementat...read more

Mathematics | Graph Theory Basics - Set 2

Last Updated: 26 May 2025

Graph theory is a basic branch of discrete mathematics that mainly focuses on the relationship between objects. These objects are called vertices and these vertices are jo...read more

👁 article_image

Misc

Engineering Mathematics

GATE CS

graph-basics

Discrete Mathematics

Representation of Graph

Last Updated: 29 October 2025

A Graph is a non-linear data structure consisting of vertices and edges. The vertices are sometimes also referred to as nodes and the edges are lines or arcs that connect ...read more

Breadth First Search or BFS for a Graph

Last Updated: 16 January 2026

Breadth First Search (BFS) is a graph traversal algorithm that starts from a source node and explores the graph level by level. First, it visits all nodes directly adjacen...read more

Depth First Search or DFS for a Graph

Last Updated: 28 March 2026

In Depth First Search (or DFS) for a graph, we traverse all adjacent vertices one by one. When we traverse an adjacent vertex, we completely finish the traversal of all ve...read more

URL: https://www.geeksforgeeks.org/tag/graph-basics/

⇱ graph-basics Archives - GeeksforGeeks