rout_new.push_back(rout_old[i]);
} else {
for (long int j = 0; j < graph[rout_old[i].back()].size(); j++) {
- bool flag2 = true, flag22 = true;;
+ bool flag2 = true, flag22 = true;
flag3 = rout_old[i];
for (int f = 0; f < flag3.size(); f++) {
if (flag3[f] == graph[rout_old[i].back()][j]) {
}
}
if (rout_new.size() != 0) {
+ std::cout << rout_old.size() << " -> " << rout_new.size() << "\n";
rout_old = rout_new;
rout_new.resize(0);
- std::cout << rout_old.size() << "\n";
+
}
}