Java Breadth First Search problem

[Lord Raiden]

Hello lads i have a problem about the Breadth First Search . I need to do an implementation of a checking algorith that check from a Game Graph that i have create if every non-object node appears between 2 connection nodes
The code that i have done untill now is :
Can anyone helps

 
public class StructurallyValidGraph extends GameGraph implements StructuralValidatorRules
{ 
private ArrayList<Node>ToDo;
private ArrayList<Node>visited;
 
 
 
public StructurallyValidGraph(String name,StartNode start,GoalNode goal) {
super(name,start,goal);
 
 
ToDo= new ArrayList<Node>();
}
 
/**
* Check that every non-object node (except perhaps the in node of the
* start location and the out nodes of goal locations) appears between
* two connection links.
*/
 
 
public boolean nonObjectNodeValidation() throws NotImplemented {
throw new NotImplemented();
 
return check();
 
}
 
 
 
 
public boolean visit (Node ANode)
{
if(currentNode.ANode) // check if Already visited
{
return true;
}
visited.add(ANode);
AllLinks =ANode.link();
for ( i=0; i<AllLinks.size;i++)
{
Link OneLink =AllLinks.get(i);
Node targetnode =OneLink.target();
if (targetnode.getType()!="ObjectNode"&& OneLink.getType()!="ConnectionLink")
{
return false;
}
for ( i = 0; i<AllLinks.size(); i++)
{
ToDo.add((Node) AllLinks.get(i).target());
}
}
}
 
 
public boolean check()
{
 
visited = new ArrayList<Node>();
ToDo.add(start);
while (ToDo.size()>0)
 
{ 
 
ANode=ToDo.get(0);
ToDo.remove(0);
boolean pass = visit (ANode);
if(pass==false)
{
return false;
}
} 
return true;
}
 

[r035198x]

Hello lads i have a problem about the Breadth First Search . I need to do an implementation of a checking algorith that check from a Game Graph that i have create if every non-object node appears between 2 connection nodes
The code that i have done untill now is :
Can anyone helps

 
public class StructurallyValidGraph extends GameGraph implements StructuralValidatorRules
{ 
private ArrayList<Node>ToDo;
private ArrayList<Node>visited;
 
 
 
public StructurallyValidGraph(String name,StartNode start,GoalNode goal) {
super(name,start,goal);
 
 
ToDo= new ArrayList<Node>();
}
 
/**
* Check that every non-object node (except perhaps the in node of the
* start location and the out nodes of goal locations) appears between
* two connection links.
*/
 
 
public boolean nonObjectNodeValidation() throws NotImplemented {
throw new NotImplemented();
 
return check();
 
}
 
 
 
 
public boolean visit (Node ANode)
{
if(currentNode.ANode) // check if Already visited
{
return true;
}
visited.add(ANode);
AllLinks =ANode.link();
for ( i=0; i<AllLinks.size;i++)
{
Link OneLink =AllLinks.get(i);
Node targetnode =OneLink.target();
if (targetnode.getType()!="ObjectNode"&& OneLink.getType()!="ConnectionLink")
{
return false;
}
for ( i = 0; i<AllLinks.size(); i++)
{
ToDo.add((Node) AllLinks.get(i).target());
}
}
}
 
 
public boolean check()
{
 
visited = new ArrayList<Node>();
ToDo.add(start);
while (ToDo.size()>0)
 
{ 
 
ANode=ToDo.get(0);
ToDo.remove(0);
boolean pass = visit (ANode);
if(pass==false)
{
return false;
}
} 
return true;
}
 

Where specifically do you need help and what steps have you taken so far?