COIN-OR::LEMON - Graph Library

Changeset 2514:57143c09dc20 in lemon-0.x for benchmark


Ignore:
Timestamp:
11/17/07 21:58:11 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3379
Message:

Redesign the maximum flow algorithms

Redesigned interface
Preflow changed to use elevator
Edmonds-Karp does not use the ResGraphAdaptor?
Goldberg-Tarjan algorithm (Preflow with Dynamic Trees)
Dinitz-Sleator-Tarjan (Blocking flow with Dynamic Tree)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • benchmark/hcube.cc

    r2391 r2514  
    113113   Graph::EdgeMap<int> flow(G);
    114114   
    115     Preflow<Graph,int> MF(G,nodes[0],nodes[1<<dim-1],map,flow);
     115    Preflow<Graph> MF(G,map,nodes[0],nodes[1<<dim-1]);
    116116    for(int i=0;i<10;i++)
    117       MF.run(MF.NO_FLOW);
     117      MF.run();
    118118  }
    119119  PrintTime("PREFLOW",T);
Note: See TracChangeset for help on using the changeset viewer.