Home
last modified time | relevance | path

Searched refs:edge_id (Results 1 – 8 of 8) sorted by relevance

/third_party/boost/boost/graph/
Dedge_list.hpp51 typedef D edge_id; typedef in boost::edge_list_impl
61 edge_descriptor(EdgeIter p, edge_id id) : _ptr(p), _id(id) {} in edge_descriptor()
62 operator edge_id() { return _id; } in operator edge_id()
64 edge_id _id;
94 edge_id _i;
142 typedef el_edge_property_map< typename Graph::edge_id,
178 typedef D edge_id; typedef in boost::edge_list_impl_ra
184 typedef edge_id edge_descriptor;
186 typedef typename boost::integer_range< edge_id >::iterator edge_iterator;
/third_party/boost/libs/graph/example/
Dexterior_properties.cpp115 EdgeIndexMap edge_id = boost::get(boost::edge_index, G); in main() local
120 print_network(G, IterMap(capacity, edge_id), IterMap(flow, edge_id)); in main()
/third_party/boost/libs/graph/test/
Dproperty_iter.cpp39 edge_id = 501 enumerator
77 property_map< Graph, edge_id_t >::type edge_id_map = get(edge_id, g); in main()
128 boost::tie(itEdgeBegin, itEdgeEnd) = get_property_iter_range(g, edge_id); in main()
Dgraph.cpp33 edge_id = 501 enumerator
95 typename graph_traits< Graph >::vertex_descriptor b, EdgeID edge_id, in check_edge_added() argument
126 else if (inserted && edge_id[e] != correct_id) in check_edge_added()
133 else if (!inserted && edge_id[e] != edge_id[edge(a, b, g).first]) in check_edge_added()
178 property_map< Graph, edge_id_t >::type edge_id_map = get(edge_id, g); in main()
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/gnn/
Dlocal_node.cc136 auto edge_id = edge->id(); in AddAdjacent() local
137 adjacent_nodes_.insert({node_id, edge_id}); in AddAdjacent()
Dgraph_data_impl.cc120 for (const auto &edge_id : edge_list) { in GetNodesFromEdges() local
121 auto itr = edge_id_map_.find(edge_id); in GetNodesFromEdges()
123 std::string err_msg = "Invalid edge id:" + std::to_string(edge_id); in GetNodesFromEdges()
148 EdgeIdType edge_id; in GetEdgesFromNodes() local
149 src_node->GetEdgeByAdjNodeId(node_id.second, &edge_id); in GetEdgesFromNodes()
151 std::vector<EdgeIdType> connection_edge = {edge_id}; in GetEdgesFromNodes()
Dgraph_loader.cc188 EdgeIdType edge_id = col_jsn["first_id"]; in LoadEdge() local
197 (*edge) = std::make_shared<LocalEdge>(edge_id, edge_type, edge_weight, src, dst); in LoadEdge()
Dgraph_data_client.cc115 for (const auto &edge_id : edge_list) { in GetNodesFromEdges() local
116 request.add_id(static_cast<google::protobuf::int32>(edge_id)); in GetNodesFromEdges()