Graph: BFS algorithm uses a simple map of Node<-->ParentNode to print the shortest path between two given nodes