BFS in Undirected Connected Graph

Problem Statement:
        Implement BFS Traversal in a Undirected Graph

Fig: Undirected Graph

Solution:

BFS : (Breadth First Search)
The BFS begins at a root node and inspects all the neighboring nodes. Then for each of those neighbor nodes in turn, it inspects their neighbor nodes which were unvisited, and so on.

To implement the above definition of BFS we have used to queue below.

Full Source Code : Link

/**
 * Desc: BFS: using queue to visit to all nodes in a connected undirected Graph  
 */
 public void bfs(int startNode)
 {
  Queue<Integer> bfsQueue = new LinkedList<Integer>();

  // stating node visit status set to true
  vistedStatus.put(startNode, true);

  // start node added to Queue
  bfsQueue.add(startNode);

  while(!bfsQueue.isEmpty())
  {
   // Node poped from Queue
   int node=bfsQueue.poll();
   System.out.println("Node poped is : "+node);

   // all connected node list of a give node
   List<Integer> list=adjList.get(node);

   int size=list.size();
   System.out.print("Connected Nodes are : ");
   for(int i=0;i <size; ++i)
   {
    int adjNode=list.get(i);
    System.out.print(adjNode +"   ");
    boolean isVisited=vistedStatus.get(adjNode);
    if(!isVisited)
    {
     vistedStatus.put(adjNode, true);
     bfsQueue.add(adjNode);
    }
   }
   System.out.println("\n===================");
  }
 }

Please comment and post your suggestions.

Happy Coding !! :)