Changeset 530:d9c06ac0b3a3 in lemon-0.x for src/work/athos/mincostflows_test.cc
- Timestamp:
- 05/04/04 18:52:15 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@696
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/athos/mincostflows_test.cc
r527 r530 62 62 length.set(v5_t, 8); 63 63 64 ConstMap const1map(1);65 std::cout << "Min lengthpaths algorithm test..." << std::endl;64 ConstMap<Edge, int> const1map(1); 65 std::cout << "Mincostflows algorithm test..." << std::endl; 66 66 67 67 68 68 int k=3; 69 MinCostFlows< ListGraph, ListGraph::EdgeMap<int> >69 MinCostFlows< ListGraph, ListGraph::EdgeMap<int>, ConstMap<Edge, int> > 70 70 surb_test(graph, length, const1map); 71 71 72 72 check( surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,"Two paths, total length should be 46"); 73 73 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 /* 74 79 typedef DirPath<ListGraph> DPath; 75 80 DPath P(graph); … … 86 91 surb_test.getPath(P,0); 87 92 check(P.length() == 4, "First path should contain 4 edges."); 88 93 */ 89 94 cout << (passed ? "All tests passed." : "Some of the tests failed!!!") 90 95 << endl;
Note: See TracChangeset
for help on using the changeset viewer.