public void bfs(Node node)
 {
 queue.add(node);
 node.visited=true;
 while (!queue.isEmpty())
 {
 
 Node element=queue.remove();
 System.out.print(element.name + "--->");
 List<Node> neighbours=element.getNeighbours();
 for (int i = 0; i < neighbours.size(); i++) {
 Node n=neighbours.get(i);
 if(n!=null && !n.visited)
 {
 queue.add(n);
 n.visited=true;
 
 }
 }
 
 }
 }