39 #ifdef CHECK_MEMORY_LEAKS
41 #endif // CHECK_MEMORY_LEAKS
53 if (from == edges.end()) {
61 if (from == edges.begin()) {
62 from = edges.end() - 1;
71 for (std::vector<bool>::const_iterator i = v.begin(); i != v.end(); i++) {
81 for (EdgeVector::const_iterator i = edges.begin(); i != edges.end(); i++) {
82 if ((*i)->getToNode() == to && (*i)->getFromNode() == from) {
93 assert(ev.size() > 0);
95 for (EdgeVector::const_iterator i = ev.begin() + 1; i != ev.end(); i++) {
97 max > (*i)->getSpeed()
98 ? max : (*i)->getSpeed();
115 return std::find(incoming.begin(), incoming.end(), myEdge) != incoming.end();
130 return std::find(outgoing.begin(), outgoing.end(), myEdge) != outgoing.end();
139 : myDestinationNode(dest) {}
144 return e->
getToNode() == myDestinationNode;
152 if (e1 == 0 || e2 == 0) {
161 while (fabs(relAngle1 - relAngle2) < 3.0) {
167 referencePos1.
x(), referencePos1.
y()));
170 referencePos2.
x(), referencePos2.
y()));
176 return relAngle1 > relAngle2;
185 if (e1 == 0 || e2 == 0) {
194 while (fabs(relAngle1 - relAngle2) < 3.0) {
199 referencePos1.
x(), referencePos1.
y(),
202 referencePos2.
x(), referencePos2.
y(),
209 return relAngle1 > relAngle2;
215 for (EdgeVector::const_iterator i = ev.begin(); i != ev.end(); i++) {
216 if (i != ev.begin()) {
229 if (edges.size() == 0) {
232 SUMOReal ret = (*(edges.begin()))->getSpeed();
233 for (EdgeVector::const_iterator i = edges.begin() + 1; i != edges.end(); i++) {
234 if ((*i)->getSpeed() > ret) {
235 ret = (*i)->getSpeed();
244 if (edges.size() == 0) {
247 SUMOReal ret = (*(edges.begin()))->getSpeed();
248 for (EdgeVector::const_iterator i = edges.begin() + 1; i != edges.end(); i++) {
249 if ((*i)->getSpeed() < ret) {
250 ret = (*i)->getSpeed();