PQ_deleteMax       80 ompi/mca/topo/treematch/treematch/PriorityQueue.h int PQ_deleteMax(PriorityQueue * const);
PQ_deleteMax      112 ompi/mca/topo/treematch/treematch/k-partitioning.c       p = PQ_deleteMax(Qpart); /*we get the subset with the highest possible gain in p and remove it from Qpart*/
PQ_deleteMax      113 ompi/mca/topo/treematch/treematch/k-partitioning.c       u = PQ_deleteMax(&Q[p]); /*then we get the vertex with this highest possible gain in u and remove it from Q[p] */
PQ_deleteMax      118 ompi/mca/topo/treematch/treematch/k-partitioning.c       u = PQ_deleteMax(&Q[*surplus]); /*we get the vertex with the highest possible gain in surplus and remove it from Q[surplus] */
PQ_deleteMax      123 ompi/mca/topo/treematch/treematch/k-partitioning.c   j = PQ_deleteMax(&Qinst[u]); /*we get from Qinst[u] the subset in which we have to move u to get the highest gain.*/
PQ_deleteMax      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*/