BFS

def bfs(self): 
    visit = [self.start]
    for item in self.graph[self.start]:
        self.q.push(item)
    while self.q.isEmpty() == False:
        item = self.q.pop()
        if not item in visit:
            for _item in self.graph[item]:
                self.q.push(_item)
            visit.append(item)
    return visit