lemon: comparison test/min_cost_flow

equal deleted inserted replaced

-:a6427e0fd5f6
+:0a3b530c4482
 /* -*- mode: C++; indent-tabs-mode: nil; -*-
 *
 * This file is a part of LEMON, a generic C++ optimization library.
 *
-* Copyright (C) 2003-2009
+* Copyright (C) 2003-2010
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
 *
 * Permission to use, modify and distribute this software is granted
 * provided that this copyright notice appears in all copies. For
 "    8     0    0    0    0    0    3\n"
 "    9     3    0    0    0    0    0\n"
 "   10    -2    0    0    0   -7   -2\n"
 "   11     0    0    0    0  -10    0\n"
 "   12   -20  -27    0  -30  -30  -20\n"
 "\n"
 "@arcs\n"
 "       cost  cap low1 low2 low3\n"
 " 1  2    70   11    0    8    8\n"
 " 1  3   150    3    0    1    0\n"
 " 1  4    80   15    0    2    2\n"
 "3 2     50      0      0\n"
 "5 3     10      0      0\n"
 "5 6     80      0   1000\n"
 "6 7     30      0  -1000\n"
 "7 5   -120      0      0\n";
 char test_neg2_lgf[] =
 "@nodes\n"
 "label   sup\n"
 "    1   100\n"
 "    2  -300\n"
 template <typename MCF>
 struct Constraints {
 void constraints() {
 checkConcept<concepts::Digraph, GR>();
 const Constraints& me = *this;
 MCF mcf(me.g);
 const MCF& const_mcf = mcf;
 typedef concepts::ReadMap<Node, Value> NM;
 typedef concepts::ReadMap<Arc, Value> VAM;
 typedef concepts::ReadMap<Arc, Cost> CAM;
 typedef concepts::WriteMap<Arc, Value> FlowMap;
 typedef concepts::WriteMap<Node, Cost> PotMap;
 GR g;
 VAM lower;
 VAM upper;
 CAM cost;
 NM sup;
 // Check the feasibility of the given potentials (dual soluiton)
 // using the "Complementary Slackness" optimality condition
 template < typename GR, typename LM, typename UM,
 typename CM, typename SM, typename FM, typename PM >
 bool checkPotential( const GR& gr, const LM& lower, const UM& upper,
 const CM& cost, const SM& supply, const FM& flow,
 const PM& pi, SupplyType type )
 {
 TEMPLATE_DIGRAPH_TYPEDEFS(GR);
 bool opt = true;
 cost[e] + pi[gr.source(e)] - pi[gr.target(e)];
 opt = red_cost == 0 ||
 (red_cost > 0 && flow[e] == lower[e]) ||
 (red_cost < 0 && flow[e] == upper[e]);
 }
 for (NodeIt n(gr); opt && n != INVALID; ++n) {
 typename SM::Value sum = 0;
 for (OutArcIt e(gr, n); e != INVALID; ++e)
 sum += flow[e];
 for (InArcIt e(gr, n); e != INVALID; ++e)
 opt = (pi[n] <= 0) && (sum == supply[n] || pi[n] == 0);
 } else {
 opt = (pi[n] >= 0) && (sum == supply[n] || pi[n] == 0);
 }
 }
 return opt;
 }
 // Check whether the dual cost is equal to the primal cost
 template < typename GR, typename LM, typename UM,
 dual_cost += lower[a] * cost[a];
 red_supply[gr.source(a)] -= lower[a];
 red_supply[gr.target(a)] += lower[a];
 }
 }
 for (NodeIt n(gr); n != INVALID; ++n) {
 dual_cost -= red_supply[n] * pi[n];
 }
 for (ArcIt a(gr); a != INVALID; ++a) {
 typename CM::Value red_cost =
 cost[a] + pi[gr.source(a)] - pi[gr.target(a)];
 dual_cost -= (upper[a] - lower[a]) * std::max(-red_cost, 0);
 }
 return dual_cost == total;
 }
 // Run a minimum cost flow algorithm and check the results
 template < typename MCF, typename GR,
 void runMcfGeqTests( Param param,
 const std::string &test_str = "",
 bool full_neg_cost_support = false )
 {
 MCF mcf1(gr), mcf2(neg1_gr), mcf3(neg2_gr);
 // Basic tests
 mcf1.upperMap(u).costMap(c).supplyMap(s1);
 checkMcf(mcf1, mcf1.run(param), gr, l1, u, c, s1,
 mcf1.OPTIMAL, true,     5240, test_str + "-1");
 mcf1.stSupply(v, w, 27);
 .nodeMap("sup5", s5)
 .nodeMap("sup6", s6)
 .node("source", v)
 .node("target", w)
 .run();
 std::istringstream neg_inp1(test_neg1_lgf);
 DigraphReader<Digraph>(neg1_gr, neg_inp1)
 .arcMap("cost", neg1_c)
 .arcMap("low1", neg1_l1)
 .arcMap("low2", neg1_l2)
 .nodeMap("sup", neg1_s)
 .run();
 std::istringstream neg_inp2(test_neg2_lgf);
 DigraphReader<Digraph>(neg2_gr, neg_inp2)
 .arcMap("cost", neg2_c)
 .nodeMap("sup", neg2_s)
 .run();
 // Check the interface of NetworkSimplex
 {
 typedef concepts::Digraph GR;
 checkConcept< McfClassConcept<GR, int, int>,
 NetworkSimplex<GR> >();
 checkConcept< McfClassConcept<GR, int, double>,
 CycleCanceling<GR, int, double> >();
 }
 // Test NetworkSimplex
 {
 typedef NetworkSimplex<Digraph> MCF;
 runMcfGeqTests<MCF>(MCF::FIRST_ELIGIBLE, "NS-FE", true);
 runMcfLeqTests<MCF>(MCF::FIRST_ELIGIBLE, "NS-FE");
 runMcfGeqTests<MCF>(MCF::BEST_ELIGIBLE,  "NS-BE", true);
 runMcfLeqTests<MCF>(MCF::BEST_ELIGIBLE,  "NS-BE");
 runMcfGeqTests<MCF>(MCF::CANDIDATE_LIST, "NS-CL", true);
 runMcfLeqTests<MCF>(MCF::CANDIDATE_LIST, "NS-CL");
 runMcfGeqTests<MCF>(MCF::ALTERING_LIST,  "NS-AL", true);
 runMcfLeqTests<MCF>(MCF::ALTERING_LIST,  "NS-AL");
 }
 // Test CapacityScaling
 {
 typedef CapacityScaling<Digraph> MCF;
 runMcfGeqTests<MCF>(0, "SSP");
 runMcfGeqTests<MCF>(2, "CAS");

changeset 1042	773dd96ecdd8
parent 898	75c97c3786d6
child 1270	dceba191c00d
child 1317	b40c2bbb8da5