PQ_insert          57 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_insert(PriorityQueue * const, int val, double key);
PQ_insert          91 ompi/mca/topo/treematch/treematch/k-partitioning.c       PQ_insert(&Qinst[i], j, D[i][j]); /*we insert the corresponding D(i,j) value in Qinst[i]*/
PQ_insert          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_insert          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_insert         122 ompi/mca/topo/treematch/treematch/k-partitioning.c   PQ_insert(Qpart, part[u], d); /*we put part[u] back in Qpart with its new highest possible gain*/
PQ_insert         148 ompi/mca/topo/treematch/treematch/k-partitioning.c     PQ_insert(&Q[part[u]], u, d); /*we insert u in the Q queue of its new subset*/
PQ_insert         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 */