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 before paying a visit to their children's children. A queue is the data structure used to achieve BFS. It's typically used in problems where you have to find an optimum value, such as the shortest path in an unweighted graph.
Breadth-First Search
By Raksha jain
● Published At 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 ..
Minimum length paths between 1 to N including each node
By Aditya Narayan Joardar
● Published At 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 At 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 Aman Chourasiya
● Published At 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 ..
Implement Water Supply System
By Vaibhav Agarwal
● Published At Dec 2021
In this article, we will discuss the problem of implementing a water supply system.... Keep reading ..
0-1 BFS
By Sandeep kamila
● Published At Nov 2021
This blog will cover the 0-1 BFS algorithm, its approach using an example and code in C++. ... Keep reading ..
01 Matrix
By Saksham Gupta
● Published At Jan 2022
In this blog, we will discuss one of the famous and important questions from the interview perspective, i.e., 01 Matrix. ... Keep reading ..