@@ -34,16 +34,19 @@ def __init__(
34
34
35
35
class BreadthFirstSearch :
36
36
"""
37
- >>> bfs = BreadthFirstSearch((0, 0), (len(grid) - 1, len(grid[0]) - 1))
38
- >>> (bfs.start.pos_y + delta[3][0], bfs.start.pos_x + delta[3][1])
37
+ # Comment out slow pytests...
38
+ # 9.15s call graphs/bidirectional_breadth_first_search.py:: \
39
+ # graphs.bidirectional_breadth_first_search.BreadthFirstSearch
40
+ # >>> bfs = BreadthFirstSearch((0, 0), (len(grid) - 1, len(grid[0]) - 1))
41
+ # >>> (bfs.start.pos_y + delta[3][0], bfs.start.pos_x + delta[3][1])
39
42
(0, 1)
40
- >>> [x.pos for x in bfs.get_successors(bfs.start)]
43
+ # >>> [x.pos for x in bfs.get_successors(bfs.start)]
41
44
[(1, 0), (0, 1)]
42
- >>> (bfs.start.pos_y + delta[2][0], bfs.start.pos_x + delta[2][1])
45
+ # >>> (bfs.start.pos_y + delta[2][0], bfs.start.pos_x + delta[2][1])
43
46
(1, 0)
44
- >>> bfs.retrace_path(bfs.start)
47
+ # >>> bfs.retrace_path(bfs.start)
45
48
[(0, 0)]
46
- >>> bfs.search() # doctest: +NORMALIZE_WHITESPACE
49
+ # >>> bfs.search() # doctest: +NORMALIZE_WHITESPACE
47
50
[(0, 0), (1, 0), (2, 0), (3, 0), (3, 1), (4, 1),
48
51
(5, 1), (5, 2), (5, 3), (5, 4), (5, 5), (6, 5), (6, 6)]
49
52
"""
0 commit comments