COIN-OR::LEMON - Graph Library

Changeset 2386:81b47fc5c444 in lemon-0.x for benchmark


Ignore:
Timestamp:
03/02/07 19:04:28 (17 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3217
Message:

Hard Warning checking

  • based on the remark of the ZIB user
  • we do not use -Winline
Location:
benchmark
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • benchmark/bench_tools.h

    r1956 r2386  
    8181};
    8282
    83 inline void PrintTime(char *ID,lemon::Timer &T)
     83inline void PrintTime(const char *ID, lemon::Timer &T)
    8484{
    8585  lemon::TimeStamp S(T);
  • benchmark/hcube.cc

    r1956 r2386  
    7979  for(int i=0;i<5;i++) {
    8080    Primes P;
    81     for(int i=0;i<dim*(1<<dim);i++) P();
     81    for(int j=0;j<dim*(1<<dim);j++) P();
    8282   
    8383    //  for(EdgeIt e(G);G.valid(e);G.next(e)) map[e]=P();
  • benchmark/swap_bipartite_bench.cc

    r2242 r2386  
    4343      vector<LGraph::Node> lbNodes; 
    4444     
    45       for (int i = 0; i < n; ++i) {
     45      for (int j = 0; j < n; ++j) {
    4646        Node node = graph.addANode();
    4747        aNodes.push_back(node);
     
    4949        laNodes.push_back(lnode);
    5050      }
    51       for (int i = 0; i < m; ++i) {
     51      for (int j = 0; j < m; ++j) {
    5252        Node node = graph.addBNode();
    5353        bNodes.push_back(node);
     
    5555        lbNodes.push_back(lnode);
    5656      }
    57       for (int i = 0; i < e; ++i) {
     57      for (int j = 0; j < e; ++j) {
    5858        int a,b;
    5959        Node aNode = aNodes[a=rnd[n]];
Note: See TracChangeset for help on using the changeset viewer.