def detect_maze(vertex, width, height):
"""Try to detect maze with given maze size, starting at given vertex."""
maze = Maze(width, height)
dualmaze = Maze(width, height)
last_vertex = vertex
stack = [vertex]
while len(stack) > 0:
vertex = stack.pop()
if is_done(vertex, maze, dualmaze): continue
if vertex != last_vertex: run(maze.bfs(last_vertex, vertex), maze)
last_vertex = detect_walls(vertex, maze, dualmaze)
# Fill stack; avoid unnecessary paths
stack.extend([v for v in maze.get_reachables(*vertex) if v != last_vertex and not is_done(v, maze, dualmaze)])
if vertex != last_vertex: stack.append(last_vertex)
return maze
