Revision 35f4da42
src/sim/cheuristic.cc | ||
---|---|---|
27 | 27 |
#include "cheuristic.h" |
28 | 28 |
#include "eventset.h" |
29 | 29 |
|
30 |
#define MAX_IT 1000000 |
|
31 |
|
|
30 | 32 |
EventSet::iterator::iterator(const EventSet::iterator& b) : |
31 | 33 |
index(index), |
32 | 34 |
s(s) |
... | ... | |
137 | 139 |
bool bfs(double threshold, int moduleId) |
138 | 140 |
{ |
139 | 141 |
nodeSet_t::iterator it; |
140 |
while((it=bfsVisitList.begin()) != bfsVisitList.end())
|
|
142 |
for(int i=0; i<MAX_IT && (it=bfsVisitList.begin()) != bfsVisitList.end(); i++)
|
|
141 | 143 |
{ |
142 |
std::cout << "bfsVisitList.size()=" << bfsVisitList.size() << std::endl; |
|
143 | 144 |
cNode* node=*it; |
144 | 145 |
bfsVisitList.erase(it); |
145 | 146 |
if(node->isConflicting()) |
Also available in: Unified diff