How do I implement BFS in Java?

How do I implement BFS in Java?

To implement BFS in Java, you can use a queue to explore nodes level by level. Would you like a code example?

Yes, please provide a code example.

Here's a simple implementation:

import java.util.*;

class Graph {
    private int vertices;
    private LinkedList<Integer> adjList[];

    Graph(int v) {
        vertices = v;
        adjList = new LinkedList[v];
        for (int i = 0; i < v; i++) {
            adjList[i] = new LinkedList();
        }
    }

    void addEdge(int source, int destination) {
        adjList[source].add(destination);
    }

    void BFS(int start) {
        boolean visited[] = new boolean[vertices];
        Queue<Integer> queue = new LinkedList<>();

        visited[start] = true;
        queue.add(start);

        while (queue.size() != 0) {
            int node = queue.poll();
            System.out.print(node + " ");

            for (int neighbor : adjList[node]) {
                if (!visited[neighbor]) {
                    visited[neighbor] = true;
                    queue.add(neighbor);
                }
            }
        }
    }
}

Would you like to know how to run this code?

Yes, how do I run this code?

You can run this code in any Java IDE like IntelliJ or Eclipse. Just create a new Java file, copy the code, and add a main method to test it. Would you like help with that?