@@ -517,7 +517,9 @@ void Graph::travellingSalesmanTabuSearchEngine(Graph &graph, unsigned tabuSteps,
while(cheeseSupplied == true)
{
- std::vector<unsigned> nextRoute;
+ std::vector<unsigned> nextRoute = currentRoute;
+ // ...na wszelki wypadek, gdyby cale sasiedztwo bylo na liscie tabu
+ // (zeby algorytm sie nie wywalil)
int nextRouteLength = -1;
std::vector<unsigned> nextTabu(3, 0);