Adaptor to use pr_bgl::lpastar as the inner sp algorithm for pr_bgl::lazysp.
More...
#include <lazysp_incsp_lpastar.h>
|
typedef boost::graph_traits
< Graph >::vertex_descriptor | Vertex |
|
typedef boost::graph_traits
< Graph >::edge_descriptor | Edge |
|
typedef boost::property_traits
< WMap >::value_type | weight_type |
|
typedef boost::property_map
< Graph, boost::vertex_index_t >
::type | VIndexMap |
|
|
| lazysp_incsp_lpastar (Graph &g, Vertex v_start, Vertex v_goal, WMap w_map, HeuristicMap heuristic_map, PredecessorMap predecessor_map, DistanceMap distance_map, DistanceLookaheadMap distance_lookahead_map, weight_type goal_margin, CompareFunction compare, CombineFunction combine, weight_type inf, weight_type zero) |
|
weight_type | solve (const Graph &g, Vertex v_start, Vertex v_goal, WMap wmap, std::vector< Edge > &path) |
|
void | update_notify (Edge euv) |
|
|
Graph & | g |
|
Vertex | v_start |
|
Vertex | v_goal |
|
WMap | w_map |
|
PredecessorMap | predecessor_map |
|
DistanceMap | distance_map |
|
weight_type | inf |
|
pr_bgl::lpastar< Graph,
map_heuristic,
boost::astar_visitor
< boost::null_visitor >
, PredecessorMap, DistanceMap,
DistanceLookaheadMap, WMap,
VIndexMap, CompareFunction,
CombineFunction, weight_type,
weight_type > | lpastar |
|
template<class Graph, class WMap, class HeuristicMap, class PredecessorMap, class DistanceMap, class DistanceLookaheadMap, typename CompareFunction, typename CombineFunction>
class pr_bgl::lazysp_incsp_lpastar< Graph, WMap, HeuristicMap, PredecessorMap, DistanceMap, DistanceLookaheadMap, CompareFunction, CombineFunction >
Adaptor to use pr_bgl::lpastar as the inner sp algorithm for pr_bgl::lazysp.
solve returns weight_type::max if a non-infinite path is found
solve is always called with the same g,v_start,v_goal
The documentation for this class was generated from the following file: