Merge pull request #78 from APLA-Toolbox/fix-tests

Fix pddl path in test

Author: guilyx

.gitignore

@@ -134,3 +134,4 @@ logs/*
 !logs/.gitkeep
 data.json
 pddl-examples/*
+data/*

tests/test_search.py

@@ -8,29 +8,31 @@
 import coloredlogs
 import sys
 
-apla = AutomatedPlanner("data/domain.pddl", "data/problem.pddl")
-
 
 def test_searchDFS():
+    apla = AutomatedPlanner("pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl")
     dfs = DepthFirstSearch(apla)
     res = dfs.search()
     assert res[1] != 0  # Path, computation time, opened nodes
 
 
 def test_searchBFS():
+    apla = AutomatedPlanner("pddl-examples/flip/domain.pddl", "pddl-examples/flip/problem.pddl")
     bfs = BreadthFirstSearch(apla)
     res = bfs.search()  # Path, computation time, opened nodes
     assert res[1] != 0
 
 
 def test_searchDijkstra():
+    apla = AutomatedPlanner("pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl")
     dijk = DijkstraBestFirstSearch(apla)
     res = dijk.search()  # Goal, computation_time, opened_nodes(in this order)
     assert res[1] != 0  # Assert that it took some time to compute
     assert res[-1] > 0  # Assert that it visited some nodes
 
 
 def test_searchAStar():
+    apla = AutomatedPlanner("pddl-examples/dinner/domain.pddl", "pddl-examples/dinner/problem.pddl")
     astar = AStarBestFirstSearch(apla, apla.available_heuristics["goal_count"])
     res = astar.search()  # Goal, computation_time, opened_nodes(in this order)
     assert res[1] != 0  # Assert that it took time to compute