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 travels as far as feasible down each branch before returning to the root node. So the fundamental concept is to begin at the root or any random node and mark the node before moving to the next unmarked node and repeating this loop until there are no unmarked nearby nodes. Then go back and look for more unmarked nodes to traverse.
DFS Traversal of a Graph - Iteratively
By Gaurish Anand
● Published At Feb 2022
In this article, we will see the DFS traversal of a graph iteratively. ... Keep reading ..
Implementation Of DFS Using Adjacency Matrix
By Harsh Goyal
● Published At Jan 2022
This article will discuss the implementation of DFS using an adjacency matrix and how to approach this problem.... Keep reading ..
Check if there are at least T continuous blocks of 0s or not in a Binary Matrix
By GAZAL ARORA
● Published At Jan 2022
In this article, we will check if there are at least T continuous blocks of 0s or not in a given Binary Matrix Mat of size N*M in O(N*M) time where T is the GCD of N and M. ... Keep reading ..
Find Regions with Most Common Region Size in a Given Boolean Matrix
By Abhishek Ranjan
● Published At Dec 2021
In this article, we will try to solve a graph theory problem that can be asked in the interviews.... Keep reading ..
Clone of an undirected graph
By Vaibhav Agarwal
● Published At Dec 2021
In this article, we will discuss the approach to making a clone of an undirected graph... Keep reading ..
Parallel Courses III
By Pranav Gautam
● Published At Dec 2021
Learn to find the minimum number of months required to complete all the parallel courses given as a graph.... Keep reading ..