|
template<class Graph , class WMap , class HeuristicMap , class PredecessorMap , class DistanceMap , class DistanceLookaheadMap , typename CompareFunction , typename CombineFunction > |
lazysp_incsp_lpastar< Graph,
WMap, HeuristicMap,
PredecessorMap, DistanceMap,
DistanceLookaheadMap,
CompareFunction,
CombineFunction > | pr_bgl::make_lazysp_incsp_lpastar (Graph &g, typename boost::graph_traits< Graph >::vertex_descriptor v_start, typename boost::graph_traits< Graph >::vertex_descriptor v_goal, WMap w_map, HeuristicMap heuristic_map, PredecessorMap predecessor_map, DistanceMap distance_map, DistanceLookaheadMap distance_lookahead_map, typename boost::property_traits< WMap >::value_type goal_margin, CompareFunction compare, CombineFunction combine, typename boost::property_traits< WMap >::value_type inf, typename boost::property_traits< WMap >::value_type zero) |
|
template<class Graph , class WMap , class HeuristicMap , class PredecessorMap , class DistanceMap , class DistanceLookaheadMap , typename CompareFunction , typename CombineFunction > |
lazysp_incsp_rlpastar< Graph,
WMap, HeuristicMap,
PredecessorMap, DistanceMap,
DistanceLookaheadMap,
CompareFunction,
CombineFunction > | pr_bgl::make_lazysp_incsp_rlpastar (Graph &g, typename boost::graph_traits< Graph >::vertex_descriptor v_start, typename boost::graph_traits< Graph >::vertex_descriptor v_goal, WMap w_map, HeuristicMap heuristic_map, PredecessorMap predecessor_map, DistanceMap distance_map, DistanceLookaheadMap distance_lookahead_map, typename boost::property_traits< WMap >::value_type goal_margin, CompareFunction compare, CombineFunction combine, typename boost::property_traits< WMap >::value_type inf, typename boost::property_traits< WMap >::value_type zero) |
|
Adaptor to use pr_bgl::lpastar as the inner sp algorithm for pr_bgl::lazysp.
- Author
- Chris Dellin cdell.nosp@m.in@g.nosp@m.mail..nosp@m.com
- Copyright
- 2015 Carnegie Mellon University
-
License: BSD