40 #ifdef CHECK_MEMORY_LEAKS
42 #endif // CHECK_MEMORY_LEAKS
60 std::map<int, SUMOReal>::iterator i;
107 NGEdgeList::iterator li;
111 if ((*li)->getStartNode() == node) {
112 ni = (*li)->getEndNode();
114 ni = (*li)->getStartNode();
120 NGEdgeList::iterator lj;
123 if ((*lj)->getStartNode() == node) {
124 ni = (*lj)->getEndNode();
126 ni = (*lj)->getStartNode();
145 bool connectable =
true;
167 NGEdgeList::iterator li;
169 while ((connectable ==
true) && (li !=
myOuterLinks.end())) {
171 Position p1((*li)->getStartNode()->getPosition());
172 Position p2((*li)->getEndNode()->getPosition());
173 if ((baseNode != (*li)->getStartNode()) && (baseNode != (*li)->getEndNode())
174 && (newNode != (*li)->getStartNode()) && (newNode != (*li)->getEndNode())) {
180 (newNode != (*li)->getStartNode()) && (newNode != (*li)->getEndNode())) {
196 NGNodeList::iterator ni;
201 ((on)->getMaxNeighbours() > (on)->LinkList.size())) {