greedy_trials      17 ompi/mca/topo/treematch/treematch/k-partitioning.c int*  build_p_vector(double **comm, int n, int k, int greedy_trials, int * constraints, int nb_constraints);
greedy_trials      19 ompi/mca/topo/treematch/treematch/k-partitioning.c int* kPartitioning(double ** comm, int n, int k, int * constraints, int nb_constraints, int greedy_trials)
greedy_trials      28 ompi/mca/topo/treematch/treematch/k-partitioning.c   part = build_p_vector(comm, n, k, greedy_trials, constraints, nb_constraints);
greedy_trials     301 ompi/mca/topo/treematch/treematch/k-partitioning.c int* build_p_vector(double **comm, int n, int k, int greedy_trials, int * constraints, int nb_constraints)
greedy_trials     304 ompi/mca/topo/treematch/treematch/k-partitioning.c   if(greedy_trials>0) /*if greedy_trials > 0 then we use kpartition_greedy with greedy_trials trials*/
greedy_trials     306 ompi/mca/topo/treematch/treematch/k-partitioning.c       part = kpartition_greedy2(k, comm, n, greedy_trials, constraints, nb_constraints);
greedy_trials      18 ompi/mca/topo/treematch/treematch/k-partitioning.h int* kPartitioning(double ** comm, int n, int k, int * const constraints, int nb_constraints, int greedy_trials);