local_vertices    705 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c static void display_partition(int *partition, int *local_vertices, int n, int depth, int k){
local_vertices    712 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	if(local_vertices[j]!=-1)
local_vertices    713 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	  fprintf(stdout,"%d ",local_vertices[j]);
local_vertices    721 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 				     tm_topology_t *topology, int *local_vertices,
local_vertices    738 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       printf("id : %d, com_mat= %p\n",local_vertices[0], (void *)com_mat->comm);
local_vertices    739 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     set_node(cur_node,NULL, 0, NULL, local_vertices[0], 0, NULL, depth);
local_vertices    754 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     display_partition(partition, local_vertices, N, depth, k);
local_vertices    761 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   tab_local_vertices = split_vertices( local_vertices, N, k, partition);
local_vertices    797 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int *local_vertices = NULL;
local_vertices    848 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   local_vertices = (int*) MALLOC (sizeof(int) * (K+N));
local_vertices    851 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     local_vertices[i] = i;
local_vertices    853 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     local_vertices[i] = -1;
local_vertices    862 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   kpartition_build_level_topology(root, &com_mat, N+K,  depth, topology, local_vertices,
local_vertices    871 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   FREE(local_vertices);