Python:

Implemt the BFS algorithm to search(starting with a given node) if another given node(value) exist in the graph. For example, search if node F exist in the graph (you may start from node A). Also, find the distance(smallest number of intermedite nodes) and path of the target node from the starting node. For example, distance between node A to node G is 3 and the path is A>B>C>G. 1 G B 9 H 5 5 N E D F 11