47 #ifdef CHECK_MEMORY_LEAKS
49 #endif // CHECK_MEMORY_LEAKS
63 const std::vector<int>& connectors,
64 const std::vector<int>& disturbances,
66 : myID(id), myNodeID(nodeid), myTLID(tlid),
67 myConnectors(connectors), myDisturbances(disturbances),
68 myNBNode(0), myAmEdgeSplit(amEdgeSplitOnly) {}
78 DictType::iterator i =
myDict.find(
id);
90 const std::vector<int>& connectors,
91 const std::vector<int>& disturbances,
92 bool amEdgeSplitOnly) {
98 nodeid, tlid, connectors, disturbances, amEdgeSplitOnly);
106 DictType::iterator i =
myDict.find(
id);
125 return toString<int>(
myID);
127 return toString<int>(
myID) +
"LSA " + toString<int>(
myTLID);
140 std::vector<int>::iterator i, j;
162 if (crossings.size() == 0) {
194 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
195 (*i).second->buildNBNode(nc);
210 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
216 if (ret != -1 && (*i).first != ret) {
232 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
238 if (ret != -1 && ret != (*i).first) {
254 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
256 into << std::endl << c->
myID <<
":";
264 into <<
"=======================" << std::endl;
284 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {
285 const std::vector<int>& disturbances = (*i).second->myDisturbances;
287 for (std::vector<int>::const_iterator j = disturbances.begin(); j != disturbances.end(); j++) {
289 disturbance->
addToNode(node, dc, nc, ec);
298 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); i++) {