COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
07/21/04 09:03:20 (17 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:
1 edited

Legend:

Unmodified
Added
Removed
  • src/benchmark/graph-bench.cc

    r711 r718  
    11#include<math.h>
    22#include<hugo/list_graph.h>
    3 #include<hugo/time_measure.h>
    4 #include<iostream>
    53
    64#include"bench_tools.h"
     
    2927  std::vector<Edge> equ(rat);
    3028 
    31   unsigned long long int count;
     29  long long int count;
    3230 
    3331  for(count=0;count<rat;count++) {
     
    3937    equ[count%rat]=G.addEdge(nodes[(count*p)%n],nodes[(count*p/n)%n]);
    4038  }
    41   std::cout << "Added " << count
    42             << " ( " << n << "^2 * " << rat << " ) edges\n";
     39//   std::cout << "Added " << count
     40//          << " ( " << n << "^2 * " << rat << " ) edges\n";
     41
     42
    4343  //  for(int i=0;1;i++) ;
    4444}
     
    4646int main()
    4747{
    48   std::cout << "START: n="  << nextPrim(1000) << " rat="
    49             << nextPrim(300) << " p=" << nextPrim(100) << '\n';
    5048  hugo::Timer T;
    5149  makeFullGraph<ListGraph>(nextPrim(1000),nextPrim(300),nextPrim(100));
    52   std::cout << T  << '\n';
    53   std::cout << "START: n="  << nextPrim(1000) << " rat="
    54             << nextPrim(300) << " p=" << nextPrim(100) << '\n';
     50 
     51  PrintTime("BIG",T);
    5552  T.reset();
    5653  makeFullGraph<ListGraph>(nextPrim(100),nextPrim(30000),nextPrim(150));
    57   std::cout << T  << '\n';
     54
     55  PrintTime("SMALL",T);
    5856}
Note: See TracChangeset for help on using the changeset viewer.