COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
05/04/04 18:52:15 (17 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@696
Message:

Minimum cost flows of small values: algorithm from Andras Frank's lecture notes (approximately)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/athos/mincostflows_test.cc

    r527 r530  
    6262  length.set(v5_t, 8);
    6363
    64   ConstMap const1map(1);
    65   std::cout << "Minlengthpaths algorithm test..." << std::endl;
     64  ConstMap<Edge, int> const1map(1);
     65  std::cout << "Mincostflows algorithm test..." << std::endl;
    6666
    6767 
    6868  int k=3;
    69   MinCostFlows< ListGraph, ListGraph::EdgeMap<int> >
     69  MinCostFlows< ListGraph, ListGraph::EdgeMap<int>, ConstMap<Edge, int> >
    7070    surb_test(graph, length, const1map);
    7171
    7272  check(  surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,"Two paths, total length should be 46");
    7373
     74  k=1;
     75  check(  surb_test.run(s,t,k) == 1 && surb_test.totalLength() == 19,"One path, total length should be 19");
     76 
     77  //cout << surb_test.run(s,t,k) << surb_test.totalLength()<<endl;
     78  /*
    7479  typedef DirPath<ListGraph> DPath;
    7580  DPath P(graph);
     
    8691  surb_test.getPath(P,0);
    8792  check(P.length() == 4, "First path should contain 4 edges."); 
    88 
     93  */
    8994  cout << (passed ? "All tests passed." : "Some of the tests failed!!!")
    9095       << endl;
Note: See TracChangeset for help on using the changeset viewer.