This is a BFS implementation for Shortest Reach for a Graph in [Python](https://github.com/kgisl/algorithms/blob/master/algorithms/graph-theory/bfs-shortest-reach/bfs-shortest-reach.py). How will you refactor this code to implement a **Graph** class?
