com_mat            54 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c SCOTCH_Graph* com_mat_to_scotch_graph(com_mat_t *com_mat, int n){
com_mat            55 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   double **mat = com_mat->comm;
com_mat            72 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   for(i = 0; i < com_mat->n ; i++) {
com_mat            82 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     for(j = i+1 ; j < com_mat->n ; j++) {
com_mat           105 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   for(i = com_mat->n ; i<vertnbr ; i++) {
com_mat           151 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int  *kpartition_scotch(int k, com_mat_t *com_mat, int n, int *constraints, int nb_constraints){
com_mat           235 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   graphptr = com_mat_to_scotch_graph(com_mat, p);
com_mat           272 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     partition = kpartition_greedy(k, com_mat, n, constraints, nb_constraints);
com_mat           290 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void allocate_vertex(int u, int *res, com_mat_t *com_mat, int n, int *size, int max_size)
com_mat           297 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   if(u>=com_mat->n){
com_mat           307 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	cost = (((i)<com_mat->n)) ?com_mat->comm[u][i]:0;
com_mat           327 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c double eval_cost(int *partition, com_mat_t *com_mat)
com_mat           332 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   for( i = 0 ; i < com_mat->n ; i++ )
com_mat           333 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     for( j = i+1 ; j < com_mat->n ; j++ )
com_mat           335 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	cost += com_mat->comm[i][j];
com_mat           340 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int  *kpartition_greedy(int k, com_mat_t *com_mat, int n, int *constraints, int nb_constraints)
com_mat           361 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     printf("max_size = %d (n=%d,k=%d)\ncom_mat->n-1=%d\n",max_size,n,k,com_mat->n-1);
com_mat           440 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	allocate_vertex(i, partition, com_mat, n, size, max_size);
com_mat           442 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     cost = eval_cost(partition,com_mat);
com_mat           463 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int *kpartition(int k, com_mat_t *com_mat, int n, int *constraints, int nb_constraints)
com_mat           482 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     res = kpartition_scotch(k, com_mat, n, constraints, nb_constraints);
com_mat           486 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     res = kpartition_greedy(k, com_mat, n, constraints, nb_constraints);
com_mat           491 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   res = kpartition_greedy(k, com_mat, n, constraints, nb_constraints);
com_mat           542 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c com_mat_t **split_com_mat(com_mat_t *com_mat, int n, int k, int *partition)
com_mat           554 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     display_tab(com_mat->comm,com_mat->n);
com_mat           568 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     for( j = 0; j < com_mat->n; j ++)
com_mat           575 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	display_tab(com_mat->comm,com_mat->n);
com_mat           591 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	sub_mat[i][j] = com_mat->comm[ii][jj];
com_mat           688 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c static void check_com_mat(com_mat_t *com_mat){
com_mat           691 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   for( i = 0 ; i < com_mat->n ; i++ )
com_mat           692 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     for( j = 0 ; j < com_mat->n ; j++ )
com_mat           693 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       if(com_mat->comm[i][j]<0){
com_mat           694 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	printf("com_mat->comm[%d][%d]= %f\n",i,j,com_mat->comm[i][j]);
com_mat           720 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void kpartition_build_level_topology(tm_tree_t *cur_node, com_mat_t *com_mat, int N, int depth,
com_mat           738 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       printf("id : %d, com_mat= %p\n",local_vertices[0], (void *)com_mat->comm);
com_mat           745 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     printf("Partitionning Matrix of size %d (problem size= %d) in %d partitions\n", com_mat->n, N, k);
com_mat           751 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   partition = kpartition(k, com_mat, N, constraints, nb_constraints);
com_mat           758 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   tab_com_mat = split_com_mat( com_mat, N, k, partition);
com_mat           799 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   com_mat_t com_mat;
com_mat           834 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   com_mat.comm = comm;
com_mat           835 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   com_mat.n    = N;
com_mat           862 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   kpartition_build_level_topology(root, &com_mat, N+K,  depth, topology, local_vertices,
com_mat             9 ompi/mca/topo/treematch/treematch/tm_kpartitioning.h tm_tree_t * kpartition_build_tree_from_topology(tm_topology_t *topology,double **com_mat,int N, int *constraints, int nb_constraints, double *obj_weight, double *com_speed);
com_mat          1589 ompi/mca/topo/treematch/treematch/tm_tree.c   com_mat_t com_mat;
com_mat          1593 ompi/mca/topo/treematch/treematch/tm_tree.c   com_mat.comm = aff_mat->mat;
com_mat          1594 ompi/mca/topo/treematch/treematch/tm_tree.c   com_mat.n = n;
com_mat          1599 ompi/mca/topo/treematch/treematch/tm_tree.c   partition = kpartition(solution_size, &com_mat, n, NULL, 0);