Breadth First Search (BFS) tutorial. Part 1

We'll learn about Breadth First Search (BFS) algorithm in this part of the tutorial. We'll learn how to implement the code of bfs. We'll learn to print the shortest path between two nodes.

Breadth First Search (BFS) tutorial. Part 2

Now we will solve problems using te applications of bfs.
In this tutorial we will solve 1. 10004 Bi-coloring(Uva). 2. 336 - A Node Too Far(Uva). 3. 762 We Ship Cheap(Uva). 4. 439 - Knight Moves(Uva). 2D-Grid BFS. And some practice problems are given.

Breadth First Search (BFS) tutorial. Part 3

Now we will solve problems using the applications of bfs. In this tutorial we will solve: 1. 6151 - Beehives (Live Archive) Shortest cycle in a graph. 2. Cycle In Maze - Codeforces. 3. Police Stations - Codeforces (Multiple Source bfs). 4. COVID-19 Outbreak (Passing flow through edges). 5. 10968 - KuPellaKeS (Uva). And some practice problems are given.

Breadth First Search (BFS) tutorial. Part 4

We'll learn 0-1 bfs here. Then we'll learn to find all the nodes on any shortest path between a given pair of nodes. Then solve 2034.Caravans - Timus. Then we'll solve - Connected Components? - Codeforces. And some practice problems are given.