Changeset 611:83530dad618a in lemon-0.x
- Timestamp:
- 05/11/04 18:38:17 (21 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@793
- Location:
- src
- Files:
-
- 1 added
- 1 deleted
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
src/hugo/mincostflows.h
r610 r611 7 7 ///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost 8 8 9 #include <iostream> 9 10 10 #include <hugo/dijkstra.h> 11 11 #include <hugo/graph_wrapper.h> -
src/hugo/minlengthpaths.h
r610 r611 7 7 ///\brief An algorithm for finding k paths of minimal total length. 8 8 9 #include <iostream> 9 10 10 //#include <hugo/dijkstra.h> 11 11 //#include <hugo/graph_wrapper.h> -
src/test/minlengthpaths_test.cc
r610 r611 3 3 #include <hugo/minlengthpaths.h> 4 4 #include <path.h> 5 #include "test_tools.h" 5 6 6 7 using namespace std; … … 10 11 11 12 bool passed = true; 12 13 void check(bool rc, char *msg="") {14 passed = passed && rc;15 if(!rc) {16 std::cerr << "Test failed! ("<< msg << ")" << std::endl; \17 18 19 }20 }21 22 13 23 14
Note: See TracChangeset
for help on using the changeset viewer.