We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 560ae40 commit a16e74aCopy full SHA for a16e74a
graphs/greedy_best_first.py
@@ -89,7 +89,8 @@ def __eq__(self, other):
89
90
class GreedyBestFirst:
91
"""
92
- >>> gbf = GreedyBestFirst((0, 0), (len(grid) - 1, len(grid[0]) - 1))
+ >>> grid = [[0, 0, 1, 0, 0], [0, 1, 0, 0, 0], [0, 0, 1, 0, 1], [1, 0, 0, 1, 1], [0, 0, 0, 0, 0]]
93
+ >>> gbf = GreedyBestFirst(grid, (0, 0), (len(grid) - 1, len(grid[0]) - 1))
94
>>> [x.pos for x in gbf.get_successors(gbf.start)]
95
[(1, 0), (0, 1)]
96
>>> (gbf.start.pos_y + delta[3][0], gbf.start.pos_x + delta[3][1])
@@ -99,8 +100,8 @@ class GreedyBestFirst:
99
100
>>> gbf.retrace_path(gbf.start)
101
[(0, 0)]
102
>>> gbf.search() # doctest: +NORMALIZE_WHITESPACE
- [(0, 0), (1, 0), (2, 0), (3, 0), (3, 1), (4, 1), (5, 1), (6, 1),
103
- (6, 2), (6, 3), (5, 3), (5, 4), (5, 5), (6, 5), (6, 6)]
+ [(0, 0), (1, 0), (2, 0), (2, 1), (3, 1), (4, 1), (4, 2), (4, 3),
104
+ (4, 4)]
105
106
107
def __init__(self, grid: list[list[int]], start: tuple[int, int], goal: tuple[int, int]):
0 commit comments