PriorityQueue      17 ompi/mca/topo/treematch/treematch/PriorityQueue.c int PQ_init(PriorityQueue * const q, int size)
PriorityQueue      27 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_exit(PriorityQueue * const q)
PriorityQueue      40 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_free(PriorityQueue * const q)
PriorityQueue      51 ompi/mca/topo/treematch/treematch/PriorityQueue.c int PQ_isEmpty(PriorityQueue * const q)
PriorityQueue      60 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_insertElement(PriorityQueue * const q, QueueElement * const e)
PriorityQueue      69 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_deleteElement(PriorityQueue * const q, QueueElement * const e)
PriorityQueue      76 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_insert(PriorityQueue * const q, int val, double key)
PriorityQueue      87 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_delete(PriorityQueue * const q, int val)
PriorityQueue      94 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * PQ_findMaxElement(PriorityQueue * const q)
PriorityQueue      99 ompi/mca/topo/treematch/treematch/PriorityQueue.c QueueElement * PQ_deleteMaxElement(PriorityQueue * const q)
PriorityQueue     109 ompi/mca/topo/treematch/treematch/PriorityQueue.c double PQ_findMaxKey(PriorityQueue * const q)
PriorityQueue     117 ompi/mca/topo/treematch/treematch/PriorityQueue.c int PQ_deleteMax(PriorityQueue * const q)
PriorityQueue     127 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_increaseElementKey(PriorityQueue * const q, QueueElement * const e, double i)
PriorityQueue     136 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_decreaseElementKey(PriorityQueue * const q, QueueElement * const e, double i)
PriorityQueue     145 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_adjustElementKey(PriorityQueue * const q, QueueElement * const e, double i)
PriorityQueue     155 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_increaseKey(PriorityQueue * const q, int val, double i)
PriorityQueue     162 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_decreaseKey(PriorityQueue * const q, int val, double i)
PriorityQueue     169 ompi/mca/topo/treematch/treematch/PriorityQueue.c void PQ_adjustKey(PriorityQueue * const q, int val, double i)
PriorityQueue      36 ompi/mca/topo/treematch/treematch/PriorityQueue.h int PQ_init(PriorityQueue * const, int size);
PriorityQueue      37 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_free(PriorityQueue * const);
PriorityQueue      38 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_exit(PriorityQueue * const);
PriorityQueue      43 ompi/mca/topo/treematch/treematch/PriorityQueue.h int PQ_isEmpty(PriorityQueue * const);
PriorityQueue      48 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_insertElement(PriorityQueue * const, QueueElement * const); 
PriorityQueue      52 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_deleteElement(PriorityQueue * const, QueueElement * const);
PriorityQueue      57 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_insert(PriorityQueue * const, int val, double key);
PriorityQueue      61 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_delete(PriorityQueue * const, int val);
PriorityQueue      67 ompi/mca/topo/treematch/treematch/PriorityQueue.h QueueElement * PQ_findMaxElement(PriorityQueue * const);
PriorityQueue      71 ompi/mca/topo/treematch/treematch/PriorityQueue.h QueueElement * PQ_deleteMaxElement(PriorityQueue * const);
PriorityQueue      76 ompi/mca/topo/treematch/treematch/PriorityQueue.h double PQ_findMaxKey(PriorityQueue * const);
PriorityQueue      80 ompi/mca/topo/treematch/treematch/PriorityQueue.h int PQ_deleteMax(PriorityQueue * const);
PriorityQueue      85 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_increaseElementKey(PriorityQueue * const, QueueElement * const, double i);
PriorityQueue      89 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_decreaseElementKey(PriorityQueue * const, QueueElement * const, double i);
PriorityQueue      93 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_adjustElementKey(PriorityQueue * const, QueueElement * const, double i);
PriorityQueue      98 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_increaseKey(PriorityQueue * const, int val, double i);
PriorityQueue     102 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_decreaseKey(PriorityQueue * const, int val, double i);
PriorityQueue     106 ompi/mca/topo/treematch/treematch/PriorityQueue.h void PQ_adjustKey(PriorityQueue * const, int val, double i);
PriorityQueue       7 ompi/mca/topo/treematch/treematch/k-partitioning.c void memory_allocation(PriorityQueue ** Q, PriorityQueue ** Qinst, double *** D, int n, int k);
PriorityQueue       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);
PriorityQueue       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);
PriorityQueue      10 ompi/mca/topo/treematch/treematch/k-partitioning.c double nextGain(PriorityQueue * const Qpart, PriorityQueue * const Q, int * const deficit, int * const surplus);
PriorityQueue      12 ompi/mca/topo/treematch/treematch/k-partitioning.c void destruction(PriorityQueue * Qpart, PriorityQueue * Q, PriorityQueue * Qinst, double ** D, int n, int k);
PriorityQueue      23 ompi/mca/topo/treematch/treematch/k-partitioning.c   PriorityQueue Qpart, *Q = NULL, *Qinst = NULL;
PriorityQueue      51 ompi/mca/topo/treematch/treematch/k-partitioning.c void memory_allocation(PriorityQueue ** Q, PriorityQueue ** Qinst, double *** D, int n, int k)
PriorityQueue      54 ompi/mca/topo/treematch/treematch/k-partitioning.c   *Q = calloc(k, sizeof(PriorityQueue)); /*one Q for each partition*/
PriorityQueue      55 ompi/mca/topo/treematch/treematch/k-partitioning.c   *Qinst = calloc(n, sizeof(PriorityQueue)); /*one Qinst for each vertex*/
PriorityQueue      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)
PriorityQueue     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)
PriorityQueue     152 ompi/mca/topo/treematch/treematch/k-partitioning.c double nextGain(PriorityQueue * const Qpart, PriorityQueue * const Q, int * const deficit, int * const surplus)
PriorityQueue     167 ompi/mca/topo/treematch/treematch/k-partitioning.c       PriorityQueue moves; /*we use a queue to store the possible moves from surplus to deficit*/
PriorityQueue     179 ompi/mca/topo/treematch/treematch/k-partitioning.c void destruction(PriorityQueue * Qpart, PriorityQueue * Q, PriorityQueue * Qinst, double ** D, int n, int k)