两点之间是否存在一条路径

public class BFS {
public enum State
{
Unvisited,Visited,Visiting;
}


public static boolean search(Graph g,Node start,Node end)
{
LinkedList<Node> q=new LinkedList<Node>();
for(Node u:g.getNodes())
{
u.state=State.Unvisited;

}

q.add(start);
start.state=State.Visiting;

while(!q.isEmpty())
{
Node u=q.removeFirst();
if(u!=null)
{
for(Node v:u.getAdjacent())
{
if(v.state=State.Unvisited)
{
if(v==end)
{
return true;
}
else
{
v.state=Stating.visiting;
q.add(v);
}
}
}
u.state=State.Visited;
}
}
return false;
}
}