Skip to content

Commit 4ef0234

Browse files
guilyxactions-user
authored andcommitted
Apply formatting changes
1 parent 49e2088 commit 4ef0234

1 file changed

Lines changed: 8 additions & 8 deletions

File tree

tests/test_search.py

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -14,24 +14,24 @@
1414
def test_searchDFS():
1515
dfs = DepthFirstSearch(apla)
1616
res = dfs.search()
17-
assert res[1] != 0 # Path, computation time, opened nodes
17+
assert res[1] != 0 # Path, computation time, opened nodes
1818

1919

2020
def test_searchBFS():
2121
bfs = BreadthFirstSearch(apla)
22-
res = bfs.search() # Path, computation time, opened nodes
22+
res = bfs.search() # Path, computation time, opened nodes
2323
assert res[1] != 0
2424

2525

2626
def test_searchDijkstra():
2727
dijk = DijkstraBestFirstSearch(apla)
28-
res = dijk.search() # Goal, computation_time, opened_nodes(in this order)
29-
assert res[1] != 0 # Assert that it took some time to compute
30-
assert res[-1] > 0 # Assert that it visited some nodes
28+
res = dijk.search() # Goal, computation_time, opened_nodes(in this order)
29+
assert res[1] != 0 # Assert that it took some time to compute
30+
assert res[-1] > 0 # Assert that it visited some nodes
3131

3232

3333
def test_searchAStar():
3434
astar = AStarBestFirstSearch(apla, apla.available_heuristics["goal_count"])
35-
res = astar.search() # Goal, computation_time, opened_nodes(in this order)
36-
assert res[1] != 0 # Assert that it took time to compute
37-
assert res[-1] > 0 # Assert that it visited at least one node
35+
res = astar.search() # Goal, computation_time, opened_nodes(in this order)
36+
assert res[1] != 0 # Assert that it took time to compute
37+
assert res[-1] > 0 # Assert that it visited at least one node

0 commit comments

Comments
 (0)