import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class BFS {

    private Queue queue;

    public BFS() {
        queue = new LinkedList();
    }

    public void bfs(int adjacency_matrix[][], int source) {
        int number_of_nodes = adjacency_matrix[source].length - 1;

        int[] visited = new int[number_of_nodes + 1];
        int i, element;

        visited[source] = 1;
        queue.add(source);

        while (!queue.isEmpty()) {
            element = queue.remove();
            i = element;
            System.out.print(i + "\t");
            while (i