Searched refs:m_predecessor (Results 1 – 5 of 5) sorted by relevance
| /third_party/boost/libs/graph/example/ |
| D | neighbor_bfs.cpp | 61 : m_distance(d), m_predecessor(p), m_color(c) in distance_and_pred_visitor()
71 put(m_predecessor, v, u); in tree_out_edge()
79 put(m_predecessor, u, v); in tree_in_edge()
83 PredecessorMap m_predecessor; member in distance_and_pred_visitor
|
| /third_party/boost/boost/graph/ |
| D | visitors.hpp | 259 predecessor_recorder(PredecessorMap pa) : m_predecessor(pa) {} in predecessor_recorder()
262 put(m_predecessor, target(e, g), source(e, g)); in operator ()()
264 PredecessorMap m_predecessor; member
281 edge_predecessor_recorder(PredEdgeMap pa) : m_predecessor(pa) {} in edge_predecessor_recorder()
284 put(m_predecessor, target(e, g), e); in operator ()()
286 PredEdgeMap m_predecessor; member
|
| D | dijkstra_shortest_paths.hpp | 126 , m_predecessor(p) in dijkstra_bfs_visitor()
136 bool decreased = relax_target(e, g, m_weight, m_predecessor, in tree_edge()
147 bool decreased = relax_target(e, g, m_weight, m_predecessor, in gray_target()
219 PredecessorMap m_predecessor; member
|
| D | astar_search.hpp | 133 , m_predecessor(p) in astar_bfs_visitor()
180 bool m_decreased = relax(e, g, m_weight, m_predecessor, m_distance, in tree_edge()
198 bool m_decreased = relax(e, g, m_weight, m_predecessor, m_distance, in gray_target()
217 bool m_decreased = relax(e, g, m_weight, m_predecessor, m_distance, in black_target()
237 PredecessorMap m_predecessor; member
|
| /third_party/boost/boost/graph/distributed/ |
| D | eager_dijkstra_shortest_paths.hpp | 93 : m_vis(vis), m_Q(Q), m_weight(w), m_predecessor(p), m_distance(d), in parallel_dijkstra_bfs_visitor()
114 boost::parallel::caching_property_map<PredecessorMap> c_pred(m_predecessor); in examine_edge()
142 PredecessorMap m_predecessor; member
|