COIN-OR::LEMON - Graph Library

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


Ignore:
Timestamp:
07/22/04 16:28:00 (16 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:
1 edited

Legend:

Unmodified
Added
Removed
  • src/benchmark/hcube.cc

    r718 r729  
    55#include<hugo/smart_graph.h>
    66#include<hugo/dijkstra.h>
    7 #include<../work/jacint/max_flow_no_stack.h>
     7#include<hugo/max_flow.h>
     8
    89#include"bench_tools.h"
    910
     
    9596  T.reset();
    9697  Graph::EdgeMap<int> map(G);
    97   {
     98  for(int i=0;i<5;i++) {
    9899    Primes P;
    99100    for(int i=0;i<dim*(1<<dim);i++) P();
     
    116117  {
    117118    Dijkstra<Graph> Dij(G,map);
    118     Dij.run(nodes[0]);
     119    for(int i=0;i<10;i++)
     120      Dij.run(nodes[0]);
    119121  }
    120122  PrintTime("DIJKSTRA",T);
     
    124126   Graph::EdgeMap<int> flow(G);
    125127   
    126     MaxFlowNoStack<Graph,int> MF(G,nodes[0],nodes[1<<dim-1],map,flow);
    127     MF.run(MF.NO_FLOW);
     128    MaxFlow<Graph,int> MF(G,nodes[0],nodes[1<<dim-1],map,flow);
     129    for(int i=0;i<10;i++)
     130      MF.run(MF.NO_FLOW);
    128131  }
    129132  PrintTime("PREFLOW",T);
Note: See TracChangeset for help on using the changeset viewer.