Changeset 729:a9b1c49440f7 in lemon-0.x for src/benchmark

Timestamp:

07/22/04 16:28:00 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@984

Message:

Repeat tests more times.

File:

• src/benchmark/hcube.cc (modified) (4 diffs)

src/benchmark/hcube.cc

@@ -5 +5 @@
 #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"
 
@@ -95 +96 @@
   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();
@@ -116 +117 @@
   {
     Dijkstra<Graph> Dij(G,map);
-    Dij.run(nodes[0]);
+    for(int i=0;i<10;i++)
+      Dij.run(nodes[0]);
   }
   PrintTime("DIJKSTRA",T);
@@ -124 +126 @@
    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);