Implementation of BFS

public void BFS(Node s){
for all v in V{
d[v]=infinity;
}
d[s]=0;
Queue<Node> F=new Queue<Node>();
F.euqueue(s);
while(!F.isEmpty()){
Node u=F.dequeue();
for (u,v) in E
if(d[v]>d[u]+weight(u,v)){
d[v]=d[u]+weight(u,v);
F.euqueue(v);
}
}
}