Changeset 808:bdfc038f364c in lemon-1.1 for test/suurballe_test.cc
- Timestamp:
- 08/07/13 06:31:47 (11 years ago)
- Branch:
- 1.1
- Parents:
- 806:14394c9603c2 (diff), 807:3e711ee55d31 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent. - Phase:
- public
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
test/suurballe_test.cc
r797 r808 108 108 int f; 109 109 VType c; 110 ignore_unused_variable_warning(f,c);110 ::lemon::ignore_unused_variable_warning(f,c); 111 111 112 112 c = const_suurb_test.totalLength(); … … 120 120 Path<Digraph> p = const_suurb_test.path(k); 121 121 122 ignore_unused_variable_warning(fm);123 ignore_unused_variable_warning(pm);122 ::lemon::ignore_unused_variable_warning(fm); 123 ::lemon::ignore_unused_variable_warning(pm); 124 124 } 125 125 -
test/suurballe_test.cc
r807 r808 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 2003-20 095 * Copyright (C) 2003-2011 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 81 81 typedef Digraph::Arc Arc; 82 82 typedef concepts::ReadMap<Arc, VType> LengthMap; 83 83 84 84 typedef Suurballe<Digraph, LengthMap> SuurballeType; 85 85 … … 105 105 k = suurb_test.findFlow(n, k); 106 106 suurb_test.findPaths(); 107 107 108 108 int f; 109 109 VType c; … … 119 119 k = const_suurb_test.pathNum(); 120 120 Path<Digraph> p = const_suurb_test.path(k); 121 121 122 122 ::lemon::ignore_unused_variable_warning(fm); 123 123 ::lemon::ignore_unused_variable_warning(pm);
Note: See TracChangeset
for help on using the changeset viewer.