PGROUTING  2.6
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 <sstream>
#include <functional>
#include <limits>
#include "cpp_common/basePath_SSEC.hpp"
#include "cpp_common/pgr_base_graph.hpp"
Include dependency graph for pgr_dijkstra.hpp:
This graph shows which files directly or indirectly include this file:

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_distance_visitor_no_init
 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_drivingDistance (G &graph, std::vector< int64_t > start_vids, double distance, bool equicost, std::ostringstream &log)
 

Function Documentation

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

Definition at line 75 of file pgr_dijkstra.hpp.

References Pgr_dijkstra< G >::dijkstra().

79  {
80  Pgr_dijkstra< G > fn_dijkstra;
81  return fn_dijkstra.dijkstra(graph, source, target, only_cost);
82 }
Path dijkstra(G &graph, int64_t start_vertex, int64_t end_vertex, bool only_cost=false)
Dijkstra 1 to 1.

Here is the call graph for this function:

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

Definition at line 56 of file pgr_dijkstra.hpp.

References Pgr_dijkstra< G >::drivingDistance().

Referenced by do_pgr_driving_many_to_dist(), and do_pgr_many_withPointsDD().

61  {
62  Pgr_dijkstra< G > fn_dijkstra;
63  return fn_dijkstra.drivingDistance(
64  graph,
65  start_vids,
66  distance,
67  equicost,
68  log);
69 }
Path drivingDistance(G &graph, int64_t start_vertex, double distance)
1 to distance

Here is the call graph for this function:

Here is the caller graph for this function: