From a339b8fb6f108ea1d992de585054909d0db51e0f Mon Sep 17 00:00:00 2001 From: raskatovia Date: Fri, 22 May 2026 21:34:27 +0300 Subject: [PATCH] =?UTF-8?q?[2]=20=D0=B4=D0=BE=D0=B1=D0=B0=D0=B2=D0=B8?= =?UTF-8?q?=D0=BB=20=D0=BF=D0=BE=D0=B8=D1=81=D0=BA=20=D0=B2=20=D0=B3=D0=BB?= =?UTF-8?q?=D1=83=D0=B1=D0=B8=D0=BD=D1=83?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- raskatovia/docs/data/task2/solver.py | 29 +++++++++++++++++++++++++++- 1 file changed, 28 insertions(+), 1 deletion(-) diff --git a/raskatovia/docs/data/task2/solver.py b/raskatovia/docs/data/task2/solver.py index ae1b9f4..bad83a7 100644 --- a/raskatovia/docs/data/task2/solver.py +++ b/raskatovia/docs/data/task2/solver.py @@ -40,6 +40,33 @@ class BfsStrategy: "visited": visited_count, "length": len(path) } +class DfsStrategy: + def solve(self, maze): + start = maze.start + finish = maze.finish + stack = [start] + previous = {start: None} + visited_count = 0 + + while stack: + current = stack.pop() + visited_count += 1 + + if current == finish: + break + + for next_cell in maze.neighbors(current[0], current[1]): + if next_cell not in previous: + previous[next_cell] = current + stack.append(next_cell) + + path = build_path(previous, start, finish) + return { + "name": "DFS", + "path": path, + "visited": visited_count, + "length": len(path) + } class MazeSolver: def __init__(self, strategy): @@ -50,7 +77,7 @@ class MazeSolver: if __name__ == "__main__": maze = MazeBuilder().from_file("raskatovia/docs/data/task2/maps/simple.txt").build() - solver = MazeSolver(BfsStrategy()) + solver = MazeSolver(DfsStrategy()) result = solver.solve(maze) print("algorithm:", result["name"]) print("visited:", result["visited"])