void bfsAlgo(){

        Queue<Node> queue = new LinkedList<Node>();
        depart.visited = true;
        queue.add(depart);

        while (queue.size()>0){
            Node node = queue.remove();
            node.setColor(Color.cyan);
            if(node.getState()!= ARRIVE){
                for(Node child : findVoisin(node)){
                    if(!child.visited){

                        child.visited = true;
                        queue.add(child);
                    }
                }
            }else{
                break;
            }
        }
    }