Q                   7 ompi/mca/topo/treematch/treematch/k-partitioning.c void memory_allocation(PriorityQueue ** Q, PriorityQueue ** Qinst, double *** D, int n, int k);
Q                   8 ompi/mca/topo/treematch/treematch/k-partitioning.c void initialization(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n, int k, int * const deficit, int * const surplus);
Q                   9 ompi/mca/topo/treematch/treematch/k-partitioning.c void algo(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n,  int * const deficit, int * const surplus);
Q                  10 ompi/mca/topo/treematch/treematch/k-partitioning.c double nextGain(PriorityQueue * const Qpart, PriorityQueue * const Q, int * const deficit, int * const surplus);
Q                  12 ompi/mca/topo/treematch/treematch/k-partitioning.c void destruction(PriorityQueue * Qpart, PriorityQueue * Q, PriorityQueue * Qinst, double ** D, int n, int k);
Q                  23 ompi/mca/topo/treematch/treematch/k-partitioning.c   PriorityQueue Qpart, *Q = NULL, *Qinst = NULL;
Q                  30 ompi/mca/topo/treematch/treematch/k-partitioning.c   memory_allocation(&Q, &Qinst, &D, real_n, k);
Q                  34 ompi/mca/topo/treematch/treematch/k-partitioning.c   initialization(part, comm, &Qpart, Q, Qinst, D, real_n, k, &deficit, &surplus);
Q                  37 ompi/mca/topo/treematch/treematch/k-partitioning.c   while((nextGain(&Qpart, Q, &deficit, &surplus))>0)
Q                  39 ompi/mca/topo/treematch/treematch/k-partitioning.c       algo(part, comm, &Qpart, Q, Qinst, D, real_n, &deficit, &surplus);
Q                  46 ompi/mca/topo/treematch/treematch/k-partitioning.c   destruction(&Qpart, Q, Qinst, D, real_n, k);
Q                  51 ompi/mca/topo/treematch/treematch/k-partitioning.c void memory_allocation(PriorityQueue ** Q, PriorityQueue ** Qinst, double *** D, int n, int k)
Q                  54 ompi/mca/topo/treematch/treematch/k-partitioning.c   *Q = calloc(k, sizeof(PriorityQueue)); /*one Q for each partition*/
Q                  61 ompi/mca/topo/treematch/treematch/k-partitioning.c void initialization(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n, int k, int * const deficit, int * const surplus)
Q                  72 ompi/mca/topo/treematch/treematch/k-partitioning.c     PQ_init(&Q[i], n);
Q                  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*/
Q                  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*/
Q                 106 ompi/mca/topo/treematch/treematch/k-partitioning.c void algo(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n, int * const deficit, int * const surplus)
Q                 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] */
Q                 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] */
Q                 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])*/
Q                 140 ompi/mca/topo/treematch/treematch/k-partitioning.c       PQ_adjustKey(&Q[part[v]], v, d); /*we update it in Q[p[v]]*/
Q                 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*/
Q                 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*/
Q                 152 ompi/mca/topo/treematch/treematch/k-partitioning.c double nextGain(PriorityQueue * const Qpart, PriorityQueue * const Q, int * const deficit, int * const surplus)
Q                 158 ompi/mca/topo/treematch/treematch/k-partitioning.c     res = PQ_findMaxKey(&Q[*surplus]); /*we get the highest possible gain from surplus*/
Q                 179 ompi/mca/topo/treematch/treematch/k-partitioning.c void destruction(PriorityQueue * Qpart, PriorityQueue * Q, PriorityQueue * Qinst, double ** D, int n, int k)
Q                 184 ompi/mca/topo/treematch/treematch/k-partitioning.c     PQ_exit(&Q[i]);
Q                 185 ompi/mca/topo/treematch/treematch/k-partitioning.c   free(Q);
Q                 629 opal/class/opal_graph.c     vertex_distance_from_t *Q, *q_start, *current_vertex;
Q                 645 opal/class/opal_graph.c     Q = (vertex_distance_from_t *)malloc(graph_order * sizeof(vertex_distance_from_t));
Q                 647 opal/class/opal_graph.c     q_start = Q;
Q                 652 opal/class/opal_graph.c         Q[i].vertex = adj_list->vertex;
Q                 657 opal/class/opal_graph.c         Q[i++].weight = (adj_list->vertex == vertex) ? 0 : DISTANCE_INFINITY;
Q                 689 opal/class/opal_graph.c         opal_value_array_append_item(distance_array, (void *)&(Q[i+1]));
Q                 692 opal/class/opal_graph.c     free(Q);