A BFS algorithm i wrote for solving a proof of mine puzzle in a demo block chain i built

BFS

def bfs():
        q = Queue()
        q.enqueue([current_room["room_id"]])
        visited = set()
        while q.size() > 0:
            path = q.dequeue()
            v = path[-1]
            if v not in visited:
                if v == 182: ### change to whatever room you want to find
                  return path

                visited.add(v)
                for key, value in grid[f'{v}'].items():
                    new_path = list(path)
                    new_path.append(value)
                    q.enqueue(new_path)

route_to_shop = bfs()

print(route_to_shop)