广度优先 java_广度优先搜索 – Java

我有一个学校,在

java中实现广度优先搜索.我已经实现了几乎所有的东西,但问题是我的搜索不起作用,我无法找到问题:(所以我要求你给我建议,并给我一些关于最终问题可能出现的指导.

public ArrayList search(Problem p) {

// The frontier is a queue of expanded SearchNodes not processed yet

frontier = new NodeQueue();

/// The explored set is a set of nodes that have been processed

explored = new HashSet();

// The start state is given

GridPos startState = (GridPos) p.getInitialState();

// Initialize the frontier with the start state

frontier.addNodeToFront(new SearchNode(startState));

// Path will be empty until we find the goal.

path = new ArrayList();

// The start NODE

SearchNode node = new SearchNode(startState);

// Check if startState = GoalState??

if(p.isGoalState(startState)){

path.add(new SearchNode(startState));

return path;

}

do {

node = frontier.removeFirst();

explored.add(node);

ArrayList reachable = new ArrayList();

reachable = p.getReachableStatesFrom(node.getState());

SearchNode child;

for(int i = 0; i< reachable.size(); i++){

child = new SearchNode((GridPos)reachable.get(i));

if(!(explored.contains(child) || frontier.contains(child))){

if(p.isGoalState(child.getState())){

path = child.getPathFromRoot() ;

return path;

}

frontier.addNodeToFront(child);

}

}

}while(!frontier.isEmpty());

return path;

}

谢谢