From f0e61e88ac0c9e339711deb307bfbed7b6b8a85a Mon Sep 17 00:00:00 2001
From: vivek880490 <54447269+vivek880490@users.noreply.github.com>
Date: Mon, 25 Oct 2021 17:04:06 +0530
Subject: [PATCH] Update BfsJava

---
 BfsJava | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/BfsJava b/BfsJava
index 943e6b9..09e9ef1 100644
--- a/BfsJava
+++ b/BfsJava
@@ -46,13 +46,13 @@ class Solution
         
         while (!q.isEmpty())
         {
-            Integer node = q.poll();
+            int node = q.poll();
             bfs.add(node); 
  
             // Get all adjacent vertices of the dequeued vertex s
             // If a adjacent has not been visited, then mark it
             // visited and enqueue it
-            for(Integer it: adj.get(node)) {
+            for(int it: adj.get(node)) {
                 if(vis[it] == false) {
                     vis[it] = true; 
                     q.add(it);