com_mat_t          29 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void allocate_vertex(int,int *,com_mat_t *,int,int *,int);
com_mat_t          30 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c double eval_cost(int *, com_mat_t *);
com_mat_t          31 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int *kpartition_greedy(int, com_mat_t *,int,int *,int);
com_mat_t          33 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c com_mat_t **split_com_mat(com_mat_t *,int,int,int *);
com_mat_t          35 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void free_tab_com_mat(com_mat_t **,int);
com_mat_t          38 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void kpartition_build_level_topology(tm_tree_t *,com_mat_t *,int,int,tm_topology_t *,
com_mat_t          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_t         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_t         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_t         327 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c double eval_cost(int *partition, com_mat_t *com_mat)
com_mat_t         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_t         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_t         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_t         544 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   com_mat_t **res = NULL, *sub_com_mat;
com_mat_t         549 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   res = (com_mat_t**)MALLOC(k*sizeof(com_mat_t *));
com_mat_t         596 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     sub_com_mat = (com_mat_t *)MALLOC(sizeof(com_mat_t));
com_mat_t         643 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void free_tab_com_mat(com_mat_t **mat,int k)
com_mat_t         688 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c static void check_com_mat(com_mat_t *com_mat){
com_mat_t         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_t         725 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   com_mat_t **tab_com_mat = NULL; /* table of comunication matrix. We will have k of such comunication matrix, one for each subtree */
com_mat_t         799 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   com_mat_t com_mat;
com_mat_t           8 ompi/mca/topo/treematch/treematch/tm_kpartitioning.h int  *kpartition(int, com_mat_t*, int, int *, int);
com_mat_t        1589 ompi/mca/topo/treematch/treematch/tm_tree.c   com_mat_t com_mat;