New update is available. Click here to update.

Graph

A graph is a type of non-linear data structure. A graph is defined as a group of vertices, and edges are used to connect these vertices. There are many different types of graphs, such as directed, undirected, weighted, unweighted, cyclic, acyclic, etc. There are many real-life applications of the graph. They are used in maps, social media, path optimization algorithms, etc.

Introduction to Graphs

By Neelakshi Lahiri

● Published 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 Theory

By Shreya Deep

● Published 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 Representation

By Kabir_dc27

● Published 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 ...

Properties of Graph

By Yukti Kumari

● Published 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 ...

Graph Types and Applications

By Aditya Narayan Joardar

● Published Feb, 2022

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

A Guide to Master Graph Algorithms for Competitive Programming

By Neha Singh

● Published Jan, 2023

This article will provide you with a guide to master graph algorithms for competitive programming....Keep reading ...

Implementation of Graph in Java

By Manvi_Chaddha

● Published 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 Oct, 2021

Representing a Graph using Set and Hash

By Manan Singhal

● Published Sep, 2022

In this article, we will implement graph representation using set and hash....Keep reading ...

Construct a Graph from the size of components of each node

By Yukti Kumari

● Published 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 Dec, 2021

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

Mother vertex in a Graph

By Manan Singhal

● Published Sep, 2022

In this article, we will find the mother vertex in a graph....Keep reading ...

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

By Vaibhav Agarwal

● Published 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 ...

Print All Mother Vertices In The Graph

By Vaibhav Agarwal

● Published Aug, 2022

In this article, we will discuss the problem of finding all mothers of the graph, we will discuss the naive as well as an efficient approach for finding the mother vertices. ...Keep reading ...

Dynamic Connectivity Problem

By Kushleen Waraich

● Published Sep, 2022

This blog guides you regarding the Dynamic Connectivity Problem, Basic operations that are required to solve this problem and their implementation in Java. ...Keep reading ...

Graph Traversal Techniques in DFS BFS

By Gunjan Batra

● Published Feb, 2023

In this blog, we will discuss Graph Traversal Techniques in DFS & BFS....Keep reading ...

Breadth-First Search

By Raksha jain

● Published Jan, 2022

The blog discusses "Breadth-First Search Traversal of the Graph." We'll discuss an interesting approach to solve the problem and its time and space complexity too. ...Keep reading ...

Best First Search or Informed Search

By Upendra Prasad Mahto

● Published Sep, 2022

In this article, we will discuss Best First Search or Informed Search with proper examples and Implementation. ...Keep reading ...

BFS in Disconnected Graph

By Teesha Goyal

● Published Sep, 2022

This article discusses the concept of performing Breadth-First-Search(BFS) in a disconnected graph....Keep reading ...

BFS Using Vectors & Queue as per the Algorithm of CLRS

By Teesha Goyal

● Published Sep, 2022

This article discusses the concept of performing Breadth-First-Search(BFS) using vectors & queues as per the algorithm mentioned in the CLRS book....Keep reading ...

Breadth-First Traversal Applications

By Indrajit Kumar

● Published Sep, 2022

In this blog, we will learn about the Breath-First Search application and its implementation....Keep reading ...

Minimum length paths between 1 to N including each node

By Aditya Narayan Joardar

● Published Feb, 2022

This article discusses how to calculate the minimum length paths between node 1 to N including each....Keep reading ...

Check if the given permutation is a valid BFS of a given tree

By Ishita Chawla

● Published Dec, 2021

This blog will discuss the famous problem, check if the given permutation is a valid BFS of a given tree....Keep reading ...

Find integral points with minimum distance from given set of integers using BFS

By chourasiya_aman

● Published Nov, 2021

In this blog, we will take up a problem based on BFS - Breadth-First Search. We will use a common variant of BFS namely, multi-source BFS to solve the problem....Keep reading ...

DFS Traversal of a Graph - Iteratively

By Gaurish Anand

● Published Feb, 2022

In this article, we will see the DFS traversal of a graph iteratively. ...Keep reading ...

DFS(Depth First Search) Algorithm

By Aman Srivastava

● Published Mar, 2023

This article will discuss the DFS algorithm in detail, including its applications, pseudo-code, example, and efficient implementation steps....Keep reading ...

DFS for an n-ary Tree(Acyclic Graph) Represented as an Adjacency List

By Adithi Mahesh

● Published Oct, 2022

Read this article to learn about an n-ary tree, the acyclic graph represented as an Adjacency list. You will learn about DFS applied on the n-ary tree. ...Keep reading ...

Implementation of DFS using Adjacency Matrix

By Kushleen Waraich

● Published Jan, 2022

This article will discuss the implementation of DFS using an adjacency matrix and how to approach this problem....Keep reading ...

DFS using Adjacency Matrix

By Neha Singh

● Published Jan, 2023

In this article, you will learn Depth-first search using Adjacency Matrix. You will learn how to implement it and the recursive approach of the implementation. ...Keep reading ...

