Graph

A graph is an abstract data type that can represent complex, non-linear relationships between objects. There are different classifications of a graph, such as undirected or directed graphs, cyclic or acyclic graphs, weighted and unweighted graphs, etc. In computer science, graphs are the most extensively used data structure. This section will improve your graph understanding. We'll be dealing with a lot of graph-based problems and their solutions.

Introduction

In computer science, graphs are the most extensively used data structure. This section will improve your graph understanding. We'll be dealing with a lot of graph-based problems and their solutions.

Introduction to Graphs

By Neelakshi Lahiri

● Published At Oct 2021

Graphs in data structures and algorithms are an essential part of problem-solving. This article gives an introduction to the graph data structure.... Keep reading ..

Graph Representation

By Kabir Singh

● Published At Oct 2021

A graph can be defined as a network of different vertices and nodes. In this blog, we'll look at the various types of graph representation.... Keep reading ..

Implementation of Graph in Java

By Manvi Chaddha

● Published At Oct 2021

Graphs are one of the most important data structures. This article discusses the Implementation of Graph in Java.... Keep reading ..

Implementation of Graph in Python

By Manvi Chaddha

● Published At Oct 2021

Questions related to Graphs are frequently asked in technical interviews. This blog discusses the implementation of Graphs in Python using different ways in detail.... Keep reading ..

Graph Theory

By Shreya Deep

● Published At Oct 2021

Graph data structures are among the most important and exciting topics to learn in computer science. This article will throw light on various concepts of graph theory.... Keep reading ..

Graph Types and Applications

By Aditya Narayan Joardar

● Published At Feb 2022

This article discusses the different types of graphs and their various applications... Keep reading ..

Construct a Graph from the size of components of each node

By Yukti Kumari

● Published At Dec 2021

This article explains the problem of constructing a graph from the size of components of each node.
... Keep reading ..

Graph And Tree

By Soumya Agrawal

● Published At Dec 2021

In this article, we will be focusing on the difference between graph and tree.... Keep reading ..

Pendant Vertices, Non-Pendant vertices, Pendant Edges, and Non-Pendant Edges of the Graph.

By Vaibhav Agarwal

● Published At Dec 2021

In this article, we will discuss what are Pendant Vertices, Non-Pendant vertices, Pendant Edges, and Non-Pendant Edges of the Graph.... Keep reading ..

Properties of Graph

By Yukti Kumari

● Published At Oct 2021

This article deals with the properties of graphs which are used to characterise different types of graphs like eccentricity of a vertex etc.
... Keep reading ..

Important graph problems for Interviews (Basic Problems)

By SHIKHAR SONI

● Published At Mar 2022

This article discusses some of the most important graph problems, emphasising easier problems.... Keep reading ..

Important graph problems for Interviews (Advanced Problems)

By SHIKHAR SONI

● Published At Mar 2022

This article discusses some of the most important graph problems, emphasising advanced problems.... Keep reading ..

Traversal

The process of exploring each vertex in a graph is known as graph traversal. Every problem on the graph includes traversing in some way. To avoid getting stuck in cycles, it's usually required to maintain track of visited vertices. DFS (Depth-first search) and BFS (Breadth-first search) are the two primary graph traversal strategies.

Breadth First Search(BFS)

Breath first search, or BFS, is a well-known graph/tree traversal algorithm. The core concept is that each node pays a visit to each of its children b

Depth First Search(DFS)

Depth-first search is a technique for traversing or exploring data structures such as trees and graphs. The algorithm begins at the root node and trav

General Problems

Proficiency in the practices of data structures and algorithms is essential for acing any coding test/interview. Many of the difficulties we face on a

Operations on Graph

In Computer Science, a Graph is a non-linear data structure that finds its use in numerous real-life problems ranging from Social Networking applications to Path Optimization problems. The graph data structure consists of nodes/vertices which are connected by edges.
The following are the operations that can be performed on Graph data structure:
1. Insert edge
2. Delete edge
3. Insert vertex
4. Delete vertex
5. Find the vertex
6. Graph traversal
7. Display graph

Shortest Path

Shortest path algorithms help us to find the shortest possible path between two vertices/nodes in a graph. There are two types of shortest path proble

Connectivity

Connectivity in a graph means that there is a path between every pair of the vertex in the graph. In graph theory, Connectivity is a simple yet very w

Cycles

Cycles in a graph refer to a non-empty path of vertices in which the first and last vertices are equal. On the basis of the presence of cycles in a gr

Minimum Spanning Tree(MST)

The spanning tree's cost is equal to the sum of the weights of all the tree's edges. Many spanning trees are possible. The spanning tree with the lowest cost among all the spanning trees is known as the minimum spanning tree. There can also be a large number of minimal spanning trees.

General Problems

We will discuss how to solve different types of questions based on MST: 1. Conceptual questions based on MST, 2. How to find the weight of the minimum

Properties of Minimum Spanning Tree (MST)

By GAZAL ARORA

● Published At Dec 2021

In this article, we will read about the Minimum Spanning Tree( MST) and its properties, including multiplicity, cut property, cycle property, and uniqueness of MST.
... Keep reading ..

Kruskal's Algorithm

By Shreya Deep

● Published At Oct 2021

In this article, we will learn how to find the minimum spanning tree using Kruskal's algorithm.... Keep reading ..

Problems

Minimum Spanning Tree(MST) is a standard problem that can be solved using Prim's and Kruskal's algorithm. Apart from solving the general problems, It is necessary to practice some more logical problems based on MST. Let us look at the top problems on the Minimum Spanning Trees topic that could be asked in the Interviews of the Product-Based companies.

Articulation Points in a Graph

By GAZAL ARORA

● Published At Jan 2022

A vertex is called an articulation point or a cut vertex if removing it disconnects the graph. In this article, we will write an algorithm to find all articulation points in a given graph.... Keep reading ..

Minimum Cut on a Graph Using a Maximum Flow Algorithm

By Nishant Rana

● Published At Feb 2022

This blog will cover how to calculate the Minimum Cut on a Graph Using a Maximum Flow Algorithm.
... Keep reading ..

Find Node Having Maximum Number of Common Nodes with a Given Node K

By Anant Dhakad

● Published At Jan 2022

In this blog, we will discuss the BFS traversal of an undirected graph. We will also see the concept of levels used in BFS.... Keep reading ..

Find first undeleted integer from K to N in given unconnected graph after performing Q queries.

By Jaglike Makkar

● Published At Feb 2022

In this article, we will discuss how to find the first undeleted integer from K to N in the given unconnected graph for Q queries of two types - delete K and find the first undeleted integer from K to N. We will also focus on the time and space compl... Keep reading ..

Maximum element in the connected component of the given node for Q queries

By Jaglike Makkar

● Published At Feb 2022

In this article, we will discuss the approach to finding the maximum element in the connected component of a given node for multiple queries. We will also focus on our approach’s time and space complexity.... Keep reading ..

Find the number of connected grids of a given size in a 2D-Matrix

By Gaurish Anand

● Published At Feb 2022

This article will find the number of connected grids of a given size in a 2D matrix for multiple queries.... Keep reading ..

Minimum nodes to be colored in a graph such that every node has a colored neighbor

By Firdausia Fatima

● Published At Jan 2022

In this blog, We'll use the BFS traversal method to tackle the problem ‘Minimum nodes to color, so every node has a colored neighbor.’... Keep reading ..

Graph Coloring

By Nishant Rana

● Published At Feb 2022

This blog will cover the theory and applications of the Graph Coloring problems.
... Keep reading ..

DSatur Algorithm for Graph Coloring

By Ujjawal Gupta

● Published At Jan 2022

In this blog, we will learn to solve a problem based on graph coloring. We will discuss the DSatur algorithm for graph coloring... Keep reading ..

Minimum Operations to Convert Number

By Ishita Chawla

● Published At Dec 2021

This blog will discuss the problem of Minimum Operations to Convert Number using BFS.
... Keep reading ..

## Top Problems related to Graph

Colour The Graph

Properties of MST in a Undirected Graph

Detect Cycle in a Undirected Graph

Alien dictionary

DFS Traversal

Minimum Time in Wormhole Network

Minimum Spanning Tree

Count Ways

Detect Cycle in an Undirected Graph

Bridges In A Graph

Minimum steps to reach target by a Knight

Dijkstra's shortest path

Reachable Nodes

Path Queries

Shortest Path

Path Reversals

Road Constructor

Check If Path Exists

Roads

Number Of Triangles In An Undirected Graph

Detect Cycle in a Directed Graph