Changeset 718:75d36edc6bc4 in lemon-0.x for src/benchmark/graph-bench.cc

Timestamp:

07/21/04 09:03:20 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

Ready to run the first test series.

File:

• src/benchmark/graph-bench.cc (modified) (4 diffs)

src/benchmark/graph-bench.cc

@@ -1 +1 @@
 #include<math.h>
 #include<hugo/list_graph.h>
-#include<hugo/time_measure.h>
-#include<iostream>
 
 #include"bench_tools.h"
@@ -29 +27 @@
   std::vector<Edge> equ(rat);
   
-  unsigned long long int count;
+  long long int count;
   
   for(count=0;count<rat;count++) {
@@ -39 +37 @@
     equ[count%rat]=G.addEdge(nodes[(count*p)%n],nodes[(count*p/n)%n]);
   }
-  std::cout << "Added " << count
-            << " ( " << n << "^2 * " << rat << " ) edges\n";
+//   std::cout << "Added " << count
+//          << " ( " << n << "^2 * " << rat << " ) edges\n";
+
+
   //  for(int i=0;1;i++) ;
 }
@@ -46 +46 @@
 int main()
 {
-  std::cout << "START: n="  << nextPrim(1000) << " rat="
-            << nextPrim(300) << " p=" << nextPrim(100) << '\n';
   hugo::Timer T;
   makeFullGraph<ListGraph>(nextPrim(1000),nextPrim(300),nextPrim(100));
-  std::cout << T  << '\n';
-  std::cout << "START: n="  << nextPrim(1000) << " rat="
-            << nextPrim(300) << " p=" << nextPrim(100) << '\n';
+  
+  PrintTime("BIG",T);
   T.reset();
   makeFullGraph<ListGraph>(nextPrim(100),nextPrim(30000),nextPrim(150));
-  std::cout << T  << '\n';
+
+  PrintTime("SMALL",T);
 }