best_cost         203 ompi/mca/topo/treematch/treematch/k-partitioning.c   double cost, best_cost = -1;
best_cost         248 ompi/mca/topo/treematch/treematch/k-partitioning.c     if((cost<best_cost) || (best_cost == -1)){
best_cost         249 ompi/mca/topo/treematch/treematch/k-partitioning.c       best_cost=cost;
best_cost         267 ompi/mca/topo/treematch/treematch/k-partitioning.c   double cost, best_cost = -1;
best_cost         274 ompi/mca/topo/treematch/treematch/k-partitioning.c       if (( cost > best_cost)){
best_cost         275 ompi/mca/topo/treematch/treematch/k-partitioning.c 	best_cost = cost;
best_cost         293 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   double cost, best_cost = -1;
best_cost         311 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	if (( cost > best_cost)){
best_cost         312 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	  best_cost = cost;
best_cost         345 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   double cost, best_cost = -1;
best_cost         447 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     if((cost<best_cost) || (best_cost == -1)){
best_cost         448 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       best_cost=cost;