Breadth-first search in a graph with python is very easy to implement using a queue and a travered list which will keep track of all the nodes visited.