void dfsAlgo(){

       Stack<Node> stack = new Stack<Node>();
       depart.visited= true;
       stack.add(depart);

       while(!stack.isEmpty()){
           Node node = stack.peek();
           boolean childNonVisiter= false;

           if(node.getState()!=ARRIVE){
               node.setColor(Color.cyan);
               ArrayList<Node> voisins = findVoisin(node);
               for(Node voisin : voisins){
                   if(!voisin.visited){
                       childNonVisiter= true;
                       stack.push(voisin);
                       voisin.visited=true;
                       break;
                   }
               }

               if(!childNonVisiter){
                   stack.pop();
               }
           }else {
               return;
           }

       }

   }