Given a directed graph, design an algorithm to find out whether there is a route be- tween two nodes.

public enum State{
Unvisited, Visiting, Visited;
}

public boolean find(Node n1, Node n2, Graph g){
Queue<Node> q=new Queue<Node>();
q.enqueue(n1);
for(Node d: g.getNodes()){
d.state=State.Univisited;
}

while(!q.isEmpty()){
Node current=q.remove();
for(Node v: current.getAdjacent()){
if(v.state==State.visited)
return true;
else{
v.state=State.Visiting;
q.enqueue(v);
}
}
current.state=State.visited;
}
return false;
}