vertices          612 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int **split_vertices( int *vertices, int n, int k, int *partition)
vertices          624 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     printf("Vertices id: ");print_1D_tab(vertices,n);
vertices          633 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	sub_vertices[i++] = vertices[j];
vertices          193 opal/util/bipartite_graph.c     OBJ_CONSTRUCT(&g->vertices, opal_pointer_array_t);
vertices          194 opal/util/bipartite_graph.c     err = opal_pointer_array_init(&g->vertices, 0, INT_MAX, 32);
vertices          236 opal/util/bipartite_graph.c         opal_pointer_array_set_item(&g->vertices, i, NULL);
vertices          240 opal/util/bipartite_graph.c     OBJ_DESTRUCT(&g->vertices);
vertices          393 opal/util/bipartite_graph.c     v->v_index = opal_pointer_array_add(&g->vertices, v);
vertices           65 opal/util/bipartite_graph_internal.h     opal_pointer_array_t vertices;
vertices          110 opal/util/bipartite_graph_internal.h      opal_pointer_array_get_item((opal_pointer_array_t *)&g->vertices, v_id))
vertices           62 test/util/bipartite_graph.c         check(opal_bp_graph_order(g) <= opal_pointer_array_get_size(&g->vertices)); \