Skip to content

Update BfsJava #27

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
vivek880490 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update BfsJava #27

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions BfsJava
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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);
Expand Down