Depth-First Search Applications

By Indrajit Kumar

● Published Sep, 2022

In this blog, we will learn about the Depth-First Search application and its implementation....Keep reading ...

Iterative Deepening Search(IDS) vs. Iterative Deepening Depth First Search(IDDFS)

By Kanak Rana

● Published Jan, 2023

In this article, we will learn the difference between Iterative Deepening Search(IDS) and Iterative Deepening Depth First Search(IDDFS). ...Keep reading ...

Check if there are at least T continuous blocks of 0s or not in a Binary Matrix

By Sahil Setia

● Published Jan, 2022

In this blog, we will learn to check if there are at least T continuous blocks of 0s or not in a Binary Matrix....Keep reading ...

Find Regions with Most Common Region Size in a Given Boolean Matrix

By Abhishek Ranjan

● Published Dec, 2021

In this article, we will try to solve a graph theory problem that can be asked in the interviews....Keep reading ...

Number of nodes at a given level in a tree using Breadth-First Search

By Musical Matrix

● Published Sep, 2022

This blog helps you clearly understand the concept of the Number of nodes at a given level in a tree using BFS. ...Keep reading ...

Euler and Hamiltonian Paths

By Harsh Goyal

● Published Nov, 2021

This article will introduce Euler and Hamiltonian paths and discuss approaches to use them in different data structure problems. ...Keep reading ...

Clone of an undirected graph

By dhananjay kumar

● Published Dec, 2021

This article contains information on how to clone an undirected graph using DFS approach....Keep reading ...

Clone a Directed Acyclic Graph

By Vibhor_376

● Published Dec, 2021

This article will discuss the problem to clone a directed acyclic graph. ...Keep reading ...

Word Ladder

By GAZAL ARORA

● Published Dec, 2021

In this article, we will solve a programming problem: Given a dictionary of words, find the length of the shortest chain to reach a target word from a given start word. ...Keep reading ...

Accounts Merge

By Ishita Chawla

● Published Nov, 2021

In this blog, we will discuss the problem of Accounts Merge using Depth First Search and discuss its time and space complexity. ...Keep reading ...

All-Pairs Shortest Paths

By Aman kumar Chourasiya

● Published Nov, 2022

All Pair Shortest Path problem is an extension of finding the shortest path between a node and all other nodes in a graph. In this problem, we compute the shortest paths between all pairs of nodes in a graph....Keep reading ...

Dijkstra's Algorithm

By Aditya Narayan Joardar

● Published Dec, 2021

In this article, we will discuss Dijkstra’s Algorithm with various examples and explanations....Keep reading ...

Bellman Ford Algorithm

By Hari Sapna Nair

● Published Oct, 2021

In this article we discuss one of the popular Graph Algorithms - Bellman-Ford along with it's Java implementation and its complexity....Keep reading ...

Floyd Warshall Algorithm

By Manvi_Chaddha

● Published Oct, 2021

Floyd Warshall Algorithm is an important Graph algorithm, and this article provides a crisp explanation of it along with code in Java....Keep reading ...

Ford-Fulkerson Algorithm for Maximum Flow

By Indrajit Kumar

● Published Oct, 2022

In this article, We will discuss Ford-Fulkerson Algorithm for Maximum Flow....Keep reading ...

Dijkstra’s Algorithm vs Floyd–Warshall’s Algorithm

By Shiva

● Published Oct, 2022

In this blog, we have discussed Dijkstra’s Algorithm vs Floyd–Warshall’s Algorithm, and the key differences between them....Keep reading ...

Assign Directions to Edges so that the Directed Graph remains Acyclic

By Kartik Kukreja

● Published Dec, 2022

In this blog, we'll be solving a problem on a graph, i.e., Assign Directions to Edges so that the Directed Graph remains Acyclic....Keep reading ...

Introduction to Karger's Algorithm for Minimum Cut

By Upendra Prasad Mahto

● Published Oct, 2022

This article will discuss Introduction to Karger's Algorithm for Minimum Cut with an example....Keep reading ...

Introduction to Push Relabel Algorithm

By Upendra Prasad Mahto

● Published Oct, 2022

This article will discuss the Push Relabel algorithm....Keep reading ...

Implementation of Push Relabel Algorithm

By Upendra Prasad Mahto

● Published Oct, 2022

We will discuss the Implementation of the Push Relabel Algorithm and an example....Keep reading ...

Transitive closure of a Graph

By Amarjeet Kumar

● Published Sep, 2022

In this article, We'll briefly introduce the transitive closure of graph....Keep reading ...

Transitive Closure Of a Graph Using Recursion

By Shaurya Singhal

● Published Oct, 2022

This article will discuss all the points associated with the transitive closure of a graph. We will also look at an algorithm to solve the transitive closure of a graph....Keep reading ...

Topological Sorting in a Graph

By AkritiBhan

● Published Sep, 2022

