1 | /* -*- mode: C++; indent-tabs-mode: nil; -*- |
---|
2 | * |
---|
3 | * This file is a part of LEMON, a generic C++ optimization library. |
---|
4 | * |
---|
5 | * Copyright (C) 2003-2009 |
---|
6 | * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
---|
7 | * (Egervary Research Group on Combinatorial Optimization, EGRES). |
---|
8 | * |
---|
9 | * Permission to use, modify and distribute this software is granted |
---|
10 | * provided that this copyright notice appears in all copies. For |
---|
11 | * precise terms see the accompanying LICENSE file. |
---|
12 | * |
---|
13 | * This software is provided "AS IS" with no warranty of any kind, |
---|
14 | * express or implied, and with no claim as to its suitability for any |
---|
15 | * purpose. |
---|
16 | * |
---|
17 | */ |
---|
18 | |
---|
19 | #include <iostream> |
---|
20 | |
---|
21 | #include "test_tools.h" |
---|
22 | #include <lemon/list_graph.h> |
---|
23 | #include <lemon/circulation.h> |
---|
24 | #include <lemon/lgf_reader.h> |
---|
25 | #include <lemon/concepts/digraph.h> |
---|
26 | #include <lemon/concepts/maps.h> |
---|
27 | |
---|
28 | using namespace lemon; |
---|
29 | |
---|
30 | char test_lgf[] = |
---|
31 | "@nodes\n" |
---|
32 | "label\n" |
---|
33 | "0\n" |
---|
34 | "1\n" |
---|
35 | "2\n" |
---|
36 | "3\n" |
---|
37 | "4\n" |
---|
38 | "5\n" |
---|
39 | "@arcs\n" |
---|
40 | " lcap ucap\n" |
---|
41 | "0 1 2 10\n" |
---|
42 | "0 2 2 6\n" |
---|
43 | "1 3 4 7\n" |
---|
44 | "1 4 0 5\n" |
---|
45 | "2 4 1 3\n" |
---|
46 | "3 5 3 8\n" |
---|
47 | "4 5 3 7\n" |
---|
48 | "@attributes\n" |
---|
49 | "source 0\n" |
---|
50 | "sink 5\n"; |
---|
51 | |
---|
52 | void checkCirculationCompile() |
---|
53 | { |
---|
54 | typedef int VType; |
---|
55 | typedef concepts::Digraph Digraph; |
---|
56 | |
---|
57 | typedef Digraph::Node Node; |
---|
58 | typedef Digraph::Arc Arc; |
---|
59 | typedef concepts::ReadMap<Arc,VType> CapMap; |
---|
60 | typedef concepts::ReadMap<Node,VType> SupplyMap; |
---|
61 | typedef concepts::ReadWriteMap<Arc,VType> FlowMap; |
---|
62 | typedef concepts::WriteMap<Node,bool> BarrierMap; |
---|
63 | |
---|
64 | typedef Elevator<Digraph, Digraph::Node> Elev; |
---|
65 | typedef LinkedElevator<Digraph, Digraph::Node> LinkedElev; |
---|
66 | |
---|
67 | Digraph g; |
---|
68 | Node n; |
---|
69 | Arc a; |
---|
70 | CapMap lcap, ucap; |
---|
71 | SupplyMap supply; |
---|
72 | FlowMap flow; |
---|
73 | BarrierMap bar; |
---|
74 | VType v; |
---|
75 | bool b; |
---|
76 | ignore_unused_variable_warning(v,b); |
---|
77 | |
---|
78 | typedef Circulation<Digraph, CapMap, CapMap, SupplyMap> |
---|
79 | ::SetFlowMap<FlowMap> |
---|
80 | ::SetElevator<Elev> |
---|
81 | ::SetStandardElevator<LinkedElev> |
---|
82 | ::Create CirculationType; |
---|
83 | CirculationType circ_test(g, lcap, ucap, supply); |
---|
84 | const CirculationType& const_circ_test = circ_test; |
---|
85 | |
---|
86 | circ_test |
---|
87 | .lowerMap(lcap) |
---|
88 | .upperMap(ucap) |
---|
89 | .supplyMap(supply) |
---|
90 | .flowMap(flow); |
---|
91 | |
---|
92 | circ_test.init(); |
---|
93 | circ_test.greedyInit(); |
---|
94 | circ_test.start(); |
---|
95 | circ_test.run(); |
---|
96 | |
---|
97 | v = const_circ_test.flow(a); |
---|
98 | const FlowMap& fm = const_circ_test.flowMap(); |
---|
99 | b = const_circ_test.barrier(n); |
---|
100 | const_circ_test.barrierMap(bar); |
---|
101 | |
---|
102 | ignore_unused_variable_warning(fm); |
---|
103 | } |
---|
104 | |
---|
105 | template <class G, class LM, class UM, class DM> |
---|
106 | void checkCirculation(const G& g, const LM& lm, const UM& um, |
---|
107 | const DM& dm, bool find) |
---|
108 | { |
---|
109 | Circulation<G, LM, UM, DM> circ(g, lm, um, dm); |
---|
110 | bool ret = circ.run(); |
---|
111 | if (find) { |
---|
112 | check(ret, "A feasible solution should have been found."); |
---|
113 | check(circ.checkFlow(), "The found flow is corrupt."); |
---|
114 | check(!circ.checkBarrier(), "A barrier should not have been found."); |
---|
115 | } else { |
---|
116 | check(!ret, "A feasible solution should not have been found."); |
---|
117 | check(circ.checkBarrier(), "The found barrier is corrupt."); |
---|
118 | } |
---|
119 | } |
---|
120 | |
---|
121 | int main (int, char*[]) |
---|
122 | { |
---|
123 | typedef ListDigraph Digraph; |
---|
124 | DIGRAPH_TYPEDEFS(Digraph); |
---|
125 | |
---|
126 | Digraph g; |
---|
127 | IntArcMap lo(g), up(g); |
---|
128 | IntNodeMap delta(g, 0); |
---|
129 | Node s, t; |
---|
130 | |
---|
131 | std::istringstream input(test_lgf); |
---|
132 | DigraphReader<Digraph>(g,input). |
---|
133 | arcMap("lcap", lo). |
---|
134 | arcMap("ucap", up). |
---|
135 | node("source",s). |
---|
136 | node("sink",t). |
---|
137 | run(); |
---|
138 | |
---|
139 | delta[s] = 7; delta[t] = -7; |
---|
140 | checkCirculation(g, lo, up, delta, true); |
---|
141 | |
---|
142 | delta[s] = 13; delta[t] = -13; |
---|
143 | checkCirculation(g, lo, up, delta, true); |
---|
144 | |
---|
145 | delta[s] = 6; delta[t] = -6; |
---|
146 | checkCirculation(g, lo, up, delta, false); |
---|
147 | |
---|
148 | delta[s] = 14; delta[t] = -14; |
---|
149 | checkCirculation(g, lo, up, delta, false); |
---|
150 | |
---|
151 | delta[s] = 7; delta[t] = -13; |
---|
152 | checkCirculation(g, lo, up, delta, true); |
---|
153 | |
---|
154 | delta[s] = 5; delta[t] = -15; |
---|
155 | checkCirculation(g, lo, up, delta, true); |
---|
156 | |
---|
157 | delta[s] = 10; delta[t] = -11; |
---|
158 | checkCirculation(g, lo, up, delta, true); |
---|
159 | |
---|
160 | delta[s] = 11; delta[t] = -10; |
---|
161 | checkCirculation(g, lo, up, delta, false); |
---|
162 | |
---|
163 | return 0; |
---|
164 | } |
---|