vertex1           354 opal/class/opal_graph.c uint32_t opal_graph_adjacent(opal_graph_t *graph, opal_graph_vertex_t *vertex1, opal_graph_vertex_t *vertex2)
vertex1           362 opal/class/opal_graph.c     if (graph != vertex1->in_graph) {
vertex1           363 opal/class/opal_graph.c         OPAL_OUTPUT((0,"opal_graph_adjacent 1 Vertex1 %p not in the graph %p\n",(void *)vertex1,(void *)graph));
vertex1           377 opal/class/opal_graph.c     if (vertex1 == vertex2) {
vertex1           384 opal/class/opal_graph.c     adj_list = (opal_adjacency_list_t *) vertex1->in_adj_list;
vertex1           536 opal/class/opal_graph.c uint32_t opal_graph_spf(opal_graph_t *graph, opal_graph_vertex_t *vertex1, opal_graph_vertex_t *vertex2)
vertex1           546 opal/class/opal_graph.c     if (graph != vertex1->in_graph) {
vertex1           547 opal/class/opal_graph.c         OPAL_OUTPUT((0,"opal_graph_spf 1 Vertex1 %p not in the graph %p\n",(void *)vertex1,(void *)graph));
vertex1           563 opal/class/opal_graph.c     items_in_distance_array = opal_graph_dijkstra(graph, vertex1, distance_array);
vertex1           247 opal/class/opal_graph.h OPAL_DECLSPEC uint32_t opal_graph_adjacent(opal_graph_t *graph, opal_graph_vertex_t *vertex1, opal_graph_vertex_t *vertex2);
vertex1           329 opal/class/opal_graph.h OPAL_DECLSPEC uint32_t opal_graph_spf(opal_graph_t *graph, opal_graph_vertex_t *vertex1, opal_graph_vertex_t *vertex2);