COIN-OR::LEMON - Graph Library

Changeset 1847:7cbc12e42482 in lemon-0.x for benchmark


Ignore:
Timestamp:
12/05/05 18:03:31 (14 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2408
Message:
  • Changed and improved Timer interface
    • several new member functions
    • reset() -> restart() renaming
    • TimeReport?: a Timer that prints a report on destruction.
  • counter.h: a tool to measure the number of streps of algorithms.
  • New documentation module for time measuring and counting.
Location:
benchmark
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • benchmark/bfs-bench.cc

    r1756 r1847  
    115115//        << dim*(1<<dim) << " edges):";
    116116
    117   T.reset();
     117  T.restart();
    118118  vector<Node> nodes;
    119119  addBiDirHyperCube(G,dim,nodes);
     
    121121  PrintTime("GENGRAPH",T);
    122122
    123   T.reset();
     123  T.restart();
    124124  {
    125125    for(int i=0;i<mul;i++)
     
    127127  }
    128128  PrintTime("BFS-STL",T);
    129   T.reset();
     129  T.restart();
    130130  {
    131131    for(int i=0;i<mul;i++)
     
    133133  }
    134134  PrintTime("BFS-OWN",T);
    135   T.reset();
     135  T.restart();
    136136  {
    137137    for(int i=0;i<mul;i++)
  • benchmark/graph-bench.cc

    r1756 r1847  
    4949 
    5050  PrintTime("BIG",T);
    51   T.reset();
     51  T.restart();
    5252  makeFullGraph<ListGraph>(nextPrim(100),nextPrim(30000),nextPrim(150));
    5353
  • benchmark/hcube.cc

    r1756 r1847  
    5353//        << dim*(1<<dim) << " edges):";
    5454
    55   T.reset();
     55  T.restart();
    5656  vector<Node> nodes;
    5757  addBiDirHyperCube(G,dim,nodes);
     
    5959  PrintTime("GENGRAPH",T);
    6060
    61   T.reset();
     61  T.restart();
    6262  Graph::EdgeMap<int> map(G);
    6363  for(int i=0;i<5;i++) {
     
    8585  PrintTime("GENLENGTHS",T);
    8686
    87   T.reset();
     87  T.restart();
    8888  {
    8989    Dijkstra<Graph> Dij(G,map);
     
    9393  PrintTime("DIJKSTRA",T);
    9494
    95   T.reset();
     95  T.restart();
    9696  {
    9797   Graph::EdgeMap<int> flow(G);
Note: See TracChangeset for help on using the changeset viewer.