Home
last modified time | relevance | path

Searched refs:next_edge (Results 1 – 5 of 5) sorted by relevance

/third_party/boost/boost/graph/
Dplanar_face_traversal.hpp28 template < typename Edge > void next_edge(Edge) {} in next_edge() function
67 distinguished_edge_to_edge_map_t next_edge(next_edge_vector.begin(), em); in planar_face_traversal() local
88 std::map< vertex_t, edge_t > m = get(next_edge, e); in planar_face_traversal()
90 put(next_edge, e, m); in planar_face_traversal()
140 visitor.next_edge(e); in planar_face_traversal()
144 e = get(next_edge, e)[v]; in planar_face_traversal()
161 visitor.next_edge(*ei); in planar_face_traversal()
Dloop_erased_random_walk.hpp48 NextEdge next_edge, ColorMap color, in loop_erased_random_walk() argument
65 edge_descriptor e = next_edge(s, g); in loop_erased_random_walk()
Drandom_spanning_tree.hpp39 ColorMap color, NextEdge next_edge) in random_spanning_tree_internal() argument
60 loop_erased_random_walk(g, v, next_edge, color, path); in random_spanning_tree_internal()
/third_party/boost/libs/graph/example/
Dplanar_face_traversal.cpp40 template < typename Edge > void next_edge(Edge e) { std::cout << e << " "; } in next_edge() function
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/ops_info/
Doperator_info.cc1458 for (auto &next_edge : succ_edges()) { in ExactStrategiesAndRelatedEdges() local
1459 if (next_edge->InitEdgeCost() != SUCCESS) { in ExactStrategiesAndRelatedEdges()
1460 MS_LOG(EXCEPTION) << "Edge: " << next_edge->edge_name() << " cost init failed."; in ExactStrategiesAndRelatedEdges()