@@ -246,7 +246,7 @@ def __gather_data_dijkstra(self, domain_path="", problem_path="", max_pddl_insta
246246 return [total_time ], [opened_nodes ], has_multiple_files_tested
247247 return [0 ], [0 ], has_multiple_files_tested
248248
249- def plot_dijkstra (self , problem = "" , domain = "" ):
249+ def plot_dijkstra (self , problem = "" , domain = "" , max_pddl_instances = - 1 ):
250250 title = "Dijkstra Statistics"
251251 if bool (not problem ) != bool (not domain ):
252252 logging .warning (
@@ -294,21 +294,22 @@ def __gather_data(
294294 domain_path = domain ,
295295 problem_path = problem ,
296296 heuristic_key = heuristic_key ,
297+ max_pddl_instances = max_pddl_instances
297298 )
298299 else :
299- times , nodes , _ = g (domain_path = domain , problem_path = problem )
300+ times , nodes , _ = g (domain_path = domain , problem_path = problem , max_pddl_instances = max_pddl_instances )
300301 ydata [name ] = times
301302 xdata [name ] = nodes
302303 return xdata , ydata
303304
304- def comparative_astar_heuristic_plot (self , domain = "" , problem = "" ):
305+ def comparative_astar_heuristic_plot (self , domain = "" , problem = "" , max_pddl_instances = - 1 ):
305306 _ , ax = plt .subplots ()
306307 plt .xlabel ("Number of opened nodes" )
307308 plt .ylabel ("Planning computation time (s)" )
308309
309310 for h in self .available_heuristics :
310311 times , nodes , _ = self .__gather_data_astar (
311- domain_path = domain , problem_path = problem , heuristic_key = h
312+ domain_path = domain , problem_path = problem , heuristic_key = h , max_pddl_instances = max_pddl_instances
312313 )
313314 data = dict ()
314315 for i , val in enumerate (nodes ):
0 commit comments