Given a chess board, find the shortest distance (minimum number of steps) taken by a Knight to reach given destination from given source.
Given a digraph (Directed Graph), find the total number of routes to reach the destination from given source that have exactly m edges.
Given an connected undirected graph, find if it contains any cycle or not.
Breadth first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a ‘search key’) and explores the neighbor nodes first, before moving to the next level neighbors.