Shortest path problem in unweighted graph

5 minute read

Breadth-first search (BFS) algorithm is one of two elementary graph algorithms that extensively used for graph traversal and searching problems.