Implementation of Breadth First Search for finding shortest path of a given acyclic bi-directional unweighted graph (Tree)
My Implementation of a given graph (numbered) to calculate a shortest path between two given nodes, using Breadth First Search. Ofcourse, for this type of graph, BFS is suitable