PQ_adjustKey      106 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_adjustKey(PriorityQueue * const, int val, double i);
PQ_adjustKey      135 ompi/mca/topo/treematch/treematch/k-partitioning.c       PQ_adjustKey(&Qinst[v], j, D[v][j]); /*we update this gain in Qinst[v]*/
PQ_adjustKey      138 ompi/mca/topo/treematch/treematch/k-partitioning.c       PQ_adjustKey(&Qinst[v], j, D[v][j]);/*we update this gain in Qinst[v]*/
PQ_adjustKey      140 ompi/mca/topo/treematch/treematch/k-partitioning.c       PQ_adjustKey(&Q[part[v]], v, d); /*we update it in Q[p[v]]*/
PQ_adjustKey      142 ompi/mca/topo/treematch/treematch/k-partitioning.c       PQ_adjustKey(Qpart, part[v], d); /*we update it in Qpart*/
PQ_adjustKey      149 ompi/mca/topo/treematch/treematch/k-partitioning.c   PQ_adjustKey(Qpart, part[u], d); /*we update the new highest possible gain in u's subset*/