moves             167 ompi/mca/topo/treematch/treematch/k-partitioning.c       PriorityQueue moves; /*we use a queue to store the possible moves from surplus to deficit*/
moves             168 ompi/mca/topo/treematch/treematch/k-partitioning.c       PQ_init(&moves, n);
moves             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 */
moves             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*/
moves             175 ompi/mca/topo/treematch/treematch/k-partitioning.c       PQ_exit(&moves);