min_nb_dumb       160 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int          dumb_id, min_nb_dumb = n, sum_dumb = 0, p;
min_nb_dumb       190 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       if(nb_dumb[i] < min_nb_dumb){
min_nb_dumb       191 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	min_nb_dumb = nb_dumb[i];
min_nb_dumb       218 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       for( j = 0; j < nb_dumb[i] - min_nb_dumb; j ++ ){
min_nb_dumb       225 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       for( j = 0 ; j < min_nb_dumb ; j ++ ){