PGROUTING  2.6-dev
Pgr_dijkstra< G > Member List

This is the complete list of members for Pgr_dijkstra< G >, including all inherited members.

clear()Pgr_dijkstra< G >inlineprivate
dijkstra(G &graph, int64_t start_vertex, int64_t end_vertex, bool only_cost=false)Pgr_dijkstra< G >inline
dijkstra(G &graph, int64_t start_vertex, const std::vector< int64_t > &end_vertex, bool only_cost)Pgr_dijkstra< G >inline
dijkstra(G &graph, const std::vector< int64_t > &start_vertex, int64_t end_vertex, bool only_cost)Pgr_dijkstra< G >inline
dijkstra(G &graph, const std::vector< int64_t > &start_vertex, const std::vector< int64_t > &end_vertex, bool only_cost)Pgr_dijkstra< G >inline
dijkstra_1_to_1(G &graph, V source, V target)Pgr_dijkstra< G >inlineprivate
dijkstra_1_to_distance(G &graph, V source, double distance)Pgr_dijkstra< G >inlineprivate
dijkstra_1_to_distance_no_init(G &graph, V source, double distance)Pgr_dijkstra< G >inlineprivate
dijkstra_1_to_many(G &graph, V source, const std::vector< V > &targets)Pgr_dijkstra< G >inlineprivate
distancesPgr_dijkstra< G >private
drivingDistance(G &graph, int64_t start_vertex, double distance)Pgr_dijkstra< G >inline
drivingDistance(G &graph, const std::vector< int64_t > start_vertex, double distance, bool equicost, std::ostringstream &the_log)Pgr_dijkstra< G >inline
drivingDistance_no_equicost(G &graph, const std::vector< int64_t > start_vertex, double distance)Pgr_dijkstra< G >inlineprivate
drivingDistance_with_equicost(G &graph, const std::vector< int64_t > start_vertex, double distance)Pgr_dijkstra< G >inlineprivate
E typedefPgr_dijkstra< G >
execute_drivingDistance(G &graph, int64_t start_vertex, double distance)Pgr_dijkstra< G >inlineprivate
execute_drivingDistance_no_init(G &graph, V start_vertex, double distance)Pgr_dijkstra< G >inlineprivate
get_drivingDistance_with_equicost_paths(G &graph, const std::vector< int64_t > &start_vertex, std::deque< std::vector< V > > &pred, double distance)Pgr_dijkstra< G >inlineprivate
get_paths(const G &graph, V source, std::vector< V > &targets, bool only_cost) const Pgr_dijkstra< G >inlineprivate
logPgr_dijkstra< G >private
nodesInDistancePgr_dijkstra< G >private
predecessorsPgr_dijkstra< G >private
V typedefPgr_dijkstra< G >