vertex             38 opal/class/opal_graph.c static void opal_graph_vertex_construct(opal_graph_vertex_t *vertex);
vertex             39 opal/class/opal_graph.c static void opal_graph_vertex_destruct(opal_graph_vertex_t *vertex);
vertex             87 opal/class/opal_graph.c static void opal_graph_vertex_construct(opal_graph_vertex_t *vertex)
vertex             89 opal/class/opal_graph.c     vertex->in_adj_list = NULL;
vertex             90 opal/class/opal_graph.c     vertex->in_graph = NULL;
vertex             91 opal/class/opal_graph.c     vertex->vertex_data = NULL;
vertex             92 opal/class/opal_graph.c     vertex->sibling = NULL;
vertex             93 opal/class/opal_graph.c     vertex->copy_vertex_data = NULL;
vertex             94 opal/class/opal_graph.c     vertex->free_vertex_data = NULL;
vertex             95 opal/class/opal_graph.c     vertex->alloc_vertex_data = NULL;
vertex             96 opal/class/opal_graph.c     vertex->compare_vertex = NULL;
vertex             97 opal/class/opal_graph.c     vertex->print_vertex = NULL;
vertex            100 opal/class/opal_graph.c static void opal_graph_vertex_destruct(opal_graph_vertex_t *vertex)
vertex            102 opal/class/opal_graph.c     vertex->in_adj_list = NULL;
vertex            103 opal/class/opal_graph.c     vertex->in_graph = NULL;
vertex            104 opal/class/opal_graph.c     vertex->sibling = NULL;
vertex            105 opal/class/opal_graph.c     vertex->copy_vertex_data = NULL;
vertex            106 opal/class/opal_graph.c     vertex->alloc_vertex_data = NULL;
vertex            107 opal/class/opal_graph.c     vertex->compare_vertex = NULL;
vertex            108 opal/class/opal_graph.c     if (NULL != vertex->free_vertex_data) {
vertex            109 opal/class/opal_graph.c         vertex->free_vertex_data(vertex->vertex_data);
vertex            111 opal/class/opal_graph.c     vertex->vertex_data = NULL;
vertex            112 opal/class/opal_graph.c     vertex->print_vertex = NULL;
vertex            169 opal/class/opal_graph.c     aj_list->vertex = NULL;
vertex            175 opal/class/opal_graph.c    aj_list->vertex = NULL;
vertex            186 opal/class/opal_graph.c static void delete_all_edges_conceded_to_vertex(opal_graph_t *graph, opal_graph_vertex_t *vertex)
vertex            202 opal/class/opal_graph.c             if (edge->end == vertex) {
vertex            219 opal/class/opal_graph.c void opal_graph_add_vertex(opal_graph_t *graph, opal_graph_vertex_t *vertex)
vertex            227 opal/class/opal_graph.c        if (aj_list->vertex == vertex) {
vertex            234 opal/class/opal_graph.c    aj_list->vertex = vertex;
vertex            236 opal/class/opal_graph.c    vertex->in_adj_list = aj_list;
vertex            240 opal/class/opal_graph.c    vertex->in_graph = graph;
vertex            267 opal/class/opal_graph.c         if (aj_list->vertex == edge->start) {
vertex            270 opal/class/opal_graph.c         if (aj_list->vertex == edge->end) {
vertex            320 opal/class/opal_graph.c void opal_graph_remove_vertex(opal_graph_t *graph, opal_graph_vertex_t *vertex)
vertex            326 opal/class/opal_graph.c     adj_list = vertex->in_adj_list;
vertex            336 opal/class/opal_graph.c     delete_all_edges_conceded_to_vertex(graph, vertex);
vertex            338 opal/class/opal_graph.c     OBJ_RELEASE(vertex);
vertex            438 opal/class/opal_graph.c         if (NULL != aj_list->vertex->compare_vertex) {
vertex            440 opal/class/opal_graph.c             if (0 == aj_list->vertex->compare_vertex(aj_list->vertex->vertex_data, vertex_data)) {
vertex            442 opal/class/opal_graph.c                 return aj_list->vertex;
vertex            476 opal/class/opal_graph.c         opal_pointer_array_add(vertices_list,(void *)aj_list->vertex);
vertex            495 opal/class/opal_graph.c int opal_graph_get_adjacent_vertices(opal_graph_t *graph, opal_graph_vertex_t *vertex, opal_value_array_t *adjacents)
vertex            505 opal/class/opal_graph.c     if (graph != vertex->in_graph) {
vertex            506 opal/class/opal_graph.c         OPAL_OUTPUT((0,"Vertex %p not in the graph %p\n", (void *)vertex, (void *)graph));
vertex            512 opal/class/opal_graph.c     adj_list = (opal_adjacency_list_t *) vertex->in_adj_list;
vertex            518 opal/class/opal_graph.c         distance_from.vertex = edge->end;
vertex            570 opal/class/opal_graph.c         if (vertex_distance->vertex == vertex2) {
vertex            626 opal/class/opal_graph.c uint32_t opal_graph_dijkstra(opal_graph_t *graph, opal_graph_vertex_t *vertex, opal_value_array_t *distance_array)
vertex            639 opal/class/opal_graph.c     if (graph != vertex->in_graph) {
vertex            640 opal/class/opal_graph.c         OPAL_OUTPUT((0,"opal:graph:dijkstra: vertex %p not in the graph %p\n",(void *)vertex,(void *)graph));
vertex            652 opal/class/opal_graph.c         Q[i].vertex = adj_list->vertex;
vertex            657 opal/class/opal_graph.c         Q[i++].weight = (adj_list->vertex == vertex) ? 0 : DISTANCE_INFINITY;
vertex            672 opal/class/opal_graph.c             weight = opal_graph_adjacent(graph, current_vertex->vertex, q_start[i].vertex);
vertex            709 opal/class/opal_graph.c     opal_graph_vertex_t *vertex;
vertex            717 opal/class/opal_graph.c         vertex = OBJ_NEW(opal_graph_vertex_t);
vertex            719 opal/class/opal_graph.c         vertex->sibling = aj_list->vertex;
vertex            721 opal/class/opal_graph.c         aj_list->vertex->sibling = vertex;
vertex            723 opal/class/opal_graph.c         if (NULL != aj_list->vertex->alloc_vertex_data) {
vertex            724 opal/class/opal_graph.c             vertex->vertex_data = aj_list->vertex->alloc_vertex_data();
vertex            725 opal/class/opal_graph.c             vertex->alloc_vertex_data = aj_list->vertex->alloc_vertex_data;
vertex            728 opal/class/opal_graph.c         if (NULL != aj_list->vertex->copy_vertex_data) {
vertex            729 opal/class/opal_graph.c             aj_list->vertex->copy_vertex_data(&(vertex->vertex_data), aj_list->vertex->vertex_data);
vertex            730 opal/class/opal_graph.c             vertex->copy_vertex_data = aj_list->vertex->copy_vertex_data;
vertex            733 opal/class/opal_graph.c         vertex->free_vertex_data = aj_list->vertex->free_vertex_data;
vertex            734 opal/class/opal_graph.c         vertex->print_vertex = aj_list->vertex->print_vertex;
vertex            735 opal/class/opal_graph.c         vertex->compare_vertex = aj_list->vertex->compare_vertex;
vertex            736 opal/class/opal_graph.c         vertex->in_graph = *dest;
vertex            738 opal/class/opal_graph.c         opal_graph_add_vertex(*dest, vertex);
vertex            777 opal/class/opal_graph.c         if (NULL != aj_list->vertex->print_vertex) {
vertex            779 opal/class/opal_graph.c             tmp_str1 = aj_list->vertex->print_vertex(aj_list->vertex->vertex_data);
vertex            130 opal/class/opal_graph.h     opal_graph_vertex_t *vertex;  /* The adjacency_list is for adjacent of this vertex */
vertex            182 opal/class/opal_graph.h     opal_graph_vertex_t *vertex;
vertex            198 opal/class/opal_graph.h OPAL_DECLSPEC void opal_graph_add_vertex(opal_graph_t *graph, opal_graph_vertex_t *vertex);
vertex            208 opal/class/opal_graph.h OPAL_DECLSPEC void opal_graph_remove_vertex(opal_graph_t *graph, opal_graph_vertex_t *vertex);
vertex            308 opal/class/opal_graph.h OPAL_DECLSPEC int opal_graph_get_adjacent_vertices(opal_graph_t *graph, opal_graph_vertex_t *vertex, opal_value_array_t *adjacent);
vertex            343 opal/class/opal_graph.h OPAL_DECLSPEC uint32_t opal_graph_dijkstra(opal_graph_t *graph, opal_graph_vertex_t *vertex, opal_value_array_t *distance_array);
vertex            308 opal/util/bipartite_graph.c 			   int vertex)
vertex            312 opal/util/bipartite_graph.c     v = V_ID_TO_PTR(g, vertex);
vertex            317 opal/util/bipartite_graph.c 			       int vertex)
vertex            321 opal/util/bipartite_graph.c     v = V_ID_TO_PTR(g, vertex);
vertex             85 opal/util/bipartite_graph.h 			   int vertex);
vertex             95 opal/util/bipartite_graph.h 			    int vertex);