best_part         266 ompi/mca/topo/treematch/treematch/k-partitioning.c   int i,best_part = -1;
best_part         276 ompi/mca/topo/treematch/treematch/k-partitioning.c 	best_part = res[i];
best_part         284 ompi/mca/topo/treematch/treematch/k-partitioning.c   res[u] = best_part;
best_part         285 ompi/mca/topo/treematch/treematch/k-partitioning.c   size[best_part]++;
best_part         292 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int i,best_part=0;
best_part         300 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	best_part = res[i];
best_part         313 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	  best_part = res[i];
best_part         323 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   res[u] = best_part;
best_part         324 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   size[best_part]++;