src/algorithm.cpp

@@ -54,20 +54,9 @@ void Graph::PrintGraph(void) {
 }
 
 void PrintSolution(std::vector<Vertex*> solution) {
-    int cost = 0;
     std::cout << "Path: ";
-    Vertex* lastVertex = solution.front();
-    for (Vertex* i : solution) { 
-        std::cout << i->nodeNumber << ' '; 
-        for (Edge j : lastVertex->edges) {
-            if (j.destination->nodeNumber == i->nodeNumber) {
-                cost += j.weight;
-            }
-        }
-        lastVertex = i;
-    }
+    for (Vertex* i : solution) { std::cout << i->nodeNumber << ' '; }
     std::cout << std::endl;
-    std::cout << "Cost: " << cost << std::endl;
 }
 
 void UCBFS(Graph graph, int start) {

times.txt

@@ -1,12 +0,0 @@
-BFS:
-- 10: 0.052015
-- 20: 0.05767
-- 100: 0.123823
-DFS:
-- 10: 0.02199
-- 20: 0.034288
-- 100: 0.092118
-UCBFS:
-- 10: 0.141568
-- 20: 0.288738
-- 100: 1.31126