bfs.java

import java.util.*;

public class bfs {
    
    public static void bfs(Map<Integer, List<Integer>> graph, int startNode, int numberOfNodes) {
        // Initialize a queue for BFS
        Queue<Integer> queue = new LinkedList<>();
        
        // Array to keep track of visited nodes
        boolean[] visited = new boolean[numberOfNodes];
        
        // Start BFS from the startNode
        queue.add(startNode);
        visited[startNode] = true;
        
        while (!queue.isEmpty()) {
            // Dequeue a node from the front
            int currentNode = queue.poll();
            System.out.print(currentNode + " "); // Print the current node
            
            // Iterate through all neighbors of the current node
            for (int neighbor : graph.getOrDefault(currentNode, new ArrayList<>())) {
                // If the neighbor is not visited, mark it as visited and enqueue it
                if (!visited[neighbor]) {
                    visited[neighbor] = true;
                    queue.add(neighbor);
                }
            }
        }
    }
}