comefrom: <qiyuangong>547_Friend_Circles_2.java
code: public int findCircleNum(int[][] M) {
          int[] visited = new int[M.length];
          int count = 0;
          Queue < Integer > queue = new LinkedList < > ();
          for (int i = 0; i < M.length; i++) {
              if (visited[i] == 0) {
                  queue.add(i);
                  while (!queue.isEmpty()) {
                      int s = queue.remove();
                      visited[s] = 1;
                      for (int j = 0; j < M.length; j++) {
                          if (M[s][j] == 1 && visited[j] == 0)
                              queue.add(j);
                      }
                  }
                  count++;
              }
          }
          return count;
      }
masked: public int sample_funcname ( int [ ] [ ] var_0 ) {
    int [ ] var_1 = new int [ var_0 . length ] ;
    int var_2 = 0 ;
    Queue < Integer > var_3 = new LinkedList < > ( ) ;
    for ( int var_4 = 0 ;
    var_4 < var_0 . length ;
    var_4 ++ ) {
      if ( var_1 [ var_4 ] == 0 ) {
        var_3 . add ( var_4 ) ;
        while ( ! var_3 . isEmpty ( ) ) {
          int var_5 = var_3 . remove ( ) ;
          var_1 [ var_5 ] = 1 ;
          for ( int var_6 = 0 ;
          var_6 < var_0 . length ;
          var_6 ++ ) {
            if ( var_0 [ var_5 ] [ var_6 ] == 1 && var_1 [ var_6 ] == 0 ) var_3 . add ( var_6 ) ;
          }
        }
        var_2 ++ ;
      }
    }
    return var_2 ;
  }
  