astar_search.hpp File Reference

#include <functional>
#include <vector>
#include <boost/limits.hpp>
#include <boost/throw_exception.hpp>
#include <boost/graph/named_function_params.hpp>
#include <boost/graph/relax.hpp>
#include <boost/graph/exception.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <boost/graph/iteration_macros.hpp>
#include <boost/graph/detail/d_ary_heap.hpp>
#include <boost/graph/property_maps/constant_property_map.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/property_map/vector_property_map.hpp>
#include <boost/property_map/function_property_map.hpp>
#include <boost/concept/assert.hpp>

Include dependency graph for astar_search.hpp:

Classes
struct	boost::AStarHeuristicConcept< Heuristic, Graph >
class	boost::astar_heuristic< Graph, CostType >
struct	boost::AStarVisitorConcept< Visitor, Graph >
class	boost::astar_visitor< Visitors >
struct	boost::detail::astar_bfs_visitor< AStarHeuristic, UniformCostVisitor, UpdatableQueue, PredecessorMap, CostMap, DistanceMap, WeightMap, ColorMap, BinaryFunction, BinaryPredicate >
struct	boost::graph_detail::select1st< A, B >

Namespaces
	boost
	Duration formatting facet for input.
	boost::detail
	boost::graph_detail

Typedefs
typedef astar_visitor	boost::default_astar_visitor

Functions
template<class Visitors >
astar_visitor< Visitors >	boost::make_astar_visitor (Visitors vis)
template<typename VertexListGraph , typename AStarHeuristic , typename AStarVisitor , typename PredecessorMap , typename CostMap , typename DistanceMap , typename WeightMap , typename ColorMap , typename VertexIndexMap , typename CompareFunction , typename CombineFunction , typename CostInf , typename CostZero >
void	boost::astar_search_no_init (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, AStarVisitor vis, PredecessorMap predecessor, CostMap cost, DistanceMap distance, WeightMap weight, ColorMap color, VertexIndexMap index_map, CompareFunction compare, CombineFunction combine, CostInf, CostZero zero)
template<typename VertexListGraph , typename AStarHeuristic , typename AStarVisitor , typename PredecessorMap , typename CostMap , typename DistanceMap , typename WeightMap , typename CompareFunction , typename CombineFunction , typename CostInf , typename CostZero >
void	boost::astar_search_no_init_tree (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, AStarVisitor vis, PredecessorMap predecessor, CostMap cost, DistanceMap distance, WeightMap weight, CompareFunction compare, CombineFunction combine, CostInf, CostZero zero)
template<typename VertexListGraph , typename AStarHeuristic , typename AStarVisitor , typename PredecessorMap , typename CostMap , typename DistanceMap , typename WeightMap , typename VertexIndexMap , typename ColorMap , typename CompareFunction , typename CombineFunction , typename CostInf , typename CostZero >
void	boost::astar_search (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, AStarVisitor vis, PredecessorMap predecessor, CostMap cost, DistanceMap distance, WeightMap weight, VertexIndexMap index_map, ColorMap color, CompareFunction compare, CombineFunction combine, CostInf inf, CostZero zero)
template<typename VertexListGraph , typename AStarHeuristic , typename AStarVisitor , typename PredecessorMap , typename CostMap , typename DistanceMap , typename WeightMap , typename CompareFunction , typename CombineFunction , typename CostInf , typename CostZero >
void	boost::astar_search_tree (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, AStarVisitor vis, PredecessorMap predecessor, CostMap cost, DistanceMap distance, WeightMap weight, CompareFunction compare, CombineFunction combine, CostInf inf, CostZero zero)
template<typename VertexListGraph , typename AStarHeuristic , typename P , typename T , typename R >
void	boost::astar_search (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, const bgl_named_params< P, T, R > &params)
template<typename VertexListGraph , typename AStarHeuristic , typename P , typename T , typename R >
void	boost::astar_search_tree (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, const bgl_named_params< P, T, R > &params)
template<typename VertexListGraph , typename AStarHeuristic , typename P , typename T , typename R >
void	boost::astar_search_no_init (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, const bgl_named_params< P, T, R > &params)
template<typename VertexListGraph , typename AStarHeuristic , typename P , typename T , typename R >
void	boost::astar_search_no_init_tree (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, AStarHeuristic h, const bgl_named_params< P, T, R > &params)