22 #ifndef DijkstraRouterTT_h
23 #define DijkstraRouterTT_h
70 template<
class E,
class V,
class PF>
79 for (
size_t i = 0; i < noE; i++) {
129 return nod1->
edge->getNumericalID() > nod2->
edge->getNumericalID();
141 for (
typename std::vector<EdgeInfo*>::iterator i =
myFound.begin(); i !=
myFound.end(); i++) {
150 virtual void compute(
const E* from,
const E* to,
const V*
const vehicle,
151 SUMOTime msTime, std::vector<const E*>& into) {
152 assert(from != 0 && (vehicle == 0 || to != 0));
158 EdgeInfo*
const fromInfo = &(
myEdgeInfos[from->getNumericalID()]);
159 fromInfo->traveltime = 0;
168 const E*
const minEdge = minimumInfo->edge;
171 myFound.push_back(minimumInfo);
172 #ifdef DijkstraRouterTT_DEBUG_QUERY
173 std::cout <<
"DEBUG: hit '" << minEdge->getID() <<
"' TT: " << minimumInfo->traveltime <<
" Q: ";
175 std::cout << (*it)->traveltime <<
"," << (*it)->edge->getID() <<
" ";
183 #ifdef DijkstraRouterTT_DEBUG_QUERY_PERF
184 std::cout <<
"visited " +
toString(num_visited) +
" edges (final path length: " +
toString(into.size()) +
")\n";
188 minimumInfo->visited =
true;
189 const SUMOReal traveltime = minimumInfo->traveltime + this->
getEffort(minEdge, vehicle, time + minimumInfo->traveltime);
191 const std::vector<E*>& successors = minEdge->getSuccessors(vClass);
192 for (
typename std::vector<E*>::const_iterator it = successors.begin(); it != successors.end(); ++it) {
193 const E*
const follower = *it;
194 EdgeInfo*
const followerInfo = &(
myEdgeInfos[follower->getNumericalID()]);
196 if (PF::operator()(follower, vehicle)) {
199 const SUMOReal oldEffort = followerInfo->traveltime;
200 if (!followerInfo->visited && traveltime < oldEffort) {
201 followerInfo->traveltime = traveltime;
202 followerInfo->prev = minimumInfo;
215 #ifdef DijkstraRouterTT_DEBUG_QUERY_PERF
216 std::cout <<
"visited " +
toString(num_visited) +
" edges (final path length: " +
toString(into.size()) +
")\n";
227 for (
typename std::vector<const E*>::const_iterator i = edges.begin(); i != edges.end(); ++i) {
228 if (PF::operator()(*i, v)) {
231 costs += this->
getEffort(*i, v, time + costs);
239 std::deque<const E*> tmp;
240 while (rbegin != 0) {
241 tmp.push_front((E*) rbegin->edge);
242 rbegin = rbegin->prev;
244 std::copy(tmp.begin(), tmp.end(), std::back_inserter(edges));
static MsgHandler * getWarningInstance()
Returns the instance to add warnings to.
EdgeInfo(size_t id)
Constructor.
virtual ~DijkstraRouterTT()
Destructor.
SUMOReal recomputeCosts(const std::vector< const E * > &edges, const V *const v, SUMOTime msTime) const
bool visited
The previous edge.
virtual void compute(const E *from, const E *to, const V *const vehicle, SUMOTime msTime, std::vector< const E * > &into)
Builds the route between the given edges using the minimum effort at the given time The definition of...
void buildPathFrom(EdgeInfo *rbegin, std::vector< const E * > &edges)
Builds the path from marked edges.
SUMOVehicleClass
Definition of vehicle classes to differ between different lane usage and authority types...
const E * edge
The current edge.
const EdgeInfo & getEdgeInfo(size_t index) const
Computes the shortest path through a network using the Dijkstra algorithm.
SUMOReal traveltime
Effort to reach the edge.
bool operator()(const EdgeInfo *nod1, const EdgeInfo *nod2) const
Comparing method.
MsgHandler *const myErrorMsgHandler
the handler for routing errors
EdgeInfoByTTComparator myComparator
SUMOReal(* Operation)(const E *const, const V *const, SUMOReal)
Operation myOperation
The object's operation to perform.
std::string toString(const T &t, std::streamsize accuracy=OUTPUT_ACCURACY)
std::vector< EdgeInfo * > myFound
list of visited Edges (for resetting)
std::vector< EdgeInfo > myEdgeInfos
The container of edge information.
virtual SUMOAbstractRouter< E, V > * clone() const
void inform(std::string msg, bool addType=true)
adds a new error to the list
std::vector< EdgeInfo * > myFrontierList
A container for reusage of the min edge heap.
void endQuery(int visits)
EdgeInfo * prev
The previous edge.
DijkstraRouterTT(size_t noE, bool unbuildIsWarning, Operation operation)
Constructor.
SUMOReal getEffort(const E *const e, const V *const v, SUMOReal t) const
vehicles ignoring classes