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.