AlgResults.py

from SearchAlgorithms.BreadthFirstSearch import *
from SearchAlgorithms.DepthFirstSearch import *
from SearchAlgorithms.UniformCostSearch import *
from SearchAlgorithms.DepthLimitedSearch import *
from SearchAlgorithms.IterativeDeepeningSearch import *
from SearchAlgorithms.GreedyBestFirstSearch import *
from SearchAlgorithms.AStarSearch import *

def expansion_order(problem, heuristic = None, steps = 60, depth_limit = 6):
    res = {}
    res["BFS"] = breadth_first_graph_search(problem)[1][:steps]

    [success, order] = depth_first_tree_search(problem, steps)
    res[("DFS" if success else "DFS (caught in loop)")] = order[:steps]
    
    res["Uniform Cost Search/Dijkstra"] = uniform_cost_search(problem)[1][:steps]
    res["Depth Limited"] = depth_limited_search(problem, depth_limit)[1][:steps]
    res["Iterative Deepening"] = iterative_deepening_search(problem)[1][:steps]
    if(heuristic):
        res["Greedy Best First Search"] = greedy_best_first_graph_search(problem, heuristic)[1][:steps]
        res["A*"] = greedy_best_first_graph_search(problem, heuristic)[1][:steps]
    return res