deficit             8 ompi/mca/topo/treematch/treematch/k-partitioning.c void initialization(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n, int k, int * const deficit, int * const surplus);
deficit             9 ompi/mca/topo/treematch/treematch/k-partitioning.c void algo(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n,  int * const deficit, int * const surplus);
deficit            10 ompi/mca/topo/treematch/treematch/k-partitioning.c double nextGain(PriorityQueue * const Qpart, PriorityQueue * const Q, int * const deficit, int * const surplus);
deficit            11 ompi/mca/topo/treematch/treematch/k-partitioning.c void balancing(int n, int deficit, int surplus, double ** const D, int * const part);
deficit            25 ompi/mca/topo/treematch/treematch/k-partitioning.c   int deficit, surplus, *part = NULL;
deficit            34 ompi/mca/topo/treematch/treematch/k-partitioning.c   initialization(part, comm, &Qpart, Q, Qinst, D, real_n, k, &deficit, &surplus);
deficit            37 ompi/mca/topo/treematch/treematch/k-partitioning.c   while((nextGain(&Qpart, Q, &deficit, &surplus))>0)
deficit            39 ompi/mca/topo/treematch/treematch/k-partitioning.c       algo(part, comm, &Qpart, Q, Qinst, D, real_n, &deficit, &surplus);
deficit            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*/
deficit            61 ompi/mca/topo/treematch/treematch/k-partitioning.c void initialization(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n, int k, int * const deficit, int * const surplus)
deficit           103 ompi/mca/topo/treematch/treematch/k-partitioning.c   *surplus = *deficit = 0;
deficit           106 ompi/mca/topo/treematch/treematch/k-partitioning.c void algo(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n, int * const deficit, int * const surplus)
deficit           110 ompi/mca/topo/treematch/treematch/k-partitioning.c   if(*deficit == *surplus) /*if the current partition is balanced*/
deficit           114 ompi/mca/topo/treematch/treematch/k-partitioning.c       *deficit = part[u]; /*p becomes the deficit */
deficit           152 ompi/mca/topo/treematch/treematch/k-partitioning.c double nextGain(PriorityQueue * const Qpart, PriorityQueue * const Q, int * const deficit, int * const surplus)
deficit           155 ompi/mca/topo/treematch/treematch/k-partitioning.c   if(*deficit == *surplus) /*if the current partition is balanced*/
deficit           162 ompi/mca/topo/treematch/treematch/k-partitioning.c void balancing(int n, int deficit, int surplus, double ** const D, int * const part)
deficit           164 ompi/mca/topo/treematch/treematch/k-partitioning.c   if(surplus != deficit) /*if the current partition is not balanced*/
deficit           172 ompi/mca/topo/treematch/treematch/k-partitioning.c 	    PQ_insert(&moves, i, D[i][deficit]-D[i][surplus]); /*we insert i in moves with the gain we get from moving i from surplus to deficit as key */
deficit           174 ompi/mca/topo/treematch/treematch/k-partitioning.c       part[PQ_deleteMax(&moves)] = deficit; /*we put the i from moves with the highest gain in deficit*/