alpar@389: /* -*- mode: C++; indent-tabs-mode: nil; -*- alpar@389: * alpar@389: * This file is a part of LEMON, a generic C++ optimization library. alpar@389: * alpar@927: * Copyright (C) 2003-2011 alpar@389: * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport alpar@389: * (Egervary Research Group on Combinatorial Optimization, EGRES). alpar@389: * alpar@389: * Permission to use, modify and distribute this software is granted alpar@389: * provided that this copyright notice appears in all copies. For alpar@389: * precise terms see the accompanying LICENSE file. alpar@389: * alpar@389: * This software is provided "AS IS" with no warranty of any kind, alpar@389: * express or implied, and with no claim as to its suitability for any alpar@389: * purpose. alpar@389: * alpar@389: */ alpar@389: alpar@423: #include alpar@389: alpar@389: #include "test_tools.h" alpar@389: #include alpar@389: #include alpar@389: #include alpar@389: #include alpar@389: #include kpeter@394: #include alpar@389: alpar@389: using namespace lemon; alpar@389: alpar@423: char test_lgf[] = alpar@423: "@nodes\n" alpar@423: "label\n" alpar@423: "0\n" alpar@423: "1\n" alpar@423: "2\n" alpar@423: "3\n" alpar@423: "4\n" alpar@423: "5\n" alpar@423: "6\n" alpar@423: "7\n" alpar@423: "8\n" alpar@423: "9\n" alpar@423: "@arcs\n" alpar@423: " label capacity\n" alpar@423: "0 1 0 20\n" alpar@423: "0 2 1 0\n" alpar@423: "1 1 2 3\n" alpar@423: "1 2 3 8\n" alpar@423: "1 3 4 8\n" alpar@423: "2 5 5 5\n" alpar@423: "3 2 6 5\n" alpar@423: "3 5 7 5\n" alpar@423: "3 6 8 5\n" alpar@423: "4 3 9 3\n" alpar@423: "5 7 10 3\n" alpar@423: "5 6 11 10\n" alpar@423: "5 8 12 10\n" alpar@423: "6 8 13 8\n" alpar@423: "8 9 14 20\n" alpar@423: "8 1 15 5\n" alpar@423: "9 5 16 5\n" alpar@423: "@attributes\n" alpar@423: "source 1\n" alpar@423: "target 8\n"; alpar@423: kpeter@394: void checkPreflowCompile() alpar@389: { alpar@389: typedef int VType; alpar@389: typedef concepts::Digraph Digraph; alpar@389: alpar@389: typedef Digraph::Node Node; alpar@389: typedef Digraph::Arc Arc; alpar@389: typedef concepts::ReadMap CapMap; alpar@389: typedef concepts::ReadWriteMap FlowMap; alpar@389: typedef concepts::WriteMap CutMap; alpar@389: kpeter@394: typedef Elevator Elev; kpeter@394: typedef LinkedElevator LinkedElev; kpeter@394: alpar@389: Digraph g; alpar@389: Node n; alpar@389: Arc e; alpar@389: CapMap cap; alpar@389: FlowMap flow; alpar@389: CutMap cut; kpeter@585: VType v; kpeter@585: bool b; alpar@389: kpeter@585: typedef Preflow kpeter@585: ::SetFlowMap kpeter@585: ::SetElevator kpeter@585: ::SetStandardElevator kpeter@585: ::Create PreflowType; kpeter@585: PreflowType preflow_test(g, cap, n, n); kpeter@585: const PreflowType& const_preflow_test = preflow_test; alpar@389: kpeter@689: const PreflowType::Elevator& elev = const_preflow_test.elevator(); kpeter@689: preflow_test.elevator(const_cast(elev)); kpeter@689: PreflowType::Tolerance tol = const_preflow_test.tolerance(); kpeter@689: preflow_test.tolerance(tol); kpeter@585: kpeter@585: preflow_test kpeter@585: .capacityMap(cap) kpeter@585: .flowMap(flow) kpeter@585: .source(n) kpeter@585: .target(n); alpar@389: alpar@389: preflow_test.init(); kpeter@392: preflow_test.init(cap); alpar@389: preflow_test.startFirstPhase(); alpar@389: preflow_test.startSecondPhase(); alpar@389: preflow_test.run(); alpar@389: preflow_test.runMinCut(); alpar@389: kpeter@585: v = const_preflow_test.flowValue(); kpeter@585: v = const_preflow_test.flow(e); kpeter@585: const FlowMap& fm = const_preflow_test.flowMap(); kpeter@585: b = const_preflow_test.minCut(n); kpeter@585: const_preflow_test.minCutMap(cut); alpar@877: kpeter@585: ignore_unused_variable_warning(fm); alpar@389: } alpar@389: alpar@389: int cutValue (const SmartDigraph& g, alpar@389: const SmartDigraph::NodeMap& cut, alpar@389: const SmartDigraph::ArcMap& cap) { alpar@389: alpar@389: int c=0; alpar@389: for(SmartDigraph::ArcIt e(g); e!=INVALID; ++e) { alpar@389: if (cut[g.source(e)] && !cut[g.target(e)]) c+=cap[e]; alpar@389: } alpar@389: return c; alpar@389: } alpar@389: alpar@389: bool checkFlow(const SmartDigraph& g, alpar@389: const SmartDigraph::ArcMap& flow, alpar@389: const SmartDigraph::ArcMap& cap, alpar@389: SmartDigraph::Node s, SmartDigraph::Node t) { alpar@389: alpar@389: for (SmartDigraph::ArcIt e(g); e != INVALID; ++e) { alpar@389: if (flow[e] < 0 || flow[e] > cap[e]) return false; alpar@389: } alpar@389: alpar@389: for (SmartDigraph::NodeIt n(g); n != INVALID; ++n) { alpar@389: if (n == s || n == t) continue; alpar@389: int sum = 0; alpar@389: for (SmartDigraph::OutArcIt e(g, n); e != INVALID; ++e) { alpar@389: sum += flow[e]; alpar@389: } alpar@389: for (SmartDigraph::InArcIt e(g, n); e != INVALID; ++e) { alpar@389: sum -= flow[e]; alpar@389: } alpar@389: if (sum != 0) return false; alpar@389: } alpar@389: return true; alpar@389: } alpar@389: alpar@901: void initFlowTest() alpar@901: { alpar@901: DIGRAPH_TYPEDEFS(SmartDigraph); alpar@927: alpar@901: SmartDigraph g; alpar@901: SmartDigraph::ArcMap cap(g),iflow(g); alpar@901: Node s=g.addNode(); Node t=g.addNode(); alpar@901: Node n1=g.addNode(); Node n2=g.addNode(); alpar@901: Arc a; alpar@901: a=g.addArc(s,n1); cap[a]=20; iflow[a]=20; alpar@901: a=g.addArc(n1,n2); cap[a]=10; iflow[a]=0; alpar@901: a=g.addArc(n2,t); cap[a]=20; iflow[a]=0; alpar@901: alpar@901: Preflow pre(g,cap,s,t); alpar@901: pre.init(iflow); alpar@901: pre.startFirstPhase(); alpar@901: check(pre.flowValue() == 10, "The incorrect max flow value."); alpar@901: check(pre.minCut(s), "Wrong min cut (Node s)."); alpar@901: check(pre.minCut(n1), "Wrong min cut (Node n1)."); alpar@901: check(!pre.minCut(n2), "Wrong min cut (Node n2)."); alpar@901: check(!pre.minCut(t), "Wrong min cut (Node t)."); alpar@901: } alpar@901: alpar@901: alpar@389: int main() { alpar@389: alpar@389: typedef SmartDigraph Digraph; alpar@389: alpar@389: typedef Digraph::Node Node; alpar@389: typedef Digraph::NodeIt NodeIt; alpar@389: typedef Digraph::ArcIt ArcIt; alpar@389: typedef Digraph::ArcMap CapMap; alpar@389: typedef Digraph::ArcMap FlowMap; alpar@389: typedef Digraph::NodeMap CutMap; alpar@389: alpar@389: typedef Preflow PType; alpar@389: alpar@389: Digraph g; alpar@389: Node s, t; alpar@389: CapMap cap(g); alpar@423: std::istringstream input(test_lgf); alpar@423: DigraphReader(g,input). alpar@389: arcMap("capacity", cap). alpar@389: node("source",s). alpar@389: node("target",t). alpar@389: run(); alpar@389: alpar@389: PType preflow_test(g, cap, s, t); alpar@389: preflow_test.run(); alpar@389: alpar@389: check(checkFlow(g, preflow_test.flowMap(), cap, s, t), alpar@389: "The flow is not feasible."); alpar@389: alpar@389: CutMap min_cut(g); alpar@389: preflow_test.minCutMap(min_cut); alpar@389: int min_cut_value=cutValue(g,min_cut,cap); alpar@389: alpar@389: check(preflow_test.flowValue() == min_cut_value, alpar@389: "The max flow value is not equal to the three min cut values."); alpar@389: alpar@389: FlowMap flow(g); alpar@389: for(ArcIt e(g); e!=INVALID; ++e) flow[e] = preflow_test.flowMap()[e]; alpar@389: alpar@389: int flow_value=preflow_test.flowValue(); alpar@389: alpar@389: for(ArcIt e(g); e!=INVALID; ++e) cap[e]=2*cap[e]; kpeter@392: preflow_test.init(flow); alpar@389: preflow_test.startFirstPhase(); alpar@389: alpar@389: CutMap min_cut1(g); alpar@389: preflow_test.minCutMap(min_cut1); alpar@389: min_cut_value=cutValue(g,min_cut1,cap); alpar@389: alpar@389: check(preflow_test.flowValue() == min_cut_value && alpar@389: min_cut_value == 2*flow_value, alpar@389: "The max flow value or the min cut value is wrong."); alpar@389: alpar@389: preflow_test.startSecondPhase(); alpar@389: alpar@389: check(checkFlow(g, preflow_test.flowMap(), cap, s, t), alpar@389: "The flow is not feasible."); alpar@389: alpar@389: CutMap min_cut2(g); alpar@389: preflow_test.minCutMap(min_cut2); alpar@389: min_cut_value=cutValue(g,min_cut2,cap); alpar@389: alpar@389: check(preflow_test.flowValue() == min_cut_value && alpar@389: min_cut_value == 2*flow_value, alpar@389: "The max flow value or the three min cut values were not doubled"); alpar@389: alpar@389: alpar@389: preflow_test.flowMap(flow); alpar@389: alpar@389: NodeIt tmp1(g,s); alpar@389: ++tmp1; alpar@389: if ( tmp1 != INVALID ) s=tmp1; alpar@389: alpar@389: NodeIt tmp2(g,t); alpar@389: ++tmp2; alpar@389: if ( tmp2 != INVALID ) t=tmp2; alpar@389: alpar@389: preflow_test.source(s); alpar@389: preflow_test.target(t); alpar@389: alpar@389: preflow_test.run(); alpar@389: alpar@389: CutMap min_cut3(g); alpar@389: preflow_test.minCutMap(min_cut3); alpar@389: min_cut_value=cutValue(g,min_cut3,cap); alpar@389: alpar@389: alpar@389: check(preflow_test.flowValue() == min_cut_value, alpar@389: "The max flow value or the three min cut values are incorrect."); alpar@389: alpar@901: initFlowTest(); alpar@927: alpar@389: return 0; alpar@389: }