After learning basic terms, we will look at the code for the problem and analyze the time and space complexities of topological sorting in a graph in this blog. ...Keep reading ...

Topological Sort of a Graph Using Departure Time of Vertex

By Deependra Singh

● Published Sep, 2022

This blog covers a graph problem in which we have to find the topological sort of a graph using the departure time of the vertex. ...Keep reading ...

All Topological Sorts of a Directed Acyclic Graph

By Navrachit

● Published Sep, 2022

We will discuss all the topological sorts of a directed acyclic graph....Keep reading ...

Find Maximum Shortest Distance in Each Component of a Graph

By Nishant Rana

● Published Feb, 2022

This blog will cover the question to find the maximum shortest distance in each component of a Graph. ...Keep reading ...

Why does Dijkstra’s algorithm fail on negative weights?

By Shreya Deep

● Published Dec, 2021

In this article, we will find out why Dijkstra's algorithm fails on negative edge weights....Keep reading ...

Johnson’s Algorithm for All-Pairs Shortest Paths

By Abhishek Ranjan

● Published Jan, 2022

In this article, we will discuss Jhonson's Algorithm for the all-pairs shortest path and try to understand its time complexity....Keep reading ...

Difference between the shortest and second shortest path in an Unweighted Bidirectional Graph

By Abhishek Ranjan

● Published Dec, 2021

In this article, we will try to solve a graph theory problem Difference between the shortest and second shortest path in an Unweighted Bidirectional Graph that can be asked in the interviews. ...Keep reading ...

Number of Islands

By Alisha

● Published Nov, 2021

This article covers the approach and Implementation of the problem Number of Islands in java. ...Keep reading ...

Find the number of islands

By Aditya Narayan Joardar

● Published Dec, 2021

This article discusses finding the number of islands in a given 2D matrix using DFS....Keep reading ...

Find Number of Islands

By Teesha Goyal

● Published Jan, 2023

In this article, we will discuss the problem of finding the number of islands....Keep reading ...

Count Cycles of Length n in an Undirected and Connected Graph

By soham Medewar

● Published Oct, 2022

In this article, we will solve the problem of counting cycles of the length of n in an undirected connected graph. Also, will see the implementation of the problem in various languages....Keep reading ...

Check if there is a Cycle with Odd Weight Sum in an Undirected Graph.

By Kumar Saurav

● Published Sep, 2022

In this article, we will discuss the problem statement. Then two examples. We will focus on making the graph and visualizing it. Then the Algorithms. Finally, code for the problem....Keep reading ...

Max Flow Problem

By Shaurya Singhal

● Published Oct, 2022

This article will discuss all the points associated with the max flow problem. We will also look at an algorithm to solve the max flow problem....Keep reading ...

Minimum Edge Reversals to Make a Root

By Ankit Mishra

● Published Sep, 2022

In this blog, we will be learning how to determine the number of edge reversals required to make a root. ...Keep reading ...

Maximum Edges that can be Added to Directed Acyclic Graph so that it Remains Directed Acyclic Graph

By Navrachit

● Published Sep, 2022

The following article provides a solution to the problem of finding the maximum edges that can be added to a directed acyclic graph so that it remains a directed acyclic graph....Keep reading ...

Weakly Connected Components in a Directed Graph

By GAZAL ARORA

● Published Jan, 2022

A directed graph is weakly connected if its undirected graph is connected. In this article, we will find weakly connected components in a given directed graph. ...Keep reading ...

Implementations and Applications of Karger’s Algorithm for Minimum Cut

By Ayushi Goyal

● Published Feb, 2023

In this article, we will discuss the implementations and applications of Karger’s algorithm for a minimum cut along with its time and space complexity. ...Keep reading ...

Karp’s Minimum Mean (or Average) Weight Cycle Algorithm

By Teesha Goyal

● Published Oct, 2022

This article will discuss the algorithm and implementation of Karp’s Minimum Mean (or Average) Weight Cycle Algorithm....Keep reading ...

Detect Cycles in a Directed Graph

By Gorakhnath yadav

● Published Oct, 2021

In this blog, we will learn about the Depth First Search traversal-based method to detect cycles in a directed graph with its implementation and complexity....Keep reading ...

Detect cycle in a directed graph using colors

By yuvatimankar

● Published Sep, 2022

This article will discuss how to detect cycles in a directed graph using colors with some examples in detail....Keep reading ...

Detect Cycle in Undirected Graph

By Gorakhnath yadav

● Published Oct, 2021

In this blog, we will learn about the Depth First Search traversal-based method to detect cycles in an undirected graph....Keep reading ...

Check if a Graph has a Cycle of Odd Length

By AkritiBhan

● Published Sep, 2022

The blog discusses cycles in a graph and the concept of a bipartite graph. Finally, it shows how to find if the graph has a cycle of odd length ...Keep reading ...

Detect a Negative Cycle in a Graph using Shortest Path Faster Algorithm

By Riya

● Published Feb, 2022

