balancing          11 ompi/mca/topo/treematch/treematch/k-partitioning.c void balancing(int n, int deficit, int surplus, double ** const D, int * const part);
balancing          43 ompi/mca/topo/treematch/treematch/k-partitioning.c   balancing(real_n, deficit, surplus, D, part); /*if partition isn't balanced we have to make one last move*/