Changes in / [1008:d216e1c8b3fa:999:00f8d9f9920d] in lemon-main
- Files:
-
- 12 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concepts/graph_components.h
r1008 r998 109 109 110 110 bool b; 111 ignore_unused_variable_warning(b);112 113 111 b = (ia == ib) && (ia != ib); 114 112 b = (ia == INVALID) && (ib != INVALID); -
test/bfs_test.cc
r1008 r877 62 62 Arc e; 63 63 int l, i; 64 ignore_unused_variable_warning(l,i);65 64 bool b; 66 65 BType::DistMap d(G); … … 152 151 Digraph g; 153 152 bool b; 154 ignore_unused_variable_warning(b);155 156 153 bfs(g).run(Node()); 157 154 b=bfs(g).run(Node(),Node()); -
test/circulation_test.cc
r1008 r877 74 74 VType v; 75 75 bool b; 76 ignore_unused_variable_warning(v,b);77 76 78 77 typedef Circulation<Digraph, CapMap, CapMap, SupplyMap> -
test/dfs_test.cc
r1008 r964 68 68 int l, i; 69 69 bool b; 70 ignore_unused_variable_warning(l,i,b);71 72 70 DType::DistMap d(G); 73 71 DType::PredMap p(G); … … 154 152 Digraph g; 155 153 bool b; 156 ignore_unused_variable_warning(b);157 158 154 dfs(g).run(Node()); 159 155 b=dfs(g).run(Node(),Node()); -
test/dijkstra_test.cc
r1008 r877 66 66 int i; 67 67 bool b; 68 ignore_unused_variable_warning(l,i,b);69 70 68 DType::DistMap d(G); 71 69 DType::PredMap p(G); … … 165 163 Digraph g; 166 164 bool b; 167 ignore_unused_variable_warning(b);168 169 165 dijkstra(g,LengthMap()).run(Node()); 170 166 b=dijkstra(g,LengthMap()).run(Node(),Node()); -
test/gomory_hu_test.cc
r1008 r877 69 69 Value v; 70 70 int d; 71 ignore_unused_variable_warning(v,d);72 71 73 72 GomoryHu<Graph, CapMap> gh_test(g, cap); -
test/hao_orlin_test.cc
r1008 r877 67 67 CutMap cut; 68 68 Value v; 69 ignore_unused_variable_warning(v);70 69 71 70 HaoOrlin<Digraph, CapMap> ho_test(g, cap); -
test/matching_test.cc
r1008 r877 146 146 MaxMatching<Graph>::Status stat = 147 147 const_mat_test.status(n); 148 ignore_unused_variable_warning(stat);149 148 const MaxMatching<Graph>::StatusMap& smap = 150 149 const_mat_test.statusMap(); -
test/min_cost_arborescence_test.cc
r1008 r877 92 92 VType c; 93 93 bool b; 94 ignore_unused_variable_warning(c,b);95 94 int i; 96 95 CostMap cost; -
test/preflow_test.cc
r1008 r924 87 87 VType v; 88 88 bool b; 89 ignore_unused_variable_warning(v,b);90 89 91 90 typedef Preflow<Digraph, CapMap> -
test/suurballe_test.cc
r1008 r877 118 118 int f; 119 119 VType c; 120 ignore_unused_variable_warning(f,c);121 122 120 c = const_suurb_test.totalLength(); 123 121 f = const_suurb_test.flow(e); -
tools/dimacs-solver.cc
r1006 r877 118 118 if (report) std::cerr << "Read the file: " << ti << '\n'; 119 119 120 typedef NetworkSimplex<Digraph, Value> MCF; 121 ti.restart(); 122 MCF ns(g); 120 ti.restart(); 121 NetworkSimplex<Digraph, Value> ns(g); 123 122 ns.lowerMap(lower).upperMap(cap).costMap(cost).supplyMap(sup); 124 123 if (sum_sup > 0) ns.supplyType(ns.LEQ); 125 124 if (report) std::cerr << "Setup NetworkSimplex class: " << ti << '\n'; 126 125 ti.restart(); 127 typename MCF::ProblemTyperes = ns.run();126 bool res = ns.run(); 128 127 if (report) { 129 128 std::cerr << "Run NetworkSimplex: " << ti << "\n\n"; 130 std::cerr << "Feasible flow: " << (res == MCF::OPTIMAL? "found" : "not found") << '\n';129 std::cerr << "Feasible flow: " << (res ? "found" : "not found") << '\n'; 131 130 if (res) std::cerr << "Min flow cost: " 132 131 << ns.template totalCost<LargeValue>() << '\n'; … … 189 188 190 189 int main(int argc, const char *argv[]) { 190 typedef SmartDigraph Digraph; 191 192 typedef Digraph::Arc Arc; 191 193 192 194 std::string inputName;
Note: See TracChangeset
for help on using the changeset viewer.