root/ompi/mca/topo/treematch/treematch/k-partitioning.h

/* [<][>][^][v][top][bottom][index][help] */

INCLUDED FROM

   1 #ifndef K_PARTITIONING
   2 #define K_PARTITIONING
   3 
   4 #include "PriorityQueue.h"
   5 
   6 /*
   7   kPartitioning : function to call the k-partitioning algorithm
   8       - comm : the communication matrix
   9       - n : the number of vertices (including dumb  vertices)
  10       - k : the number of partitions
  11       - constraints : the list of constraints
  12       - nb_constraints : the number of constraints
  13       - greedy_trials : the number of trials to build the partition vector with kpartition_greedy
  14           - 0 : cyclic distribution of vertices
  15           - > 0 : use of kpartition_greedy with greedy_trials number of trials 
  16  */
  17              
  18 int* kPartitioning(double ** comm, int n, int k, int * const constraints, int nb_constraints, int greedy_trials);
  19 
  20 #endif /*K_PARTITIONING*/
/* [<][>][^][v][top][bottom][index][help] */