PGROUTING  2.4
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
pgr_dijkstra.hpp File Reference
#include <boost/config.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <deque>
#include <set>
#include <vector>
#include <algorithm>
#include "./../../common/src/basePath_SSEC.hpp"
#include "./../../common/src/pgr_base_graph.hpp"

Go to the source code of this file.

Classes

class  Pgr_dijkstra< G >
 
class  Pgr_dijkstra< G >
 
class  Pgr_dijkstra< G >::dijkstra_distance_visitor
 class for stopping when a distance/cost has being surpassed More...
 
class  Pgr_dijkstra< G >::dijkstra_many_goal_visitor
 class for stopping when all targets are found More...
 
class  Pgr_dijkstra< G >::dijkstra_one_goal_visitor
 class for stopping when 1 target is found More...
 
struct  Pgr_dijkstra< G >::found_goals
 exception for termination More...
 

Functions

template<class G >
Path pgr_dijkstra (G &graph, int64_t source, int64_t target, bool only_cost=false)
 
template<class G >
std::deque< Pathpgr_dijkstra (G &graph, int64_t source, std::vector< int64_t > targets, bool only_cost=false)
 
template<class G >
std::deque< Pathpgr_dijkstra (G &graph, std::vector< int64_t > sources, int64_t target, bool only_cost=false)
 
template<class G >
std::deque< Pathpgr_dijkstra (G &graph, std::vector< int64_t > sources, std::vector< int64_t > targets, bool only_cost=false)
 
template<class G >
std::deque< Pathpgr_drivingDistance (G &graph, std::vector< int64_t > start_vids, double distance, bool equicost)
 
template<class G >
Path pgr_drivingDistance (G &graph, int64_t source, double distance)
 

Function Documentation

template<class G >
Path pgr_dijkstra ( G &  graph,
int64_t  source,
int64_t  target,
bool  only_cost = false 
)

Definition at line 77 of file pgr_dijkstra.hpp.

References Pgr_dijkstra< G >::dijkstra().

template<class G >
std::deque<Path> pgr_dijkstra ( G &  graph,
int64_t  source,
std::vector< int64_t >  targets,
bool  only_cost = false 
)

Definition at line 89 of file pgr_dijkstra.hpp.

References Pgr_dijkstra< G >::dijkstra().

template<class G >
std::deque<Path> pgr_dijkstra ( G &  graph,
std::vector< int64_t >  sources,
int64_t  target,
bool  only_cost = false 
)

Definition at line 105 of file pgr_dijkstra.hpp.

References Pgr_dijkstra< G >::dijkstra().

template<class G >
std::deque<Path> pgr_dijkstra ( G &  graph,
std::vector< int64_t >  sources,
std::vector< int64_t >  targets,
bool  only_cost = false 
)

Definition at line 122 of file pgr_dijkstra.hpp.

References Pgr_dijkstra< G >::dijkstra().

template<class G >
std::deque<Path> pgr_drivingDistance ( G &  graph,
std::vector< int64_t >  start_vids,
double  distance,
bool  equicost 
)
template<class G >
Path pgr_drivingDistance ( G &  graph,
int64_t  source,
double  distance 
)

Definition at line 65 of file pgr_dijkstra.hpp.

References Pgr_dijkstra< G >::drivingDistance().