This article will discuss how to detect a negative cycle using shortest path faster algorithm in a given graph, its C++ implementation, and its time and space complexity....Keep reading ...

Maximum Bipartite Matching in Graph

By Ashish Sharma

● Published Nov, 2022

In this article, we will discuss graph data structure, bipartite matching, the bipartite graph in brief, examples, approach, and how to solve maximum bipartite matching in graph problem, with time, and space complexity. ...Keep reading ...

Bidirectional Search in Graph

By Rupal Saluja

● Published Nov, 2022

In this article, we will learn in brief about Graphs and their two traversal techniques, Breadth First Search (BFS) and Depth First Search (DFS). We will also discuss how bidirectional search works in a graph data structure. ...Keep reading ...

Introduction and Properties of Minimum Spanning Tree

By Neelakshi Lahiri

● Published Oct, 2021

This article introduces a minimum spanning tree and discusses some of its essential properties. ...Keep reading ...

Properties of Minimum Spanning Tree (MST)

By GAZAL ARORA

● Published 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 Oct, 2021

The following article discusses the popular Kruskal's Algorithm used to find the Minimum Spanning Tree along with its implementation and time and space complexity....Keep reading ...

Kruskal’s Minimum Spanning Tree

By Mayank Goyal

● Published Sep, 2022

In this article, we will discuss Kruskal’s Minimum Spanning Tree Algorithm. We will also implement Kruskal's algorithm in various languages....Keep reading ...

Prims Algorithm- Minimum Spanning Tree (MST)

By Kushleen Waraich

● Published Sep, 2022

This article is all about the Prims Algorithm- Minimum Spanning Tree including the implementation in C++ and Java....Keep reading ...

Prim’s Minimum Spanning Tree

By soham Medewar

● Published Sep, 2022

In this article, we will be discussing Prim’s Minimum Spanning Tree Algorithm. We will also implement Prim’s algorithm in various languages....Keep reading ...

What is the Difference Between Kruskal and Prims Algorithm?

By Rajat Agrawal

● Published Sep, 2022

In this blog, we will learn the difference between Kruskal and Prims algorithms....Keep reading ...

Minimum Product Spanning Tree

By soham Medewar

● Published Oct, 2022

In this article, we will be solving the problem of the minimum product spanning tree....Keep reading ...

Total Number of Spanning Trees in a Graph

By Mayank Goyal

● Published Oct, 2022

This article will discuss the spanning tree. We will learn how to find the total number of spanning trees in a graph....Keep reading ...

Minimum Cost to Connect all Cities

By Yukti Kumari

● Published Dec, 2021

This article discusses one of the famous graph problems - Minimum Cost to Connect all cities along with an approach and implementation to solve it....Keep reading ...

Commutable Island

By Nishant Rana

● Published Feb, 2022

In this blog, we will solve the problem of Commutable Islands and discuss the time and space complexity of some approaches. ...Keep reading ...

Steiner Tree Problem

By Jaskirat Singh Saggu

● Published Nov, 2022

This blog offers a detailed guide to help understand the Steiner Tree Problem. It also briefly describes the Steiner tree, the approach, the algorithm, and the solution to the problem. To know more about it, read on! ...Keep reading ...

Application of Graph Data Structure

By Ayush Mishra

● Published Feb, 2023

In this blog, we will discuss the application of graph data structure. We will further discuss real-life examples of graph data structure. ...Keep reading ...

Important graph problems for Interviews (Basic Problems)

By SHIKHAR_SONI

● Published 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 Mar, 2022

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

Check whether given degrees of vertices represent a Graph or Tree

By Amarjeet Kumar

● Published Sep, 2022

In this article, we will check whether given degrees of vertices represent a Graph or Tree....Keep reading ...

Check if there is a Path between Two Vertices in a Directed Graph

By Siddhant_007

● Published Sep, 2022

This blog will discuss Common interview questions; check if there is a path between two vertices in a directed graph. ...Keep reading ...

Parallel Courses III

By Pranav Gautam

● Published Dec, 2021

Learn to find the minimum number of months required to complete all the parallel courses given as a graph....Keep reading ...

Waterflow Problem

By Jaskirat Singh Saggu

● Published Jul, 2022

This blog offers a detailed guide on the Waterflow Problem and explains its approach in detail. To know more about it, read on! ...Keep reading ...

Water Connection Problem

By Vibhor_376

● Published Dec, 2021

This article will discuss the water connection problem....Keep reading ...

Implement Water Supply System

By Vaibhav Agarwal

● Published Dec, 2021

In this article, we will discuss the problem of implementing a water supply system....Keep reading ...

Course Schedule

By Shreya Deep

● Published Oct, 2021

In this article, we’ll learn how to solve the problem named Course Schedule where we have to find the correct ordering of tasks using topological sorting. ...Keep reading ...

Construct a graph from the given degrees of all vertices

By yuvatimankar

● Published Sep, 2022

This article will discuss constructing a graph from the given degrees of all vertices....Keep reading ...

