PQ_findMaxKey      76 ompi/mca/topo/treematch/treematch/PriorityQueue.h double PQ_findMaxKey(PriorityQueue * const);
PQ_findMaxKey      95 ompi/mca/topo/treematch/treematch/k-partitioning.c     PQ_insert(&Q[part[i]], i, PQ_findMaxKey(&Qinst[i])-D[i][part[i]]); /*we insert in Q[part[i]] the vertex i with its highest possible gain*/
PQ_findMaxKey      99 ompi/mca/topo/treematch/treematch/k-partitioning.c     PQ_insert(Qpart, i, PQ_findMaxKey(&Q[i])); /*we insert it in Qpart with the highest possible gain by one of its vertex as key*/
PQ_findMaxKey     121 ompi/mca/topo/treematch/treematch/k-partitioning.c   d = PQ_findMaxKey(&Q[part[u]]); /*we get the next highest possible gain in part[u] (without taking u in account as we already removed it from Q[part[u])*/
PQ_findMaxKey     139 ompi/mca/topo/treematch/treematch/k-partitioning.c       d = PQ_findMaxKey(&Qinst[v]) - D[v][part[v]]; /*we compute v's new highest possible gain*/
PQ_findMaxKey     141 ompi/mca/topo/treematch/treematch/k-partitioning.c       d = PQ_findMaxKey(&Q[part[v]]); /*we get the highest possible gain in v's subset*/
PQ_findMaxKey     146 ompi/mca/topo/treematch/treematch/k-partitioning.c   d = PQ_findMaxKey(&Qinst[u]) - D[u][part[u]]; /*we compute the new u's highest possible gain*/
PQ_findMaxKey     156 ompi/mca/topo/treematch/treematch/k-partitioning.c     res = PQ_findMaxKey(Qpart); /*we get the highest possible gain*/
PQ_findMaxKey     158 ompi/mca/topo/treematch/treematch/k-partitioning.c     res = PQ_findMaxKey(&Q[*surplus]); /*we get the highest possible gain from surplus*/