edge               49 opal/class/opal_graph.c static void opal_graph_edge_construct(opal_graph_edge_t *edge);
edge               50 opal/class/opal_graph.c static void opal_graph_edge_destruct(opal_graph_edge_t *edge);
edge              122 opal/class/opal_graph.c static void opal_graph_edge_construct(opal_graph_edge_t *edge)
edge              124 opal/class/opal_graph.c     edge->end = NULL;
edge              125 opal/class/opal_graph.c     edge->start = NULL;
edge              126 opal/class/opal_graph.c     edge->weight = 0;
edge              127 opal/class/opal_graph.c     edge->in_adj_list = NULL;
edge              131 opal/class/opal_graph.c static void opal_graph_edge_destruct(opal_graph_edge_t *edge)
edge              133 opal/class/opal_graph.c     edge->end = NULL;
edge              134 opal/class/opal_graph.c     edge->start = NULL;
edge              135 opal/class/opal_graph.c     edge->weight = 0;
edge              136 opal/class/opal_graph.c     edge->in_adj_list = NULL;
edge              189 opal/class/opal_graph.c     opal_graph_edge_t *edge, *next;
edge              198 opal/class/opal_graph.c         OPAL_LIST_FOREACH_SAFE(edge, next, aj_list->edges, opal_graph_edge_t) {
edge              202 opal/class/opal_graph.c             if (edge->end == vertex) {
edge              204 opal/class/opal_graph.c                 opal_list_remove_item(edge->in_adj_list->edges, (opal_list_item_t*)edge);
edge              206 opal/class/opal_graph.c                 OBJ_RELEASE(edge);
edge              257 opal/class/opal_graph.c int opal_graph_add_edge(opal_graph_t *graph, opal_graph_edge_t *edge)
edge              267 opal/class/opal_graph.c         if (aj_list->vertex == edge->start) {
edge              270 opal/class/opal_graph.c         if (aj_list->vertex == edge->end) {
edge              282 opal/class/opal_graph.c     edge->in_adj_list=start_aj_list;
edge              284 opal/class/opal_graph.c     opal_list_append(start_aj_list->edges, (opal_list_item_t*)edge);
edge              302 opal/class/opal_graph.c void opal_graph_remove_edge (opal_graph_t *graph, opal_graph_edge_t *edge)
edge              305 opal/class/opal_graph.c     opal_list_remove_item(edge->in_adj_list->edges, (opal_list_item_t*)edge);
edge              357 opal/class/opal_graph.c     opal_graph_edge_t *edge;
edge              385 opal/class/opal_graph.c     OPAL_LIST_FOREACH(edge, adj_list->edges, opal_graph_edge_t) {
edge              386 opal/class/opal_graph.c         if (edge->end == vertex2) {
edge              388 opal/class/opal_graph.c             return edge->weight;
edge              498 opal/class/opal_graph.c     opal_graph_edge_t *edge;
edge              516 opal/class/opal_graph.c     OPAL_LIST_FOREACH(edge, adj_list->edges, opal_graph_edge_t) {
edge              518 opal/class/opal_graph.c         distance_from.vertex = edge->end;
edge              519 opal/class/opal_graph.c         distance_from.weight = edge->weight;
edge              710 opal/class/opal_graph.c     opal_graph_edge_t *edge, *new_edge;
edge              746 opal/class/opal_graph.c         OPAL_LIST_FOREACH(edge, aj_list->edges, opal_graph_edge_t) {
edge              750 opal/class/opal_graph.c             new_edge->weight = edge->weight;
edge              752 opal/class/opal_graph.c             new_edge->start = edge->start->sibling;
edge              753 opal/class/opal_graph.c             new_edge->end = edge->end->sibling;
edge              767 opal/class/opal_graph.c     opal_graph_edge_t *edge;
edge              788 opal/class/opal_graph.c         OPAL_LIST_FOREACH(edge, aj_list->edges, opal_graph_edge_t) {
edge              790 opal/class/opal_graph.c             if (NULL != edge->end->print_vertex) {
edge              792 opal/class/opal_graph.c                 tmp_str2 = edge->end->print_vertex(edge->end->vertex_data);
edge              799 opal/class/opal_graph.c             opal_output(0, "    E(%s -> %d -> %s)",tmp_str1, edge->weight, tmp_str2);
edge              221 opal/class/opal_graph.h OPAL_DECLSPEC int opal_graph_add_edge(opal_graph_t *graph, opal_graph_edge_t *edge);
edge              234 opal/class/opal_graph.h OPAL_DECLSPEC void opal_graph_remove_edge (opal_graph_t *graph, opal_graph_edge_t *edge);
edge              244 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h     netloc_edge_t *edge;
edge              396 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h #define netloc_node_iter_edges(node,edge,_tmp) \
edge              397 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h     HASH_ITER(hh, node->edges, edge, _tmp)
edge              435 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h int netloc_edge_destruct(netloc_edge_t *edge);
edge              437 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h char * netloc_edge_pretty_print(netloc_edge_t* edge);
edge              441 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h int netloc_edge_is_in_partition(netloc_edge_t *edge, int partition);
edge              443 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h #define netloc_edge_get_num_links(edge) \
edge              444 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h     utarray_len((edge)->physical_links)
edge              446 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h #define netloc_edge_get_link(edge,i) \
edge              447 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h     (*(netloc_physical_link_t **)utarray_eltptr((edge)->physical_links, (i)))
edge              449 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h #define netloc_edge_get_num_subedges(edge) \
edge              450 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h     utarray_len((edge)->subnode_edges)
edge              452 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h #define netloc_edge_get_subedge(edge,i) \
edge              453 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h     (*(netloc_edge_t **)utarray_eltptr((edge)->subnode_edges, (i)))