Find All Possible Words in a Board of Characters

By Sneha Mallik

● Published Sep, 2022

In this blog, we will find all possible words in a board of characters along with its code, algorithm and example....Keep reading ...

Find Minimum Weight Cycle in an Undirected Graph

By Rajat Agrawal

● Published Sep, 2022

In this blog, we will learn how to find the minimum weight cycle in an undirected graph....Keep reading ...

Find the Shortest Path in a Weighted Graph where the Weight of an Edge is 1 or 2

By Indrajit Kumar

● Published Oct, 2022

In this blog, we will solve a Data Structure and Algorithm related problem of Finding the Shortest Path in a Weighted Graph where the Weight of an Edge is 1 or 2 from the topic Graph.i...Keep reading ...

Find the Sum of Dependencies in a Graph

By Rashi

● Published Oct, 2022

In this article, we will design an algorithm for finding the sum of a dependency graph....Keep reading ...

Minimum Cost Path in a Directed Graph via a Given Set of Necessary Nodes

By Apoorv

● Published Feb, 2022

This article will discuss finding a Minimum Cost Path in a directed graph via a given set of intermediate nodes. The blog also focuses on time and space complexity for the solution....Keep reading ...

Eulerian Path and Circuit

By Siddhant_007

● Published Oct, 2022

This blog will discuss Common interview questions, Eulerian path, and circuit....Keep reading ...

Printing Eulerian Path using Fleury's Algorithm

By Adya_Tiwari

● Published Oct, 2022

In this article, we will see the Eulerian path and Fleury's algorithm and how one is used for the other. ...Keep reading ...

Print all Paths from a Given Source to a Destination

By Aditya Narayan Joardar

● Published Dec, 2021

This article discusses how to find a path that exists between any two given nodes in a graph briefly touching on the concepts of DFS and its implementation....Keep reading ...

Print the Longest Path Between Any Pair of Vertices

By Deependra Singh

● Published Sep, 2022

This blog covers a graph problem in which we have to find the longest path between any pair of vertices....Keep reading ...

Paths in Dijkstra’s Shortest Path Algorithm

By Kanak Rana

● Published Oct, 2022

This blog will look into Paths in Dijkstra's Shortest Path Algorithm, including program and time and space complexity....Keep reading ...

k’th Heaviest Adjacent Node in a Graph where Each Vertex has Weight

By yuvatimankar

● Published Oct, 2022

This article will discuss how to find k’th heaviest Adjacent node in a Graph where each vertex has a weight, with an example....Keep reading ...

How to check if an array of strings can form a circle or not?

By Gorakhnath yadav

● Published Oct, 2021

In this blog, we learned about how to check if a given array of strings can form a circle or not. Read more to learn the detailed solution....Keep reading ...

Number of distinct Shortest Paths from Node 1 to N in a Weighted and Directed Graph

By Abhishek Ranjan

● Published Dec, 2021

n this article, we will try to solve a graph theory problem that can be asked in the interviews....Keep reading ...

Find all Reachable Nodes from Every Node Present in a Given Set

By yuvatimankar

● Published Oct, 2022

This article will design an algorithm to find all reachable nodes from every node present in a given set. ...Keep reading ...

Calculate the number of sink nodes in a graph

By Anuradha_8356

● Published Sep, 2022

In this article, we will be discussing the approaches to calculate the number of sink nodes in a graph....Keep reading ...

Maximize the shortest path between given vertices by adding a single edge

By Apoorv

● Published Feb, 2022

This article will discuss the solution of the problem “Maximize the shortest path between given vertices by adding a single edge” ...Keep reading ...

Minimum Cost using Dijkstra by reducing the cost of an Edge

By Ishita Chawla

● Published Dec, 2021

This blog will discuss the problem of minimum cost using Dijkstra by reducing the cost of an edge....Keep reading ...

Minimum Number of Swaps Required to Sort an Array

By Kushleen Waraich

● Published Dec, 2021

This article revolves around the minimum number of swaps to sort an array. It will focus on various swaps required and the algorithmic approach to use them in C++ programming language. ...Keep reading ...

Minimum Edges to Reverse to Make the Path from a Source to a Destination

By Amarjeet Kumar

● Published Sep, 2022

In this article, We will discuss a question of Minimum edges to reverse to make path from a source to a destination....Keep reading ...

Minimum cost path with left, right, bottom, and up moves allowed

By Manan Singhal

● Published Sep, 2022

In this article, we will find the minimum cost path from one grid position to another position using left, right, bottom, and up moves....Keep reading ...

Shortest distance from a guard in a bank

By Teesha Goyal

● Published Sep, 2022

In this article, we will see the question Find Shortest Distance from a Guard in a Bank...Keep reading ...

Check whether the given graph is a tree or not

By Vidhu Chaudhary

● Published Aug, 2022

In this blog, we will discuss the approach to check whether the given graph is a tree or not....Keep reading ...

Check if a Cycle Exists Between Nodes S and T in an Undirected Graph with only S and T Repeating

