|
|
@@ -613,7 +613,9 @@ void Graph::travellingSalesmanTabuSearchEngine(Graph &graph, unsigned tabuSteps,
|
|
613
|
613
|
globalOptimumLength = nextRouteLength;
|
|
614
|
614
|
globalOptimum = nextRoute;
|
|
615
|
615
|
|
|
616
|
|
- std::cout << "Nowa najlepsza trasa: " << globalOptimumLength << std::endl;
|
|
|
616
|
+ onboardClock.stop();
|
|
|
617
|
+ std::cout << "Nowa najlepsza trasa: " << globalOptimumLength;
|
|
|
618
|
+ std::cout << " (w czasie " << onboardClock.read() << " s)" << std::endl;
|
|
617
|
619
|
}
|
|
618
|
620
|
globalOptimumMutex.unlock();
|
|
619
|
621
|
|