59 #ifdef CHECK_MEMORY_LEAKS
61 #endif // CHECK_MEMORY_LEAKS
80 NodeCont::iterator i =
myNodes.find(
id);
92 NodeCont::iterator i =
myNodes.find(
id);
104 std::pair<SUMOReal, SUMOReal> ret(-1.0, -1.0);
105 NodeCont::iterator i =
myNodes.find(
id);
107 return (*i).second->getPosition();
118 std::string
id = node->
getID();
119 NodeCont::iterator i =
myNodes.find(
id);
130 NodeCont::const_iterator i =
myNodes.find(
id);
140 for (NodeCont::const_iterator i =
myNodes.begin(); i !=
myNodes.end(); i++) {
141 NBNode* node = (*i).second;
182 for (NodeCont::iterator i =
myNodes.begin(); i !=
myNodes.end(); i++) {
183 no += (*i).second->removeSelfLoops(dc, ec, tc);
197 for (NodeCont::iterator i =
myNodes.begin(); i !=
myNodes.end(); i++) {
199 std::map<NBNode*, EdgeVector> connectionCount;
200 const EdgeVector& outgoing = (*i).second->getOutgoingEdges();
201 for (EdgeVector::const_iterator j = outgoing.begin(); j != outgoing.end(); j++) {
204 if (connectionCount.find(connected) == connectionCount.end()) {
207 connectionCount[connected].push_back(e);
210 std::map<NBNode*, EdgeVector>::iterator k;
211 for (k = connectionCount.begin(); k != connectionCount.end(); k++) {
213 if ((*k).second.size() < 2) {
219 const NBEdge*
const first = ev.front();
220 EdgeVector::const_iterator jci;
221 for (jci = ev.begin() + 1; jci != ev.end(); ++jci) {
224 (relativeLengthDifference > lengthThreshold) ||
225 (first->
getSpeed() != (*jci)->getSpeed())
233 if (jci == ev.end()) {
246 const std::vector<std::string>& edgeNames = ec.
getAllNames();
247 for (std::vector<std::string>::const_iterator it = edgeNames.begin(); it != edgeNames.end(); ++it) {
256 if (outgoingEdges.size() != 1) {
261 if (incomingEdges.size() > 1) {
264 }
else if (incomingEdges.size() == 1) {
265 NBNode* fromNodeOfIncomingEdge = incomingEdges[0]->getFromNode();
266 NBNode* toNodeOfOutgoingEdge = outgoingEdges[0]->getToNode();
267 if (fromNodeOfIncomingEdge != toNodeOfOutgoingEdge) {
275 bool hasJunction =
false;
279 std::set<NBNode*> adjacentNodes;
287 adjacentNodes.clear();
288 for (EdgeVector::const_iterator itOfOutgoings = outgoingEdgesOfToNode.begin(); itOfOutgoings != outgoingEdgesOfToNode.end(); ++itOfOutgoings) {
289 if ((*itOfOutgoings)->getToNode() != from
290 && (*itOfOutgoings)->getToNode() != to
294 adjacentNodes.insert((*itOfOutgoings)->getToNode());
296 for (EdgeVector::const_iterator itOfIncomings = incomingEdgesOfToNode.begin(); itOfIncomings != incomingEdgesOfToNode.end(); ++itOfIncomings) {
297 adjacentNodes.insert((*itOfIncomings)->getFromNode());
299 adjacentNodes.erase(to);
300 if (adjacentNodes.size() > 2) {
303 }
while (!hasJunction && eOld != e);
305 edgeCounter +=
int(road.size());
306 std::string warningString =
"Removed a road without junctions: ";
307 for (EdgeVector::iterator roadIt = road.begin(); roadIt != road.end(); ++roadIt) {
308 if (roadIt == road.begin()) {
309 warningString += (*roadIt)->getID();
311 warningString +=
", " + (*roadIt)->getID();
314 NBNode* fromNode = (*roadIt)->getFromNode();
315 NBNode* toNode = (*roadIt)->getToNode();
316 ec.
erase(dc, *roadIt);
330 WRITE_WARNING(
"Detected isolated roads. Use the option --remove-edges.isolated to get a list of all affected edges.");
338 bool removeGeometryNodes) {
340 std::vector<NBNode*> toRemove;
341 for (NodeCont::iterator i =
myNodes.begin(); i !=
myNodes.end(); i++) {
342 NBNode* current = (*i).second;
344 std::vector<std::pair<NBEdge*, NBEdge*> > toJoin;
351 if (removeGeometryNodes) {
367 for (std::vector<std::pair<NBEdge*, NBEdge*> >::iterator j = toJoin.begin(); j != toJoin.end(); j++) {
369 NBEdge* continuation = (*j).second;
370 begin->
append(continuation);
374 ec.
erase(dc, continuation);
376 toRemove.push_back(current);
380 for (std::vector<NBNode*>::iterator j = toRemove.begin(); j != toRemove.end(); ++j) {
390 std::set<NBNode*> visited;
391 for (NodeCont::const_iterator i =
myNodes.begin(); i !=
myNodes.end(); i++) {
392 std::vector<NBNode*> toProc;
393 if (visited.find((*i).second) != visited.end()) {
396 toProc.push_back((*i).second);
398 while (!toProc.empty()) {
399 NBNode* n = toProc.back();
401 if (visited.find(n) != visited.end()) {
407 for (EdgeVector::const_iterator j = edges.begin(); j != edges.end(); ++j) {
415 if (visited.find(s) != visited.end()) {
433 for (std::vector<std::string>::const_iterator it = ids.begin(); it != ids.end(); it++) {
437 WRITE_WARNING(
"Ignoring join exclusion for node '" + *it +
"' since it already occured in a list of nodes to be joined");
438 }
else if (check &&
retrieve(*it) == 0) {
439 WRITE_WARNING(
"Ignoring join exclusion for unknown node '" + *it +
"'");
450 for (std::set<std::string>::const_iterator it = cluster.begin(); it != cluster.end(); it++) {
452 WRITE_WARNING(
"Ignoring join-cluster because node '" + *it +
"' was already excluded from joining");
454 }
else if (
myJoined.count(*it) > 0) {
455 WRITE_WARNING(
"Ignoring join-cluster because node '" + *it +
"' already occured in another join-cluster");
470 std::set<NBNode*> cluster;
471 for (std::set<std::string>::iterator it_id = it->begin(); it_id != it->end(); it_id++) {
474 WRITE_WARNING(
"Ignoring unknown node '" + *it_id +
"' while joining");
476 cluster.insert(node);
479 if (cluster.size() > 1) {
480 clusters.push_back(cluster);
485 return (
int)clusters.size();
494 for (NodeClusters::iterator i = cands.begin(); i != cands.end(); ++i) {
495 std::set<NBNode*> cluster = (*i);
497 for (std::set<NBNode*>::iterator j = cluster.begin(); j != cluster.end();) {
498 std::set<NBNode*>::iterator check = j;
501 cluster.erase(check);
505 bool pruneFringe =
true;
506 while (pruneFringe) {
508 for (std::set<NBNode*>::iterator j = cluster.begin(); j != cluster.end();) {
509 std::set<NBNode*>::iterator check = j;
520 cluster.erase(check);
525 if (cluster.size() > 1) {
526 clusters.push_back(cluster);
530 return (
int)clusters.size();
537 for (NodeClusters::iterator i = clusters.begin(); i != clusters.end(); ++i) {
538 std::set<NBNode*> cluster = *i;
539 assert(cluster.size() > 1);
555 throw ProcessError(
"Could not allocate tls '" +
id +
"'.");
559 std::set<NBEdge*> allEdges;
560 for (std::set<NBNode*>::const_iterator j = cluster.begin(); j != cluster.end(); ++j) {
561 const std::vector<NBEdge*>& edges = (*j)->getEdges();
562 allEdges.insert(edges.begin(), edges.end());
566 for (std::set<NBEdge*>::iterator j = allEdges.begin(); j != allEdges.end();) {
570 if (cluster.count(from) > 0 && cluster.count(to) > 0) {
571 for (std::set<NBEdge*>::iterator l = allEdges.begin(); l != allEdges.end(); ++l) {
584 for (std::set<NBEdge*>::iterator j = allEdges.begin(); j != allEdges.end(); ++j) {
587 const bool outgoing = cluster.count(e->
getFromNode()) > 0;
593 for (std::vector<NBEdge::Connection>::iterator k = conns.begin(); k != conns.end(); ++k) {
604 std::set<std::string> ids;
605 for (std::set<NBNode*>::const_iterator j = cluster.begin(); j != cluster.end(); j++) {
606 ids.insert((*j)->getID());
616 std::vector<std::string> member_ids;
617 for (std::set<NBNode*>::const_iterator j = cluster.begin(); j != cluster.end(); j++) {
618 member_ids.push_back((*j)->getID());
619 pos.
add((*j)->getPosition());
621 if ((*j)->isTLControlled()) {
625 pos.
mul(1.0 / cluster.size());
627 sort(member_ids.begin(), member_ids.end());
628 for (std::vector<std::string>::iterator j = member_ids.begin(); j != member_ids.end(); j++) {
629 id =
id +
"_" + (*j);
637 unsigned int noIncoming = 0;
638 unsigned int noOutgoing = 0;
639 bool tooFast =
false;
641 std::set<NBEdge*> seen;
642 for (std::set<NBNode*>::const_iterator j = c.begin(); j != c.end(); ++j) {
644 for (EdgeVector::const_iterator k = edges.begin(); k != edges.end(); ++k) {
645 if (c.find((*k)->getFromNode()) != c.end() && c.find((*k)->getToNode()) != c.end()) {
648 if ((*j)->hasIncoming(*k)) {
650 f += (
SUMOReal)(*k)->getNumLanes() * (*k)->getLaneSpeed(0);
654 if ((*k)->getLaneSpeed(0) * 3.6 > 79) {
659 return !tooFast && f >= 150. / 3.6 && c.size() != 0;
666 std::vector<NBNode*> ncontrolled;
667 if (oc.
isSet(
"tls.unset")) {
668 std::vector<std::string> notTLControlledNodes = oc.
getStringVector(
"tls.unset");
669 for (std::vector<std::string>::const_iterator i = notTLControlledNodes.begin(); i != notTLControlledNodes.end(); ++i) {
672 throw ProcessError(
" The node '" + *i +
"' to set as not-controlled is not known.");
675 for (std::set<NBTrafficLightDefinition*>::const_iterator j = tls.begin(); j != tls.end(); ++j) {
679 ncontrolled.push_back(n);
685 if (oc.
exists(
"tls.taz-nodes") && oc.
getBool(
"tls.taz-nodes")) {
686 for (NodeCont::iterator i =
myNodes.begin(); i !=
myNodes.end(); i++) {
687 NBNode* cur = (*i).second;
688 if (cur->
isNearDistrict() && find(ncontrolled.begin(), ncontrolled.end(), cur) == ncontrolled.end()) {
695 if (!oc.
getBool(
"tls.guess")) {
702 std::vector<std::set<NBNode*> > cands;
705 for (std::vector<std::set<NBNode*> >::iterator i = cands.begin(); i != cands.end();) {
706 std::set<NBNode*>& c = (*i);
709 for (std::set<NBNode*>::iterator j = c.begin(); j != c.end();) {
710 if ((*j)->isTLControlled() || find(ncontrolled.begin(), ncontrolled.end(), *j) != ncontrolled.end()) {
724 unsigned int index = 0;
725 for (std::vector<std::set<NBNode*> >::iterator i = cands.begin(); i != cands.end(); ++i) {
726 std::vector<NBNode*> nodes;
727 for (std::set<NBNode*>::iterator j = (*i).begin(); j != (*i).end(); j++) {
730 std::string
id =
"joinedG_" +
toString(index++);
742 for (NodeCont::iterator i =
myNodes.begin(); i !=
myNodes.end(); i++) {
743 NBNode* cur = (*i).second;
749 if (find(ncontrolled.begin(), ncontrolled.end(), cur) != ncontrolled.end()) {
764 std::vector<std::set<NBNode*> > cands;
766 unsigned int index = 0;
767 for (std::vector<std::set<NBNode*> >::iterator i = cands.begin(); i != cands.end(); ++i) {
768 std::set<NBNode*>& c = (*i);
769 for (std::set<NBNode*>::iterator j = c.begin(); j != c.end();) {
770 if (!(*j)->isTLControlled()) {
779 for (std::set<NBNode*>::iterator j = c.begin(); j != c.end(); ++j) {
780 std::set<NBTrafficLightDefinition*> tls = (*j)->getControllingTLS();
781 (*j)->removeTrafficLights();
782 for (std::set<NBTrafficLightDefinition*>::iterator k = tls.begin(); k != tls.end(); ++k) {
786 std::string
id =
"joinedS_" +
toString(index++);
787 std::vector<NBNode*> nodes;
788 for (std::set<NBNode*>::iterator j = c.begin(); j != c.end(); j++) {
810 WRITE_WARNING(
"Building a tl-logic for node '" +
id +
"' twice is not possible.");
820 for (NodeCont::iterator i =
myNodes.begin(); i !=
myNodes.end(); i++) {
821 (*i).second->computeLanes2Lanes();
829 for (NodeCont::iterator i =
myNodes.begin(); i !=
myNodes.end(); i++) {
830 (*i).second->computeLogic(ec, oc);
837 for (NodeCont::iterator i =
myNodes.begin(); i !=
myNodes.end(); i++) {
851 std::string ret =
"SUMOGenerated" + toString<int>(
size());
859 for (NodeCont::iterator i =
myNodes.begin(); i !=
myNodes.end(); i++) {
860 (*i).second->computeNodeShape(leftHand);
867 int numUnregulatedJunctions = 0;
868 int numDeadEndJunctions = 0;
869 int numPriorityJunctions = 0;
870 int numRightBeforeLeftJunctions = 0;
871 for (NodeCont::const_iterator i =
myNodes.begin(); i !=
myNodes.end(); i++) {
872 switch ((*i).second->getType()) {
874 ++numUnregulatedJunctions;
877 ++numDeadEndJunctions;
881 ++numPriorityJunctions;
884 ++numRightBeforeLeftJunctions;
887 ++numRightBeforeLeftJunctions;
897 if (numDeadEndJunctions > 0) {
905 std::vector<std::string>
907 std::vector<std::string> ret;
908 for (NodeCont::const_iterator i =
myNodes.begin(); i !=
myNodes.end(); ++i) {
909 ret.push_back((*i).first);
917 if (
myNodes.count(newID) != 0) {
918 throw ProcessError(
"Attempt to rename node using existing id '" + newID +
"'");