kpeter@648: /* -*- mode: C++; indent-tabs-mode: nil; -*- kpeter@648: * kpeter@648: * This file is a part of LEMON, a generic C++ optimization library. kpeter@648: * kpeter@648: * Copyright (C) 2003-2009 kpeter@648: * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport kpeter@648: * (Egervary Research Group on Combinatorial Optimization, EGRES). kpeter@648: * kpeter@648: * Permission to use, modify and distribute this software is granted kpeter@648: * provided that this copyright notice appears in all copies. For kpeter@648: * precise terms see the accompanying LICENSE file. kpeter@648: * kpeter@648: * This software is provided "AS IS" with no warranty of any kind, kpeter@648: * express or implied, and with no claim as to its suitability for any kpeter@648: * purpose. kpeter@648: * kpeter@648: */ kpeter@648: kpeter@648: #include kpeter@648: #include kpeter@648: kpeter@648: #include kpeter@648: #include kpeter@648: #include kpeter@648: kpeter@648: //#include kpeter@648: //#include kpeter@648: //#include kpeter@648: #include kpeter@648: //#include kpeter@648: //#include kpeter@648: kpeter@648: #include kpeter@648: #include kpeter@648: kpeter@648: #include "test_tools.h" kpeter@648: kpeter@648: using namespace lemon; kpeter@648: kpeter@648: char test_lgf[] = kpeter@648: "@nodes\n" kpeter@648: "label sup1 sup2 sup3\n" kpeter@648: " 1 20 27 0\n" kpeter@648: " 2 -4 0 0\n" kpeter@648: " 3 0 0 0\n" kpeter@648: " 4 0 0 0\n" kpeter@648: " 5 9 0 0\n" kpeter@648: " 6 -6 0 0\n" kpeter@648: " 7 0 0 0\n" kpeter@648: " 8 0 0 0\n" kpeter@648: " 9 3 0 0\n" kpeter@648: " 10 -2 0 0\n" kpeter@648: " 11 0 0 0\n" kpeter@648: " 12 -20 -27 0\n" kpeter@648: "\n" kpeter@648: "@arcs\n" kpeter@648: " cost cap low1 low2\n" kpeter@648: " 1 2 70 11 0 8\n" kpeter@648: " 1 3 150 3 0 1\n" kpeter@648: " 1 4 80 15 0 2\n" kpeter@648: " 2 8 80 12 0 0\n" kpeter@648: " 3 5 140 5 0 3\n" kpeter@648: " 4 6 60 10 0 1\n" kpeter@648: " 4 7 80 2 0 0\n" kpeter@648: " 4 8 110 3 0 0\n" kpeter@648: " 5 7 60 14 0 0\n" kpeter@648: " 5 11 120 12 0 0\n" kpeter@648: " 6 3 0 3 0 0\n" kpeter@648: " 6 9 140 4 0 0\n" kpeter@648: " 6 10 90 8 0 0\n" kpeter@648: " 7 1 30 5 0 0\n" kpeter@648: " 8 12 60 16 0 4\n" kpeter@648: " 9 12 50 6 0 0\n" kpeter@648: "10 12 70 13 0 5\n" kpeter@648: "10 2 100 7 0 0\n" kpeter@648: "10 7 60 10 0 0\n" kpeter@648: "11 10 20 14 0 6\n" kpeter@648: "12 11 30 10 0 0\n" kpeter@648: "\n" kpeter@648: "@attributes\n" kpeter@648: "source 1\n" kpeter@648: "target 12\n"; kpeter@648: kpeter@648: kpeter@648: // Check the interface of an MCF algorithm kpeter@648: template kpeter@648: class McfClassConcept kpeter@648: { kpeter@648: public: kpeter@648: kpeter@648: template kpeter@648: struct Constraints { kpeter@648: void constraints() { kpeter@648: checkConcept(); kpeter@648: kpeter@648: MCF mcf_test1(g, lower, upper, cost, sup); kpeter@648: MCF mcf_test2(g, upper, cost, sup); kpeter@648: MCF mcf_test3(g, lower, upper, cost, n, n, k); kpeter@648: MCF mcf_test4(g, upper, cost, n, n, k); kpeter@648: kpeter@648: // TODO: This part should be enabled and the next part kpeter@648: // should be removed if map copying is supported kpeter@648: /* kpeter@648: flow = mcf_test1.flowMap(); kpeter@648: mcf_test1.flowMap(flow); kpeter@648: kpeter@648: pot = mcf_test1.potentialMap(); kpeter@648: mcf_test1.potentialMap(pot); kpeter@648: */ kpeter@648: /**/ kpeter@648: const typename MCF::FlowMap &fm = kpeter@648: mcf_test1.flowMap(); kpeter@648: mcf_test1.flowMap(flow); kpeter@648: const typename MCF::PotentialMap &pm = kpeter@648: mcf_test1.potentialMap(); kpeter@648: mcf_test1.potentialMap(pot); kpeter@648: ignore_unused_variable_warning(fm); kpeter@648: ignore_unused_variable_warning(pm); kpeter@648: /**/ kpeter@648: kpeter@648: mcf_test1.run(); kpeter@648: kpeter@648: v = mcf_test1.totalCost(); kpeter@648: v = mcf_test1.flow(a); kpeter@648: v = mcf_test1.potential(n); kpeter@648: } kpeter@648: kpeter@648: typedef typename GR::Node Node; kpeter@648: typedef typename GR::Arc Arc; kpeter@648: typedef concepts::ReadMap NM; kpeter@648: typedef concepts::ReadMap AM; kpeter@648: kpeter@648: const GR &g; kpeter@648: const AM &lower; kpeter@648: const AM &upper; kpeter@648: const AM &cost; kpeter@648: const NM ⊃ kpeter@648: const Node &n; kpeter@648: const Arc &a; kpeter@648: const Value &k; kpeter@648: Value v; kpeter@648: kpeter@648: typename MCF::FlowMap &flow; kpeter@648: typename MCF::PotentialMap &pot; kpeter@648: }; kpeter@648: kpeter@648: }; kpeter@648: kpeter@648: kpeter@648: // Check the feasibility of the given flow (primal soluiton) kpeter@648: template < typename GR, typename LM, typename UM, kpeter@648: typename SM, typename FM > kpeter@648: bool checkFlow( const GR& gr, const LM& lower, const UM& upper, kpeter@648: const SM& supply, const FM& flow ) kpeter@648: { kpeter@648: TEMPLATE_DIGRAPH_TYPEDEFS(GR); kpeter@648: kpeter@648: for (ArcIt e(gr); e != INVALID; ++e) { kpeter@648: if (flow[e] < lower[e] || flow[e] > upper[e]) return false; kpeter@648: } kpeter@648: kpeter@648: for (NodeIt n(gr); n != INVALID; ++n) { kpeter@648: typename SM::Value sum = 0; kpeter@648: for (OutArcIt e(gr, n); e != INVALID; ++e) kpeter@648: sum += flow[e]; kpeter@648: for (InArcIt e(gr, n); e != INVALID; ++e) kpeter@648: sum -= flow[e]; kpeter@648: if (sum != supply[n]) return false; kpeter@648: } kpeter@648: kpeter@648: return true; kpeter@648: } kpeter@648: kpeter@648: // Check the feasibility of the given potentials (dual soluiton) kpeter@648: // using the Complementary Slackness optimality condition kpeter@648: template < typename GR, typename LM, typename UM, kpeter@648: typename CM, typename FM, typename PM > kpeter@648: bool checkPotential( const GR& gr, const LM& lower, const UM& upper, kpeter@648: const CM& cost, const FM& flow, const PM& pi ) kpeter@648: { kpeter@648: TEMPLATE_DIGRAPH_TYPEDEFS(GR); kpeter@648: kpeter@648: bool opt = true; kpeter@648: for (ArcIt e(gr); opt && e != INVALID; ++e) { kpeter@648: typename CM::Value red_cost = kpeter@648: cost[e] + pi[gr.source(e)] - pi[gr.target(e)]; kpeter@648: opt = red_cost == 0 || kpeter@648: (red_cost > 0 && flow[e] == lower[e]) || kpeter@648: (red_cost < 0 && flow[e] == upper[e]); kpeter@648: } kpeter@648: return opt; kpeter@648: } kpeter@648: kpeter@648: // Run a minimum cost flow algorithm and check the results kpeter@648: template < typename MCF, typename GR, kpeter@648: typename LM, typename UM, kpeter@648: typename CM, typename SM > kpeter@648: void checkMcf( const MCF& mcf, bool mcf_result, kpeter@648: const GR& gr, const LM& lower, const UM& upper, kpeter@648: const CM& cost, const SM& supply, kpeter@648: bool result, typename CM::Value total, kpeter@648: const std::string &test_id = "" ) kpeter@648: { kpeter@648: check(mcf_result == result, "Wrong result " + test_id); kpeter@648: if (result) { kpeter@648: check(checkFlow(gr, lower, upper, supply, mcf.flowMap()), kpeter@648: "The flow is not feasible " + test_id); kpeter@648: check(mcf.totalCost() == total, "The flow is not optimal " + test_id); kpeter@648: check(checkPotential(gr, lower, upper, cost, mcf.flowMap(), kpeter@648: mcf.potentialMap()), kpeter@648: "Wrong potentials " + test_id); kpeter@648: } kpeter@648: } kpeter@648: kpeter@648: int main() kpeter@648: { kpeter@648: // Check the interfaces kpeter@648: { kpeter@648: typedef int Value; kpeter@648: // This typedef should be enabled if the standard maps are kpeter@648: // reference maps in the graph concepts kpeter@648: //typedef concepts::Digraph GR; kpeter@648: typedef ListDigraph GR; kpeter@648: typedef concepts::ReadMap NM; kpeter@648: typedef concepts::ReadMap AM; kpeter@648: kpeter@648: //checkConcept< McfClassConcept, kpeter@648: // CycleCanceling >(); kpeter@648: //checkConcept< McfClassConcept, kpeter@648: // CapacityScaling >(); kpeter@648: //checkConcept< McfClassConcept, kpeter@648: // CostScaling >(); kpeter@648: checkConcept< McfClassConcept, kpeter@648: NetworkSimplex >(); kpeter@648: //checkConcept< MinCostFlow, kpeter@648: // NetworkSimplex >(); kpeter@648: } kpeter@648: kpeter@648: // Run various MCF tests kpeter@648: typedef ListDigraph Digraph; kpeter@648: DIGRAPH_TYPEDEFS(ListDigraph); kpeter@648: kpeter@648: // Read the test digraph kpeter@648: Digraph gr; kpeter@648: Digraph::ArcMap c(gr), l1(gr), l2(gr), u(gr); kpeter@648: Digraph::NodeMap s1(gr), s2(gr), s3(gr); kpeter@648: Node v, w; kpeter@648: kpeter@648: std::istringstream input(test_lgf); kpeter@648: DigraphReader(gr, input) kpeter@648: .arcMap("cost", c) kpeter@648: .arcMap("cap", u) kpeter@648: .arcMap("low1", l1) kpeter@648: .arcMap("low2", l2) kpeter@648: .nodeMap("sup1", s1) kpeter@648: .nodeMap("sup2", s2) kpeter@648: .nodeMap("sup3", s3) kpeter@648: .node("source", v) kpeter@648: .node("target", w) kpeter@648: .run(); kpeter@648: kpeter@648: /* kpeter@648: // A. Test CapacityScaling with scaling kpeter@648: { kpeter@648: CapacityScaling mcf1(gr, u, c, s1); kpeter@648: CapacityScaling mcf2(gr, u, c, v, w, 27); kpeter@648: CapacityScaling mcf3(gr, u, c, s3); kpeter@648: CapacityScaling mcf4(gr, l2, u, c, s1); kpeter@648: CapacityScaling mcf5(gr, l2, u, c, v, w, 27); kpeter@648: CapacityScaling mcf6(gr, l2, u, c, s3); kpeter@648: kpeter@648: checkMcf(mcf1, mcf1.run(), gr, l1, u, c, s1, true, 5240, "#A1"); kpeter@648: checkMcf(mcf2, mcf2.run(), gr, l1, u, c, s2, true, 7620, "#A2"); kpeter@648: checkMcf(mcf3, mcf3.run(), gr, l1, u, c, s3, true, 0, "#A3"); kpeter@648: checkMcf(mcf4, mcf4.run(), gr, l2, u, c, s1, true, 5970, "#A4"); kpeter@648: checkMcf(mcf5, mcf5.run(), gr, l2, u, c, s2, true, 8010, "#A5"); kpeter@648: checkMcf(mcf6, mcf6.run(), gr, l2, u, c, s3, false, 0, "#A6"); kpeter@648: } kpeter@648: kpeter@648: // B. Test CapacityScaling without scaling kpeter@648: { kpeter@648: CapacityScaling mcf1(gr, u, c, s1); kpeter@648: CapacityScaling mcf2(gr, u, c, v, w, 27); kpeter@648: CapacityScaling mcf3(gr, u, c, s3); kpeter@648: CapacityScaling mcf4(gr, l2, u, c, s1); kpeter@648: CapacityScaling mcf5(gr, l2, u, c, v, w, 27); kpeter@648: CapacityScaling mcf6(gr, l2, u, c, s3); kpeter@648: kpeter@648: checkMcf(mcf1, mcf1.run(false), gr, l1, u, c, s1, true, 5240, "#B1"); kpeter@648: checkMcf(mcf2, mcf2.run(false), gr, l1, u, c, s2, true, 7620, "#B2"); kpeter@648: checkMcf(mcf3, mcf3.run(false), gr, l1, u, c, s3, true, 0, "#B3"); kpeter@648: checkMcf(mcf4, mcf4.run(false), gr, l2, u, c, s1, true, 5970, "#B4"); kpeter@648: checkMcf(mcf5, mcf5.run(false), gr, l2, u, c, s2, true, 8010, "#B5"); kpeter@648: checkMcf(mcf6, mcf6.run(false), gr, l2, u, c, s3, false, 0, "#B6"); kpeter@648: } kpeter@648: kpeter@648: // C. Test CostScaling using partial augment-relabel method kpeter@648: { kpeter@648: CostScaling mcf1(gr, u, c, s1); kpeter@648: CostScaling mcf2(gr, u, c, v, w, 27); kpeter@648: CostScaling mcf3(gr, u, c, s3); kpeter@648: CostScaling mcf4(gr, l2, u, c, s1); kpeter@648: CostScaling mcf5(gr, l2, u, c, v, w, 27); kpeter@648: CostScaling mcf6(gr, l2, u, c, s3); kpeter@648: kpeter@648: checkMcf(mcf1, mcf1.run(), gr, l1, u, c, s1, true, 5240, "#C1"); kpeter@648: checkMcf(mcf2, mcf2.run(), gr, l1, u, c, s2, true, 7620, "#C2"); kpeter@648: checkMcf(mcf3, mcf3.run(), gr, l1, u, c, s3, true, 0, "#C3"); kpeter@648: checkMcf(mcf4, mcf4.run(), gr, l2, u, c, s1, true, 5970, "#C4"); kpeter@648: checkMcf(mcf5, mcf5.run(), gr, l2, u, c, s2, true, 8010, "#C5"); kpeter@648: checkMcf(mcf6, mcf6.run(), gr, l2, u, c, s3, false, 0, "#C6"); kpeter@648: } kpeter@648: kpeter@648: // D. Test CostScaling using push-relabel method kpeter@648: { kpeter@648: CostScaling mcf1(gr, u, c, s1); kpeter@648: CostScaling mcf2(gr, u, c, v, w, 27); kpeter@648: CostScaling mcf3(gr, u, c, s3); kpeter@648: CostScaling mcf4(gr, l2, u, c, s1); kpeter@648: CostScaling mcf5(gr, l2, u, c, v, w, 27); kpeter@648: CostScaling mcf6(gr, l2, u, c, s3); kpeter@648: kpeter@648: checkMcf(mcf1, mcf1.run(false), gr, l1, u, c, s1, true, 5240, "#D1"); kpeter@648: checkMcf(mcf2, mcf2.run(false), gr, l1, u, c, s2, true, 7620, "#D2"); kpeter@648: checkMcf(mcf3, mcf3.run(false), gr, l1, u, c, s3, true, 0, "#D3"); kpeter@648: checkMcf(mcf4, mcf4.run(false), gr, l2, u, c, s1, true, 5970, "#D4"); kpeter@648: checkMcf(mcf5, mcf5.run(false), gr, l2, u, c, s2, true, 8010, "#D5"); kpeter@648: checkMcf(mcf6, mcf6.run(false), gr, l2, u, c, s3, false, 0, "#D6"); kpeter@648: } kpeter@648: */ kpeter@648: kpeter@648: // E. Test NetworkSimplex with FIRST_ELIGIBLE_PIVOT kpeter@648: { kpeter@648: NetworkSimplex::PivotRuleEnum pr = kpeter@648: NetworkSimplex::FIRST_ELIGIBLE_PIVOT; kpeter@648: NetworkSimplex mcf1(gr, u, c, s1); kpeter@648: NetworkSimplex mcf2(gr, u, c, v, w, 27); kpeter@648: NetworkSimplex mcf3(gr, u, c, s3); kpeter@648: NetworkSimplex mcf4(gr, l2, u, c, s1); kpeter@648: NetworkSimplex mcf5(gr, l2, u, c, v, w, 27); kpeter@648: NetworkSimplex mcf6(gr, l2, u, c, s3); kpeter@648: kpeter@648: checkMcf(mcf1, mcf1.run(pr), gr, l1, u, c, s1, true, 5240, "#E1"); kpeter@648: checkMcf(mcf2, mcf2.run(pr), gr, l1, u, c, s2, true, 7620, "#E2"); kpeter@648: checkMcf(mcf3, mcf3.run(pr), gr, l1, u, c, s3, true, 0, "#E3"); kpeter@648: checkMcf(mcf4, mcf4.run(pr), gr, l2, u, c, s1, true, 5970, "#E4"); kpeter@648: checkMcf(mcf5, mcf5.run(pr), gr, l2, u, c, s2, true, 8010, "#E5"); kpeter@648: checkMcf(mcf6, mcf6.run(pr), gr, l2, u, c, s3, false, 0, "#E6"); kpeter@648: } kpeter@648: kpeter@648: // F. Test NetworkSimplex with BEST_ELIGIBLE_PIVOT kpeter@648: { kpeter@648: NetworkSimplex::PivotRuleEnum pr = kpeter@648: NetworkSimplex::BEST_ELIGIBLE_PIVOT; kpeter@648: NetworkSimplex mcf1(gr, u, c, s1); kpeter@648: NetworkSimplex mcf2(gr, u, c, v, w, 27); kpeter@648: NetworkSimplex mcf3(gr, u, c, s3); kpeter@648: NetworkSimplex mcf4(gr, l2, u, c, s1); kpeter@648: NetworkSimplex mcf5(gr, l2, u, c, v, w, 27); kpeter@648: NetworkSimplex mcf6(gr, l2, u, c, s3); kpeter@648: kpeter@648: checkMcf(mcf1, mcf1.run(pr), gr, l1, u, c, s1, true, 5240, "#F1"); kpeter@648: checkMcf(mcf2, mcf2.run(pr), gr, l1, u, c, s2, true, 7620, "#F2"); kpeter@648: checkMcf(mcf3, mcf3.run(pr), gr, l1, u, c, s3, true, 0, "#F3"); kpeter@648: checkMcf(mcf4, mcf4.run(pr), gr, l2, u, c, s1, true, 5970, "#F4"); kpeter@648: checkMcf(mcf5, mcf5.run(pr), gr, l2, u, c, s2, true, 8010, "#F5"); kpeter@648: checkMcf(mcf6, mcf6.run(pr), gr, l2, u, c, s3, false, 0, "#F6"); kpeter@648: } kpeter@648: kpeter@648: // G. Test NetworkSimplex with BLOCK_SEARCH_PIVOT kpeter@648: { kpeter@648: NetworkSimplex::PivotRuleEnum pr = kpeter@648: NetworkSimplex::BLOCK_SEARCH_PIVOT; kpeter@648: NetworkSimplex mcf1(gr, u, c, s1); kpeter@648: NetworkSimplex mcf2(gr, u, c, v, w, 27); kpeter@648: NetworkSimplex mcf3(gr, u, c, s3); kpeter@648: NetworkSimplex mcf4(gr, l2, u, c, s1); kpeter@648: NetworkSimplex mcf5(gr, l2, u, c, v, w, 27); kpeter@648: NetworkSimplex mcf6(gr, l2, u, c, s3); kpeter@648: kpeter@648: checkMcf(mcf1, mcf1.run(pr), gr, l1, u, c, s1, true, 5240, "#G1"); kpeter@648: checkMcf(mcf2, mcf2.run(pr), gr, l1, u, c, s2, true, 7620, "#G2"); kpeter@648: checkMcf(mcf3, mcf3.run(pr), gr, l1, u, c, s3, true, 0, "#G3"); kpeter@648: checkMcf(mcf4, mcf4.run(pr), gr, l2, u, c, s1, true, 5970, "#G4"); kpeter@648: checkMcf(mcf5, mcf5.run(pr), gr, l2, u, c, s2, true, 8010, "#G5"); kpeter@648: checkMcf(mcf6, mcf6.run(pr), gr, l2, u, c, s3, false, 0, "#G6"); kpeter@648: } kpeter@648: kpeter@648: // H. Test NetworkSimplex with CANDIDATE_LIST_PIVOT kpeter@648: { kpeter@648: NetworkSimplex::PivotRuleEnum pr = kpeter@648: NetworkSimplex::CANDIDATE_LIST_PIVOT; kpeter@648: NetworkSimplex mcf1(gr, u, c, s1); kpeter@648: NetworkSimplex mcf2(gr, u, c, v, w, 27); kpeter@648: NetworkSimplex mcf3(gr, u, c, s3); kpeter@648: NetworkSimplex mcf4(gr, l2, u, c, s1); kpeter@648: NetworkSimplex mcf5(gr, l2, u, c, v, w, 27); kpeter@648: NetworkSimplex mcf6(gr, l2, u, c, s3); kpeter@648: kpeter@648: checkMcf(mcf1, mcf1.run(pr), gr, l1, u, c, s1, true, 5240, "#H1"); kpeter@648: checkMcf(mcf2, mcf2.run(pr), gr, l1, u, c, s2, true, 7620, "#H2"); kpeter@648: checkMcf(mcf3, mcf3.run(pr), gr, l1, u, c, s3, true, 0, "#H3"); kpeter@648: checkMcf(mcf4, mcf4.run(pr), gr, l2, u, c, s1, true, 5970, "#H4"); kpeter@648: checkMcf(mcf5, mcf5.run(pr), gr, l2, u, c, s2, true, 8010, "#H5"); kpeter@648: checkMcf(mcf6, mcf6.run(pr), gr, l2, u, c, s3, false, 0, "#H6"); kpeter@648: } kpeter@648: kpeter@648: // I. Test NetworkSimplex with ALTERING_LIST_PIVOT kpeter@648: { kpeter@648: NetworkSimplex::PivotRuleEnum pr = kpeter@648: NetworkSimplex::ALTERING_LIST_PIVOT; kpeter@648: NetworkSimplex mcf1(gr, u, c, s1); kpeter@648: NetworkSimplex mcf2(gr, u, c, v, w, 27); kpeter@648: NetworkSimplex mcf3(gr, u, c, s3); kpeter@648: NetworkSimplex mcf4(gr, l2, u, c, s1); kpeter@648: NetworkSimplex mcf5(gr, l2, u, c, v, w, 27); kpeter@648: NetworkSimplex mcf6(gr, l2, u, c, s3); kpeter@648: kpeter@648: checkMcf(mcf1, mcf1.run(pr), gr, l1, u, c, s1, true, 5240, "#I1"); kpeter@648: checkMcf(mcf2, mcf2.run(pr), gr, l1, u, c, s2, true, 7620, "#I2"); kpeter@648: checkMcf(mcf3, mcf3.run(pr), gr, l1, u, c, s3, true, 0, "#I3"); kpeter@648: checkMcf(mcf4, mcf4.run(pr), gr, l2, u, c, s1, true, 5970, "#I4"); kpeter@648: checkMcf(mcf5, mcf5.run(pr), gr, l2, u, c, s2, true, 8010, "#I5"); kpeter@648: checkMcf(mcf6, mcf6.run(pr), gr, l2, u, c, s3, false, 0, "#I6"); kpeter@648: } kpeter@648: kpeter@648: /* kpeter@648: // J. Test MinCostFlow kpeter@648: { kpeter@648: MinCostFlow mcf1(gr, u, c, s1); kpeter@648: MinCostFlow mcf2(gr, u, c, v, w, 27); kpeter@648: MinCostFlow mcf3(gr, u, c, s3); kpeter@648: MinCostFlow mcf4(gr, l2, u, c, s1); kpeter@648: MinCostFlow mcf5(gr, l2, u, c, v, w, 27); kpeter@648: MinCostFlow mcf6(gr, l2, u, c, s3); kpeter@648: kpeter@648: checkMcf(mcf1, mcf1.run(), gr, l1, u, c, s1, true, 5240, "#J1"); kpeter@648: checkMcf(mcf2, mcf2.run(), gr, l1, u, c, s2, true, 7620, "#J2"); kpeter@648: checkMcf(mcf3, mcf3.run(), gr, l1, u, c, s3, true, 0, "#J3"); kpeter@648: checkMcf(mcf4, mcf4.run(), gr, l2, u, c, s1, true, 5970, "#J4"); kpeter@648: checkMcf(mcf5, mcf5.run(), gr, l2, u, c, s2, true, 8010, "#J5"); kpeter@648: checkMcf(mcf6, mcf6.run(), gr, l2, u, c, s3, false, 0, "#J6"); kpeter@648: } kpeter@648: */ kpeter@648: /* kpeter@648: // K. Test MinCostMaxFlow kpeter@648: { kpeter@648: MinCostMaxFlow mcmf(gr, u, c, v, w); kpeter@648: mcmf.run(); kpeter@648: checkMcf(mcmf, true, gr, l1, u, c, s3, true, 7620, "#K1"); kpeter@648: } kpeter@648: */ kpeter@648: kpeter@648: return 0; kpeter@648: }