matrice 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); matrice 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); matrice 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) matrice 83 ompi/mca/topo/treematch/treematch/k-partitioning.c D[i][part[j]] += matrice[i][j]; matrice 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) matrice 134 ompi/mca/topo/treematch/treematch/k-partitioning.c D[v][j]= D[v][j] - matrice[u][v]; /*we compute the new D[v, i] (here j has the value of the starting subset of u, that's why we say i) */ matrice 137 ompi/mca/topo/treematch/treematch/k-partitioning.c D[v][j] = D[v][j] + matrice[u][v]; /*matrice[u][v]; we compute the new D[v, j]*/