By Vibhor_376

● Published Dec, 2021

In this blog, we will discuss the DFS traversal of an undirected graph. We will also see the application of DFS in cycle detection....Keep reading ...

Check If Removing a Given Edge Disconnects a Graph

By Sanchit Kumar

● Published Sep, 2022

This article will discuss a scenario related to the bridge. To check if removing a given edge disconnects a graph....Keep reading ...

Check if a Given Graph is Star

By Rhythm Jain

● Published Oct, 2022

This article discusses how we can find if a given graph represents a star or not....Keep reading ...

Move weighting scale alternate under given constraints

By Shivani Singh

● Published Oct, 2022

In this blog, we will discuss moving weighting scale alternate under given constraints., sample example, its algorithm, its implementations in other languages like C++ and Java, and the complexity analysis of the approach. ...Keep reading ...

Count the minimum number of edges between two vertices of a Graph

By Divyanshi Yadav

● Published Oct, 2022

In this blog, we will discuss how to count the number of edges between 2 given vertices, sample examples, its algorithm, its implementations in other languages like C++ and Java, and the complexity analysis of the approach....Keep reading ...

Count the nodes within K-distance from all nodes in a set

By Divyanshi Yadav

● Published Oct, 2022

In this blog, we will discuss how to count the nodes with k- distance from all nodes in a set, sample examples, its algorithm, its implementations in other languages like C++ and Java, and the complexity analysis of the approach....Keep reading ...

Count the number of cyclic elements in an array where we can jump according to the value

By Shiva

● Published Sep, 2022

In this blog, we have discussed a graph-based problem called “Count the number of cyclic elements in an array where we can jump according to the value.”...Keep reading ...

Count of Simple Cycles in a Connected Undirected Graph Having N Vertices

By Aditya Gupta

● Published Jan, 2022

This blog will discuss the problem named count of simple cycles in a connected undirected graph having N vertices with an example and implementation....Keep reading ...

Count Number of Edges in an Undirected Graph

By Saksham Gupta

● Published Sep, 2022

In this article, we will count the number of edges in an undirected graph. ...Keep reading ...

Count the Number of Trees in a Forest

By Pratyush Singh_Kmc

● Published Sep, 2022

This article will provide you with the implementation of the problem, Counting the number of Trees in a Forest....Keep reading ...

Check if an Array of Strings can be Chained to Form a Circle

By Ayushi Goyal

● Published Sep, 2022

In this blog, we have discussed a problem statement based on an array of strings called check if an array of strings can be chained to form a circle....Keep reading ...

Check if a Graph is Strongly Connected

By Musical Matrix

● Published Sep, 2022

This blog helps you clear your understanding of Kosaraju's algorithm and dry run with various examples to have a clear idea....Keep reading ...

Biconnected Graph

By Kanak Rana

● Published Sep, 2022

In this blog, we will look into biconnected Graphs and try to understand the topic with the program better along with the time and space complexities. ...Keep reading ...

Bridges in a Graph

By Prakriti Gupta

● Published Sep, 2022

This article will explain what bridges are in a graph and implement the code to find the bridges in the graph....Keep reading ...

Peterson Graph Problem

By Shivani Singh

● Published Oct, 2022

In this blog, we will discuss the Peterson graph problem, sample example, its algorithm, its implementations in other languages like C++ and Java, and the complexity analysis of the approach. ...Keep reading ...

Smallest Binary Digit Multiple of given Number

By Samikshya Sarangi

● Published Sep, 2022

In this blog, we will find the smallest binary digit multiple of a given number along with an example and will also look at its time and space complexity. ...Keep reading ...

Minimum Cut on a Graph Using a Maximum Flow Algorithm

By Nishant Rana

● Published Feb, 2022

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

Find Length of the Largest Region in the Boolean Matrix

By yuvatimankar

● Published Oct, 2022

This article will design the solution for finding the length of the largest region in the Boolean matrix....Keep reading ...

Find the minimum steps required to reach the end of the array under constraints

By Alok Pandey

● Published Sep, 2022

In this article, we will see the solution to a problem name Find the minimum steps required to reach the end of the array under constraints....Keep reading ...

Find the Height of a Generic Tree from Parent Array

By dhananjay kumar

● Published Sep, 2022

This article incorporates information about how to find the height of a generic tree from a parent array with implementation....Keep reading ...

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

By Anant Dhakad

● Published 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 minimum S-T cut in a flow network

By Jaglike Makkar

● Published Aug, 2022

In this article, we will study how to find a minimum S-T cut in a flow network using Ford-Fulkerson’s algorithm. We will also see its implementation and complexity....Keep reading ...

Find k-cores of an Undirected Graph

By Prakriti Gupta

● Published Oct, 2022

This article will provide information about graphs and then implement code to find the k-cores of an Undirected Graph....Keep reading ...

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

By Jaglike Makkar

● Published 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 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 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 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 Jan, 2022

The following blog discusses the popular DSatur Algorithm used for solving problems based on graph coloring along with its implementation and analysis....Keep reading ...

Minimum Operations to Convert Number

By Ishita Chawla

● Published Dec, 2021

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

Check if a Given Graph is Strongly Connected ( Kosaraju's BFS )🥷🏻

By ManishKumar1103

● Published Nov, 2022

In this article, we will solve a famous question on the topic graph: Check if a given graph is strongly connected ( Kosaraju's BFS ). It is a famous interview question and has been asked in many interviews....Keep reading ...

Check if the Graph can be Divided into Two Cliques

By Alankrit Srivastava

● Published Nov, 2022

We will discuss how to check if the graph can be divided into two cliques. We will check this condition by determining whether the given graph's complement is Bipartite or not....Keep reading ...

Find the degree of a particular vertex in a Graph

By Neha_cf2c

● Published Nov, 2022

In this article, we will discuss implementation code to find the degree of a particular vertex in a Graph in C++, Java and Python....Keep reading ...

Count the number of groups formed in a graph of friends

By Neha_cf2c

● Published Nov, 2022

We will discuss the solution of how to find the count of the number of groups formed in a graph of friends and its implementation in C++, Java and Python. ...Keep reading ...

Maximum number of edge-disjoint paths between two vertices

By Harsh

● Published Nov, 2022

This blog will discuss a graph theory problem in which we have to find the maximum number of edge-disjoint paths between two vertices....Keep reading ...

Erdos RenyI Model for generating random graphs

By Harsh

● Published Nov, 2022

This blog will discuss a model from graph theory that is used to generate random graphs. We will talk about the model in brief then we will see the implementation....Keep reading ...

Multistage Graph

By Alankrit Srivastava

● Published Nov, 2022

We will discuss the multi-stage graph problem in graph theory. We will use Dijkstra Algorithm and the dynamic programming approach to solve the problem. ...Keep reading ...

Minimize the Number of Weakly Connected Nodes

By Alankrit Srivastava

● Published Nov, 2022

We will discuss the problem to minimize the number of weakly connected nodes by using the weakly connected component algorithm approach....Keep reading ...

Minimum Edges Required to Make Euler Circuit

By ManishKumar1103

● Published Nov, 2022

In this, we will learn the concept of the eulerian circuit and the minimum number of edges required to add to make it....Keep reading ...

Biconnected Components in Graph

By ManishKumar1103

● Published Nov, 2022

This blog will teach you how to find biconnected components in graphs. You will go through an in-depth discussion about components, articulation points and DFS in graphs....Keep reading ...

The Seven Bridges of Königsberg

By Neha_cf2c

● Published Nov, 2022

In this blog, we will discuss the problem of The Seven Bridges of Königsberg and its implementation code in C++ and Java....Keep reading ...

Find the level of each node in a tree from the source node using BFS

By Ayush Mishra

● Published Nov, 2022

In this article, we will discuss the problem of finding the level of each node from the source node in a tree using BFS. We will look at examples, algorithms, and implementation of problems....Keep reading ...

Find the largest subset of Graph Vertices with Edges of 2 or more colors

By Ayush Mishra

● Published Nov, 2022

In this article, we will discuss the problem of finding the largest subset of Graph Vertices with Edges of 2 or more colors. We will look at examples, algorithms, and implementation of problems....Keep reading ...

Hopcroft–Karp Algorithm for Maximum Matching

By Ayush Mishra

● Published Nov, 2022

In this article, we will discuss the Hopcroft-Karp Algorithm for Maximum Matching. We will look at examples, algorithms, and implementation of problems....Keep reading ...

Construct Binary Palindrome by Repeated Appending and Trimming

By Rupal Saluja

● Published Nov, 2022

In this article, we will learn in brief about the properties of Depth First Search (DFS). Using those properties, we will construct a palindrome of a given size using binary numbers added as input....Keep reading ...

Count the Number of Triangles in an Undirected Graph

By Alankrit Srivastava

● Published Nov, 2022

This article will discuss a graph-related DSA Problem. Using two approaches, we will count the number of triangles in an undirected graph. ...Keep reading ...

Vertex Cover Problem

By Harsh

● Published Nov, 2022

This blog will discuss the NP-Complete problem known as the Vertex cover problem. We will be solving the problem using an approximation method to get the near-optimal solution....Keep reading ...

Find the Number of Nodes between two vertices in an Acyclic Graph using the Disjoint Union Method

By Jaskirat Singh Saggu

● Published Nov, 2022

This blog offers a detailed guide to help understand the problem: find the number of nodes between two vertices in an acrylic graph using the disjoint union method. It also briefly describes the approach, algorithm, and solution in various programmin...Keep reading ...

Find the Path in a Rectangle with Circles

By Jaskirat Singh Saggu

● Published Nov, 2022

This blog offers a detailed guide to help understand the problem: Find the path in a rectangle with circles. It also briefly describes the approach, algorithm, and solution in various programming languages. To know more about it, read on!...Keep reading ...

Maximum Number of Edges that can be added to a tree so that it stays a Bipartite graph

By Jaskirat Singh Saggu

● Published Nov, 2022

This blog offers a detailed guide to help understand the Maximum Number of Edges that can be added to a tree so that it remains a Bipartite graph problem. It also briefly describes the approach, algorithm, and solution in various programming language...Keep reading ...

Minimum number of moves needed to move from one cell of the matrix to another

By Rhythm Jain

● Published Nov, 2022

This article discusses how we can find the Minimum number of moves needed to move from one matrix cell to another....Keep reading ...

Count the number of magical Indices in an array

By kittusinghkumar

● Published Nov, 2022

This blog explains the detailed solution of the problem: Count the number of magical indices in an array along with its implementation in different programming languages....Keep reading ...

Delete edge to minimize subtree sum difference

By kittusinghkumar

● Published Nov, 2022

This blog explains the detailed solution of the problem: Delete edge to minimize subtree sum difference along with its implementation in different programming languages....Keep reading ...

Number of non-reachable nodes

By Jaskirat Singh Saggu

● Published Nov, 2022

This blog offers a detailed guide to help understand the Number of non-reachable nodes problem. It also briefly describes the approach, algorithm, and solution in various programming languages. To know more about it, read on! ...Keep reading ...

Number of Connected Components in an Undirected Graph

By Jaskirat Singh Saggu

● Published Nov, 2022

This blog offers a detailed guide to help understand the Number of Connected Components in an Undirected Graph problem. It also briefly describes the approach, algorithm, and solution in various programming languages. To know more about it, read on! ...Keep reading ...

Transpose Graph

By Jaskirat Singh Saggu

● Published Nov, 2022

This blog offers a detailed guide to help understand the Transpose Graph Problem. It also briefly describes what a transpose graph is, the approach, the algorithm, and how to find it. To know more about it, read on!...Keep reading ...

Count single node isolated sub-graphs in a disconnected graph

By Pradeep Kumar

● Published Nov, 2022

In this blog, you will learn about the problem of counting single node isolated sub-graphs in a disconnected graph....Keep reading ...

Dinic’s algorithm for Maximum Flow

By Shivangi mall

● Published Jan, 2023

In this article, the reader will learn about Dinic’s algorithm for Maximum Flow and describe an example using a diagram. And we will also implement this problem in different languages and discuss the time Complexities....Keep reading ...

Identify Same Contacts in a List of Contacts

By Teesha Goyal

● Published Jan, 2023

we will discuss the solution to the problem “Identify the same contacts in a list of contacts”. ...Keep reading ...

Number of loops of size k starting from a specific node

By Yashesvinee V

● Published Jan, 2023

This blog discusses how to find the number of loops of size k starting from a specific node in a completely connected undirected graph....Keep reading ...

Reverse Delete Algorithm

By Muskan Sharma

● Published Jan, 2023

You'll learn about Reverse Delete Algorithm in this article, and the implementation with proper output....Keep reading ...

Understanding the Snake and Ladder problem

By Aditya kumar

● Published Jan, 2023

This article demonstrates the understanding of the Snake and Ladder problem....Keep reading ...

Understanding the Concepts of Flood Fill Algorithm

By Juhi Sinha

● Published Jan, 2023

In this blog, we will learn about the concepts of the Flood Fill Algorithm in detail....Keep reading ...

Bi-connectivity in Un-directed Graphs

By Aditya kumar

● Published Jan, 2023

This article demonstrates Bi-connectivity in Un-directed Graphs....Keep reading ...

Floyd Warshall Algorithm At a Glance

By Nilesh Kumar

● Published Feb, 2023

In this blog, we will learn about the Floyd Warshall Algorithm at a glance along with code and benefits....Keep reading ...

Hierholzer’s Algorithm for directed Eulerian Graph

By Plagiarism2012

● Published Mar, 2023

This article will explain the coding problem in which we have to print the Euler circuit in a directed graph using Hierholzer’s Algorithm....Keep reading ...

Check if Graph is Bipartite

By Plagiarism2012

● Published Mar, 2023

This article will explain the coding problem in which we have to check if a graph is bipartite, using its property based on graph type....Keep reading ...

Chinese Postman or Route Inspection Problem

By Plagiarism2012

● Published Mar, 2023

This article will explain the Chinese Postman or Route Inspection Problem in which we have to find the shortest path that visits every edge of the graph at least once....Keep reading ...

Prim’s MST for Adjacency List Representation

By Manshi

● Published Mar, 2023

This article is about the implementation of Prim’s MST for Adjacency List Representation. ...Keep reading ...

Mixed Problems

Advanced graph concepts can seem tricky at first. But after getting a good understanding, they can get easier. Let us try to solve some mixed problems on advanced graph theory concepts to deepen our understanding.

Graph

Top Problems related to Graph

Interested in Coding Ninjas Flagship Courses?