22 #ifndef DijkstraRouterTT_h
23 #define DijkstraRouterTT_h
69 template<
class E,
class V,
class PF>
80 for (
size_t i = 0; i < noE; i++) {
126 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 && to != 0);
167 const E*
const minEdge = minimumInfo->
edge;
170 myFound.push_back(minimumInfo);
171 #ifdef DijkstraRouterTT_DEBUG_QUERY
172 std::cout <<
"DEBUG: hit '" << minEdge->getID() <<
"' Q: ";
174 std::cout << (*it)->traveltime <<
"," << (*it)->edge->getID() <<
" ";
182 #ifdef DijkstraRouterTT_DEBUG_QUERY_PERF
183 std::cout <<
"visited " +
toString(num_visited) +
" edges (final path length: " +
toString(into.size()) +
")\n";
191 const unsigned int length_size = minEdge->getNoFollowing();
192 for (i = 0; i < length_size; i++) {
193 const E*
const follower = minEdge->getFollower(i);
196 if (PF::operator()(follower, vehicle)) {
200 if (!followerInfo->
visited && traveltime < oldEffort) {
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";
225 for (
typename std::vector<const E*>::const_iterator i = edges.begin(); i != edges.end(); ++i) {
226 if (PF::operator()(*i, v)) {
237 std::deque<const E*> tmp;
238 while (rbegin != 0) {
239 tmp.push_front((E*) rbegin->
edge);
240 rbegin = rbegin->
prev;
242 std::copy(tmp.begin(), tmp.end(), std::back_inserter(edges));
261 template<
class E,
class V,
class PF,
class EC>
286 template<
class E,
class V,
class PF>