 |
Eclipse SUMO - Simulation of Urban MObility
|
Go to the documentation of this file.
18 #ifndef CHRouterWrapper_h
19 #define CHRouterWrapper_h
62 template<
class E,
class V>
70 SUMOAbstractRouter<E, V>(
"CHRouterWrapper", ignoreErrors, operation, nullptr, false, false),
89 clone->myRouters[item.first] = static_cast<CHRouterType*>(item.second->clone());
95 bool compute(
const E* from,
const E* to,
const V*
const vehicle,
96 SUMOTime msTime, std::vector<const E*>& into,
bool silent =
false) {
97 const std::pair<const SUMOVehicleClass, const double> svc = std::make_pair(vehicle->getVClass(), vehicle->getMaxSpeed());
104 return myRouters[svc]->compute(from, to, vehicle, msTime, into, silent);
CHRouterWrapper(const std::vector< E * > &edges, const bool ignoreErrors, typename SUMOAbstractRouter< E, V >::Operation operation, const SUMOTime begin, const SUMOTime end, const SUMOTime weightPeriod, const int numThreads)
Constructor.
CHRouter< E, V > CHRouterType
bool compute(const E *from, const E *to, const V *const vehicle, SUMOTime msTime, std::vector< const E * > &into, bool silent=false)
Builds the route between the given edges using the minimum effort at the given time The definition of...
Operation myOperation
The object's operation to perform.
std::map< std::pair< const SUMOVehicleClass, const double >, CHRouterType * > RouterMap
Computes the shortest path through a contracted network.
const std::vector< E * > & myEdges
all edges with numerical ids
virtual SUMOAbstractRouter< E, V > * clone()
Computes the shortest path through a contracted network.
const int myMaxNumInstances
const bool myIgnoreErrors
const SUMOTime myWeightPeriod