47 #ifdef CHECK_MEMORY_LEAKS
49 #endif // CHECK_MEMORY_LEAKS
62 const std::vector<int>& connectors,
63 const std::vector<int>& disturbances,
65 : myID(id), myNodeID(nodeid), myTLID(tlid),
66 myConnectors(connectors), myDisturbances(disturbances),
67 myNBNode(0), myAmEdgeSplit(amEdgeSplitOnly) {}
77 DictType::iterator i =
myDict.find(
id);
89 const std::vector<int>& connectors,
90 const std::vector<int>& disturbances,
91 bool amEdgeSplitOnly) {
97 nodeid, tlid, connectors, disturbances, amEdgeSplitOnly);
105 DictType::iterator i =
myDict.find(
id);
124 return toString<int>(
myID);
126 return toString<int>(
myID) +
"LSA " + toString<int>(
myTLID);
139 std::vector<int>::iterator i, j;
161 if (crossings.
size() == 0) {
193 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
194 (*i).second->buildNBNode(nc);
209 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
215 if (ret != -1 && (*i).first != ret) {
231 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
237 if (ret != -1 && ret != (*i).first) {
253 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
255 into << endl << c->
myID <<
":";
263 into <<
"=======================" << endl;
283 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
284 const std::vector<int>& disturbances = (*i).second->myDisturbances;
286 for (std::vector<int>::const_iterator j = disturbances.begin(); j != disturbances.end(); j++) {
288 disturbance->
addToNode(node, dc, nc, ec);
297 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {