Graph-BFS(Queue, Matrix)

public void bFS(int from, int[][] matrix) {

  Queue<Integer> queue = new LinkedList<>();
  boolean[] visited = new boolean[matrix.length];
  
  queue.offer(from);
  visited[from] = true;
  
  while(!queue.isEmpty()) {
    from = queue.poll();
    for(int i = 0; i < matrix[from].length; i++) {
      if(matrix[from][i] == 1 && !visited[i]) {
        queue.offer(i);
        visited[i] = true;
      }
    }
  }
}