public UninformedSearch(IProblem <T> problem, IFrontier <Node <T> > frontier)
{
Problem = problem;
Frontier = frontier;
OpenList = new HashSet <T>();
ClosedList = new HashSet <T>();
}
public BFS()
{
frontier = new BFSFrontier();
}
public ADstar()
{
frontier = new PriorityQueue();
}
public DFS()
{
frontier = new DFSFrontier();
}
public GraphSearch(IFrontier frontier)
{
this.frontier = frontier;
}
public ADstar(bool onlyPassOnDepth)
{
onlyStopOnDepth = onlyPassOnDepth;
frontier = new PriorityQueue();
}
public ADstar()
{
onlyStopOnDepth = false;
frontier = new PriorityQueue();
}
public BFS(bool onlystopOnDepth)
{
onlyStopOnDepth = onlystopOnDepth;
frontier = new BFSFrontier();
}
public BFS()
{
onlyStopOnDepth = false;
frontier = new BFSFrontier();
}
