[Lemon-commits] [lemon_svn] alpar: r984 - hugo/trunk/src/benchmark

[Lemon SVN]

Author: alpar
Date: Thu Jul 22 16:28:00 2004
New Revision: 984

Modified:
   hugo/trunk/src/benchmark/hcube.cc

Log:
Repeat tests more times.


Modified: hugo/trunk/src/benchmark/hcube.cc
==============================================================================
--- hugo/trunk/src/benchmark/hcube.cc	(original)
+++ hugo/trunk/src/benchmark/hcube.cc	Thu Jul 22 16:28:00 2004
@@ -4,7 +4,8 @@
 #include<hugo/list_graph.h>
 #include<hugo/smart_graph.h>
 #include<hugo/dijkstra.h>
-#include<../work/jacint/max_flow_no_stack.h>
+#include<hugo/max_flow.h>
+
 #include"bench_tools.h"
 
 using namespace std;
@@ -94,7 +95,7 @@
 
   T.reset();
   Graph::EdgeMap<int> map(G);
-  {
+  for(int i=0;i<5;i++) {
     Primes P;
     for(int i=0;i<dim*(1<<dim);i++) P();
     
@@ -115,7 +116,8 @@
   T.reset();
   {
     Dijkstra<Graph> Dij(G,map);
-    Dij.run(nodes[0]);
+    for(int i=0;i<10;i++)
+      Dij.run(nodes[0]);
   }
   PrintTime("DIJKSTRA",T);
 
@@ -123,8 +125,9 @@
   {
    Graph::EdgeMap<int> flow(G);
    
-    MaxFlowNoStack<Graph,int> MF(G,nodes[0],nodes[1<<dim-1],map,flow);
-    MF.run(MF.NO_FLOW);
+    MaxFlow<Graph,int> MF(G,nodes[0],nodes[1<<dim-1],map,flow);
+    for(int i=0;i<10;i++)
+      MF.run(MF.NO_FLOW);
   }
   PrintTime("PREFLOW",T);