pgr_dijkstra.hpp File Reference

#include <boost/config.hpp>
#include <boost/graph/adjacency_list.hpp>
#include "c_types/pgr_combination_t.h"
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <deque>
#include <set>
#include <vector>
#include <algorithm>
#include <sstream>
#include <functional>
#include <limits>
#include <map>
#include <numeric>
#include "cpp_common/basePath_SSEC.hpp"
#include "cpp_common/pgr_base_graph.hpp"
#include "cpp_common/interruption.h"
#include "visitors/dijkstra_one_goal_visitor.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	pgrouting::Pgr_dijkstra< G >
class	pgrouting::Pgr_dijkstra< G >
class	pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor
	class for stopping when a distance/cost has being surpassed More...
class	pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init
	class for stopping when a distance/cost has being surpassed More...
class	pgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor
	class for stopping when all targets are found More...

Namespaces
	pgrouting
	Book keeping class for swapping orders between vehicles.

Functions
template<class G >
Path	pgrouting::pgr_dijkstra (G &graph, int64_t source, int64_t target, bool only_cost=false)
template<class G >
std::deque< Path >	pgrouting::pgr_drivingDistance (G &graph, std::vector< int64_t > start_vids, double distance, bool equicost, std::ostringstream &log)