Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Last updated: Aug 2, 2022

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 EASY
Graphs in data structures and algorithms are an essential part of problem-solving. This article gives an introduction to the graph data structure.
Graph Theory
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.
Graph Representation
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.
Properties of Graph
This article deals with the properties of graphs which are used to characterise different types of graphs like eccentricity of a vertex etc.
A Guide to Master Graph Algorithms for Competitive Programming
This article will provide you with a guide to master graph algorithms for competitive programming.
Implementation of Graph in Java
This article discusses about implementation of graph in Java using Adjacency Matrix and using Adjacency List with algorithms and implementations.
Implementation of Graph in Python MEDIUM
Questions related to Graphs are frequently asked in technical interviews. This blog discusses the implementation of Graphs in Python using different ways in detail.
Representing a Graph using Set and Hash MEDIUM
In this article, we will implement graph representation using set and hash.
Construct a Graph from the size of components of each node
This article explains the problem of constructing a graph from the size of components of each node.
Difference Between Graph And Tree EASY
Both Trees and Graphs are types of non−linear data structures but they differ in structure and properties. Let's understand the difference between Graph and Trees in this comprehensive guide.
Mother vertex in a Graph MEDIUM
In this article, we will find the mother vertex in a graph.
Pendant Vertices, Non-Pendant vertices, Pendant Edges, and Non-Pendant Edges of the Graph.
In this article, we will discuss what are Pendant Vertices, Non-Pendant vertices, Pendant Edges, and Non-Pendant Edges of the Graph. Let say G, for any vertice to be a pendant vertex, the degree of the vertex should be 1.
Print All Mother Vertices In The Graph EASY
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.
Dynamic Connectivity Problem MEDIUM
This blog guides you regarding the Dynamic Connectivity Problem, Basic operations that are required to solve this problem and their implementation in Java.
Graph Traversal Techniques in DFS BFS MEDIUM
In this blog, we will discuss Graph Traversal Techniques in DFS & BFS.
Breadth-First Search
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.
Best First Search or Informed Search MEDIUM
In this article, we will discuss Best First Search or Informed Search with proper examples and Implementation.
BFS in Disconnected Graph MEDIUM
This article discusses the concept of performing Breadth-First-Search(BFS) in a disconnected graph.
BFS Using Vectors & Queue as per the Algorithm of CLRS MEDIUM
This article discusses the concept of performing Breadth-First-Search(BFS) using vectors & queues as per the algorithm mentioned in the CLRS book.
Breadth-First Traversal Applications MEDIUM
In this blog, we will learn about the Breath-First Search application and its implementation.
Minimum length paths between 1 to N including each node
This article discusses how to calculate the minimum length paths between node 1 to N including each.
Check if the given permutation is a valid BFS of a given tree MEDIUM
This blog will discuss the famous problem, check if the given permutation is a valid BFS of a given tree.
DFS Traversal of a Graph - Iteratively
In this article, we will see the DFS traversal of a graph iteratively.
Depth First Search (DFS) Algorithm MEDIUM
This article will discuss the DFS algorithm in detail, including its applications, pseudo-code, example, and efficient implementation steps.
DFS for an n-ary Tree(Acyclic Graph) Represented as an Adjacency List EASY
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.
Implementation of DFS using Adjacency Matrix
This article will discuss the implementation of DFS using an adjacency matrix and how to approach this problem.
DFS using Adjacency Matrix MEDIUM
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.
Check if there are at least T continuous blocks of 0s or not in a Binary Matrix MEDIUM
In this blog, we will learn to check if there are at least T continuous blocks of 0s or not in a Binary Matrix.
Find Regions with Most Common Region Size in a Given Boolean Matrix
In this article, we will try to solve a graph theory problem that can be asked in the interviews.
Number of nodes at a given level in a tree using Breadth-First Search MEDIUM
This blog helps you clearly understand the concept of the Number of nodes at a given level in a tree using BFS.
Euler and Hamiltonian Paths
This article will introduce Euler and Hamiltonian paths and discuss approaches to use them in different data structure problems.
Clone of an undirected graph MEDIUM
This article contains information on how to clone an undirected graph using DFS approach.
Clone a Directed Acyclic Graph EASY
This article will discuss the problem to clone a directed acyclic graph.
Word Ladder
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.
Accounts Merge
In this blog, we will discuss the problem of Accounts Merge using Depth First Search and discuss its time and space complexity.
All-Pairs Shortest Paths MEDIUM
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.
Dijkstra's Algorithm EASY
In this article, we will discuss Dijkstra’s Algorithm with various examples and explanations.
Bellman Ford Algorithm MEDIUM
In this article we discuss one of the popular Graph Algorithms - Bellman-Ford along with it's Java implementation and its complexity.
Floyd Warshall Algorithm MEDIUM
Floyd Warshall Algorithm is an important Graph algorithm, and this article provides a crisp explanation of it along with code in Java.
Ford-Fulkerson Algorithm for Maximum Flow MEDIUM
In this article, We will discuss Ford-Fulkerson Algorithm for Maximum Flow.
Dijkstra’s Algorithm vs Floyd–Warshall’s Algorithm MEDIUM
In this blog, we have discussed Dijkstra’s Algorithm vs Floyd–Warshall’s Algorithm, and the key differences between them.
Author Shiva
0 upvotes
Assign Directions to Edges so that the Directed Graph remains Acyclic MEDIUM
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.
Introduction to Push Relabel Algorithm
This article will discuss the Push Relabel algorithm.
Implementation of Push Relabel Algorithm
We will discuss the Implementation of the Push Relabel Algorithm and an example.
Transitive closure of a Graph MEDIUM
In this article, We'll briefly introduce the transitive closure of graph.
Transitive Closure Of a Graph Using Recursion MEDIUM
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.
Topological Sorting in a Graph MEDIUM
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.
Single Source Shortest Path EASY
In this article, we will learn the fundamentals of SSSP, look into different scenarios, and present practical code examples.
Topological Sort of a Graph Using Departure Time of Vertex EASY
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.
All Topological Sorts of a Directed Acyclic Graph HARD
We will discuss all the topological sorts of a directed acyclic graph.
Find Maximum Shortest Distance in Each Component of a Graph
This blog will cover the question to find the maximum shortest distance in each component of a Graph.
Why does Dijkstra’s algorithm fail on negative weights?
In this article, we will find out why Dijkstra's algorithm fails on negative edge weights.
Johnson’s Algorithm for All-Pairs Shortest Paths
In this article, we will discuss Jhonson's Algorithm for the all-pairs shortest path and try to understand its time complexity.
Difference between the shortest and second shortest path in an Unweighted Bidirectional Graph
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.
Number of Islands
This article covers the approach and Implementation of the problem Number of Islands in java.
Author Alisha
3 upvotes
Find the number of islands
This article discusses finding the number of islands in a given 2D matrix using DFS.
Find Number of Islands MEDIUM
In this article, we will discuss the problem of finding the number of islands.
Count Cycles of Length n in an Undirected and Connected Graph MEDIUM
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.
Check if there is a Cycle with Odd Weight Sum in an Undirected Graph. MEDIUM
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.
Max Flow Problem HARD
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.
Weakly Connected Components in a Directed Graph MEDIUM
Weakly connected components in a directed graph are subsets of the graph where each node is reachable from every other node by ignoring the direction of the edges.
Implementations and Applications of Karger’s Algorithm for Minimum Cut HARD
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.
Karp’s Minimum Mean (or Average) Weight Cycle Algorithm HARD
This article will discuss the algorithm and implementation of Karp’s Minimum Mean (or Average) Weight Cycle Algorithm.
Detect cycle in a directed graph using colors MEDIUM
This article will discuss how to detect cycles in a directed graph using colors with some examples in detail.
Check if a Graph has a Cycle of Odd Length MEDIUM
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
Maximum Bipartite Matching in Graph MEDIUM
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.
Bidirectional Search in Graph HARD
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.
Introduction and Properties of Minimum Spanning Tree
This article introduces a minimum spanning tree and discusses some of its essential properties.
Properties of Minimum Spanning Tree (MST)
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.
Kruskal's Algorithm MEDIUM
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.
Kruskal’s Minimum Spanning Tree MEDIUM
In this article, we will discuss Kruskal’s Minimum Spanning Tree Algorithm. We will also implement Kruskal's algorithm in various languages.
Prim’s Algorithm in Java MEDIUM
This article is all about the Prims Algorithm- Minimum Spanning Tree including the implementation in C++ and Java.
Prim’s Minimum Spanning Tree MEDIUM
In this article, we will be discussing Prim’s Minimum Spanning Tree Algorithm. We will also implement Prim’s algorithm in various languages.
Minimum Product Spanning Tree MEDIUM
In this article, we will be solving the problem of the minimum product spanning tree.
Total Number of Spanning Trees in a Graph MEDIUM
This article will discuss the spanning tree. We will learn how to find the total number of spanning trees in a graph.
Minimum Cost to Connect all Cities MEDIUM
This article discusses one of the famous graph problems - Minimum Cost to Connect all cities along with an approach and implementation to solve it.
Commutable Island MEDIUM
In this blog, we will solve the problem of Commutable Islands and discuss the time and space complexity of some approaches.
Steiner Tree Problem
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!
Applications of Graph Data Structure
Applications of Graph Data Structure.. Computer Science, Social Networks, Transportation, Computer Vision, and Natural Language Processing.
Important graph problems for Interviews (Basic Problems) EASY
This article discusses some of the most important graph problems, emphasising easier problems.
Important graph problems for Interviews (Advanced Problems) EASY
This article discusses some of the most important graph problems, emphasising advanced problems.
Check whether given degrees of vertices represent a Graph or Tree MEDIUM
In this article, we will check whether given degrees of vertices represent a Graph or Tree.
Check if there is a Path between Two Vertices in a Directed Graph EASY
This blog will discuss Common interview questions; check if there is a path between two vertices in a directed graph.
Parallel Courses III
Learn to find the minimum number of months required to complete all the parallel courses given as a graph.
Waterflow Problem EASY
This blog offers a detailed guide on the Waterflow Problem and explains its approach in detail. To know more about it, read on!
Water Connection Problem
This article will discuss the water connection problem.
Construct a graph from the given degrees of all vertices EASY
This article will discuss constructing a graph from the given degrees of all vertices.
Find All Possible Words in a Board of Characters EASY
In this blog, we will find all possible words in a board of characters along with its code, algorithm and example.
Find Minimum Weight Cycle in an Undirected Graph EASY
In this blog, we will learn how to find the minimum weight cycle in an undirected graph.
Find the Shortest Path in a Weighted Graph where the Weight of an Edge is 1 or 2 MEDIUM
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
Find the Sum of Dependencies in a Graph MEDIUM
In this article, we will design an algorithm for finding the sum of a dependency graph.
Author Rashi
0 upvotes
Minimum Cost Path in a Directed Graph via a Given Set of Necessary Nodes MEDIUM
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.
Eulerian Path and Circuit MEDIUM
This blog will discuss Common interview questions, Eulerian path, and circuit.
Printing Eulerian Path using Fleury's Algorithm EASY
In this article, we will see the Eulerian path and Fleury's algorithm and how one is used for the other.
Print all Paths from a Given Source to a Destination MEDIUM
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.
Print the Longest Path Between Any Pair of Vertices MEDIUM
This blog covers a graph problem in which we have to find the longest path between any pair of vertices.
Paths in Dijkstra’s Shortest Path Algorithm MEDIUM
This blog will look into Paths in Dijkstra's Shortest Path Algorithm, including program and time and space complexity.
k’th Heaviest Adjacent Node in a Graph where Each Vertex has Weight MEDIUM
This article will discuss how to find k’th heaviest Adjacent node in a Graph where each vertex has a weight, with an example.
How to check if an array of strings can form a circle or not?
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.
Number of distinct Shortest Paths from Node 1 to N in a Weighted and Directed Graph
n this article, we will try to solve a graph theory problem that can be asked in the interviews.
Find all Reachable Nodes from Every Node Present in a Given Set MEDIUM
This article will design an algorithm to find all reachable nodes from every node present in a given set.
Calculate the number of sink nodes in a graph MEDIUM
In this article, we will be discussing the approaches to calculate the number of sink nodes in a graph.
Maximize the shortest path between given vertices by adding a single edge
This article will discuss the solution of the problem “Maximize the shortest path between given vertices by adding a single edge”
Minimum Cost using Dijkstra by reducing the cost of an Edge
This blog will discuss the problem of minimum cost using Dijkstra by reducing the cost of an edge.
Minimum Number of Swaps Required to Sort an Array MEDIUM
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.
Minimum Edges to Reverse to Make the Path from a Source to a Destination MEDIUM
In this article, We will discuss a question of Minimum edges to reverse to make path from a source to a destination.
Minimum cost path with left, right, bottom, and up moves allowed MEDIUM
In this article, we will find the minimum cost path from one grid position to another position using left, right, bottom, and up moves.
Shortest distance from a guard in a bank MEDIUM
In this article, we will see the question Find Shortest Distance from a Guard in a Bank
Check whether the given graph is a tree or not EASY
In this blog, we will discuss the approach to check whether the given graph is a tree or not.
Check if a Cycle Exists Between Nodes S and T in an Undirected Graph with only S and T Repeating EASY
In this blog, we will discuss the DFS traversal of an undirected graph. We will also see the application of DFS in cycle detection.
Check If Removing a Given Edge Disconnects a Graph MEDIUM
This article will discuss a scenario related to the bridge. To check if removing a given edge disconnects a graph.
Move weighting scale alternate under given constraints
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.
Count the minimum number of edges between two vertices of a Graph
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.
Count the nodes within K-distance from all nodes in a set
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.
Count of Simple Cycles in a Connected Undirected Graph Having N Vertices MEDIUM
This blog will discuss the problem named count of simple cycles in a connected undirected graph having N vertices with an example and implementation.
Count Number of Edges in an Undirected Graph MEDIUM
In this article, we will count the number of edges in an undirected graph.
Count the Number of Trees in a Forest MEDIUM
This article will provide you with the implementation of the problem, Counting the number of Trees in a Forest.
Check if an Array of Strings can be Chained to Form a Circle MEDIUM
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.
Check if a Graph is Strongly Connected
This blog helps you clear your understanding of Kosaraju's algorithm and dry run with various examples to have a clear idea.
Biconnected Graph HARD
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.
Bridges in a Graph HARD
This article will explain what bridges are in a graph and implement the code to find the bridges in the graph.
Peterson Graph Problem
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.
Smallest Binary Digit Multiple of given Number HARD
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.
Minimum Cut on a Graph Using a Maximum Flow Algorithm
This blog will cover how to calculate the Minimum Cut on a Graph Using a Maximum Flow Algorithm.
Find Length of the Largest Region in the Boolean Matrix MEDIUM
This article will design the solution for finding the length of the largest region in the Boolean matrix.
Find the minimum steps required to reach the end of the array under constraints MEDIUM
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.
Find the Height of a Generic Tree from Parent Array MEDIUM
This article incorporates information about how to find the height of a generic tree from a parent array with implementation.
Find Node Having Maximum Number of Common Nodes with a Given Node K
In this blog, we will discuss the BFS traversal of an undirected graph. We will also see the concept of levels used in BFS.
Find minimum S-T cut in a flow network
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.
Find k-cores of an Undirected Graph HARD
This article will provide information about graphs and then implement code to find the k-cores of an Undirected Graph.
Maximum element in the connected component of the given node for Q queries
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.
Find the number of connected grids of a given size in a 2D-Matrix
This article will find the number of connected grids of a given size in a 2D matrix for multiple queries.
Minimum nodes to be colored in a graph such that every node has a colored neighbor
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.’
Graph Coloring
This blog will cover the theory and applications of the Graph Coloring problems.
DSatur Algorithm for Graph Coloring
The following blog discusses the popular DSatur Algorithm used for solving problems based on graph coloring along with its implementation and analysis.
Minimum Operations to Convert Number
This blog will discuss the problem of Minimum Operations to Convert Number using BFS.
Check if a Given Graph is Strongly Connected ( Kosaraju's BFS )🥷🏻 HARD
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.
Check if the Graph can be Divided into Two Cliques HARD
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.
Maximum number of edge-disjoint paths between two vertices HARD
This blog will discuss a graph theory problem in which we have to find the maximum number of edge-disjoint paths between two vertices.
Author Harsh
0 upvotes
Erdos RenyI Model for generating random graphs HARD
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.
Author Harsh
0 upvotes
Multistage Graph MEDIUM
A multistage graph falls under the class of a directed and weighted graph. Here the vertices are divided into stages (single vertex and ending vertex).
Minimize the Number of Weakly Connected Nodes MEDIUM
We will discuss the problem to minimize the number of weakly connected nodes by using the weakly connected component algorithm approach.
Minimum Edges Required to Make Euler Circuit HARD
In this, we will learn the concept of the eulerian circuit and the minimum number of edges required to add to make it.
Biconnected Components in Graph HARD
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.
The Seven Bridges of Königsberg HARD
In this blog, we will discuss the problem of The Seven Bridges of Königsberg and its implementation code in C++ and Java.
Find the level of each node in a tree from the source node using BFS MEDIUM
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.
Find the largest subset of Graph Vertices with Edges of 2 or more colors HARD
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.
Hopcroft–Karp Algorithm for Maximum Matching MEDIUM
In this article, we will discuss the Hopcroft-Karp Algorithm for Maximum Matching. We will look at examples, algorithms, and implementation of problems.
Construct Binary Palindrome by Repeated Appending and Trimming MEDIUM
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.
Count the Number of Triangles in an Undirected Graph HARD
This article will discuss a graph-related DSA Problem. Using two approaches, we will count the number of triangles in an undirected graph.
Vertex Cover Problem MEDIUM
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.
Author Harsh
0 upvotes
Find the Number of Nodes between two vertices in an Acyclic Graph using the Disjoint Union Method
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 programming languages. To know more about it, read on!
Find the Path in a Rectangle with Circles
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!
Maximum Number of Edges that can be added to a tree so that it stays a Bipartite graph
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 languages. To know more about it, read on!
Minimum number of moves needed to move from one cell of the matrix to another
This article discusses how we can find the Minimum number of moves needed to move from one matrix cell to another.
Count the number of magical Indices in an array MEDIUM
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.
Number of non-reachable nodes MEDIUM
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!
Number of Connected Components in an Undirected Graph MEDIUM
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!
Transpose Graph EASY
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!
Count single node isolated sub-graphs in a disconnected graph MEDIUM
In this blog, you will learn about the problem of counting single node isolated sub-graphs in a disconnected graph.
Dinic’s algorithm for Maximum Flow HARD
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.
Identify Same Contacts in a List of Contacts HARD
we will discuss the solution to the problem “Identify the same contacts in a list of contacts”.
Number of loops of size k starting from a specific node EASY
This blog discusses how to find the number of loops of size k starting from a specific node in a completely connected undirected graph.
Reverse Delete Algorithm MEDIUM
You'll learn about Reverse Delete Algorithm in this article, and the implementation with proper output.
Understanding the Snake and Ladder problem MEDIUM
This article demonstrates the understanding of the Snake and Ladder problem.
Flood Fill Algorithm MEDIUM
In this blog, we will learn about the concepts of the Flood Fill Algorithm in detail.
Bi-connectivity in Un-directed Graphs MEDIUM
This article demonstrates Bi-connectivity in Un-directed Graphs.
Floyd Warshall Algorithm At a Glance MEDIUM
In this blog, we will learn about the Floyd Warshall Algorithm at a glance along with code and benefits.
Hierholzer’s Algorithm for directed Eulerian Graph MEDIUM
This article will explain the coding problem in which we have to print the Euler circuit in a directed graph using Hierholzer’s Algorithm.
Check if Graph is Bipartite MEDIUM
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.
Chinese Postman or Route Inspection Problem MEDIUM
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.
Prim’s MST for Adjacency List Representation MEDIUM
This article is about the implementation of Prim’s MST for Adjacency List Representation.
Author Manshi
0 upvotes