PGROUTING  2.4
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
pgrouting::algorithms::Pgr_astar< G > Class Template Reference

#include "pgr_astar.hpp"

Classes

class  astar_many_goals_visitor
 class for stopping when all targets are found More...
 
class  astar_one_goal_visitor
 visitor that terminates when we find the goal More...
 
class  distance_heuristic
 
struct  found_goals
 exception for termination More...
 

Public Types

typedef G::B_G B_G
 
typedef G::V V
 

Public Member Functions

void clear ()
 
Astar
Path astar (G &graph, int64_t start_vertex, int64_t end_vertex, int heuristic, double factor, double epsilon, bool only_cost)
 one to one astar 1 to 1 More...
 
std::deque< Pathastar (G &graph, int64_t start_vertex, std::vector< int64_t > end_vertex, int heuristic, double factor, double epsilon, bool only_cost)
 astar 1 to many More...
 
std::deque< Pathastar (G &graph, std::vector< int64_t > start_vertex, std::vector< int64_t > end_vertex, int heuristic, double factor, double epsilon, bool only_cost)
 

Private Member Functions

bool astar_1_to_1 (G &graph, V source, V target, int heuristic, double factor, double epsilon)
 Call to Astar 1 source to 1 target. More...
 
bool astar_1_to_many (G &graph, V source, const std::vector< V > &targets, int heuristic, double factor, double epsilon)
 Call to astar 1 source to many targets. More...
 
std::deque< Pathget_paths (const G &graph, V source, const std::vector< V > &targets, bool only_cost) const
 

Private Attributes

members;
std::vector< Vpredecessors
 
std::vector< double > distances
 
std::deque< VnodesInDistance
 

Detailed Description

template<class G>
class pgrouting::algorithms::Pgr_astar< G >

Definition at line 52 of file pgr_astar.hpp.

Member Typedef Documentation

template<class G>
typedef G::B_G pgrouting::algorithms::Pgr_astar< G >::B_G

Definition at line 55 of file pgr_astar.hpp.

template<class G>
typedef G::V pgrouting::algorithms::Pgr_astar< G >::V

Definition at line 54 of file pgr_astar.hpp.

Member Function Documentation

template<class G>
Path pgrouting::algorithms::Pgr_astar< G >::astar ( G &  graph,
int64_t  start_vertex,
int64_t  end_vertex,
int  heuristic,
double  factor,
double  epsilon,
bool  only_cost 
)
inline

one to one astar 1 to 1

Definition at line 67 of file pgr_astar.hpp.

Referenced by pgrouting::algorithms::Pgr_astar< G >::astar(), and pgr_astar().

template<class G>
std::deque<Path> pgrouting::algorithms::Pgr_astar< G >::astar ( G &  graph,
int64_t  start_vertex,
std::vector< int64_t >  end_vertex,
int  heuristic,
double  factor,
double  epsilon,
bool  only_cost 
)
inline
template<class G>
std::deque<Path> pgrouting::algorithms::Pgr_astar< G >::astar ( G &  graph,
std::vector< int64_t >  start_vertex,
std::vector< int64_t >  end_vertex,
int  heuristic,
double  factor,
double  epsilon,
bool  only_cost 
)
inline
template<class G>
bool pgrouting::algorithms::Pgr_astar< G >::astar_1_to_1 ( G &  graph,
V  source,
V  target,
int  heuristic,
double  factor,
double  epsilon 
)
inlineprivate
template<class G>
bool pgrouting::algorithms::Pgr_astar< G >::astar_1_to_many ( G &  graph,
V  source,
const std::vector< V > &  targets,
int  heuristic,
double  factor,
double  epsilon 
)
inlineprivate
template<class G>
std::deque<Path> pgrouting::algorithms::Pgr_astar< G >::get_paths ( const G &  graph,
V  source,
const std::vector< V > &  targets,
bool  only_cost 
) const
inlineprivate

Member Data Documentation

template<class G>
std::deque< V > pgrouting::algorithms::Pgr_astar< G >::nodesInDistance
private

Definition at line 174 of file pgr_astar.hpp.


The documentation for this class was generated from the following file: