|
marci@174
|
1 |
// -*- c++ -*-
|
|
marci@76
|
2 |
#ifndef GRAPH_WRAPPER_H
|
|
marci@76
|
3 |
#define GRAPH_WRAPPER_H
|
|
marci@76
|
4 |
|
|
marci@174
|
5 |
#include <invalid.h>
|
|
marci@174
|
6 |
|
|
alpar@105
|
7 |
namespace hugo {
|
|
marci@76
|
8 |
|
|
marci@76
|
9 |
template<typename Graph>
|
|
marci@76
|
10 |
class TrivGraphWrapper {
|
|
marci@199
|
11 |
protected:
|
|
marci@76
|
12 |
Graph* graph;
|
|
marci@76
|
13 |
|
|
marci@76
|
14 |
public:
|
|
marci@76
|
15 |
typedef Graph BaseGraph;
|
|
marci@76
|
16 |
|
|
marci@174
|
17 |
typedef typename Graph::Node Node;
|
|
marci@76
|
18 |
typedef typename Graph::NodeIt NodeIt;
|
|
marci@76
|
19 |
|
|
marci@174
|
20 |
typedef typename Graph::Edge Edge;
|
|
marci@76
|
21 |
typedef typename Graph::OutEdgeIt OutEdgeIt;
|
|
marci@76
|
22 |
typedef typename Graph::InEdgeIt InEdgeIt;
|
|
marci@155
|
23 |
//typedef typename Graph::SymEdgeIt SymEdgeIt;
|
|
marci@174
|
24 |
typedef typename Graph::EdgeIt EdgeIt;
|
|
marci@168
|
25 |
|
|
marci@168
|
26 |
//TrivGraphWrapper() : graph(0) { }
|
|
marci@168
|
27 |
TrivGraphWrapper(Graph& _graph) : graph(&_graph) { }
|
|
marci@168
|
28 |
|
|
marci@168
|
29 |
void setGraph(Graph& _graph) { graph = &_graph; }
|
|
marci@168
|
30 |
Graph& getGraph() const { return (*graph); }
|
|
marci@76
|
31 |
|
|
marci@212
|
32 |
template<typename I> I& first(I& i) const { return graph->first(i); }
|
|
marci@212
|
33 |
template<typename I, typename P> I& first(I& i, const P& p) const {
|
|
marci@212
|
34 |
return graph->first(i, p); }
|
|
marci@155
|
35 |
|
|
marci@155
|
36 |
template<typename I> I getNext(const I& i) const {
|
|
marci@155
|
37 |
return graph->getNext(i); }
|
|
marci@155
|
38 |
template<typename I> I& next(I &i) const { return graph->next(i); }
|
|
marci@76
|
39 |
|
|
marci@76
|
40 |
template< typename It > It first() const {
|
|
marci@212
|
41 |
It e; first(e); return e; }
|
|
marci@76
|
42 |
|
|
marci@174
|
43 |
template< typename It > It first(const Node& v) const {
|
|
marci@212
|
44 |
It e; first(e, v); return e; }
|
|
marci@76
|
45 |
|
|
marci@174
|
46 |
Node head(const Edge& e) const { return graph->head(e); }
|
|
marci@174
|
47 |
Node tail(const Edge& e) const { return graph->tail(e); }
|
|
marci@155
|
48 |
|
|
marci@155
|
49 |
template<typename I> bool valid(const I& i) const
|
|
marci@155
|
50 |
{ return graph->valid(i); }
|
|
marci@155
|
51 |
|
|
marci@155
|
52 |
//template<typename I> void setInvalid(const I &i);
|
|
marci@155
|
53 |
//{ return graph->setInvalid(i); }
|
|
marci@155
|
54 |
|
|
marci@155
|
55 |
int nodeNum() const { return graph->nodeNum(); }
|
|
marci@155
|
56 |
int edgeNum() const { return graph->edgeNum(); }
|
|
marci@76
|
57 |
|
|
marci@174
|
58 |
template<typename I> Node aNode(const I& e) const {
|
|
marci@76
|
59 |
return graph->aNode(e); }
|
|
marci@174
|
60 |
template<typename I> Node bNode(const I& e) const {
|
|
marci@76
|
61 |
return graph->bNode(e); }
|
|
marci@76
|
62 |
|
|
marci@174
|
63 |
Node addNode() const { return graph->addNode(); }
|
|
marci@174
|
64 |
Edge addEdge(const Node& tail, const Node& head) const {
|
|
marci@76
|
65 |
return graph->addEdge(tail, head); }
|
|
marci@76
|
66 |
|
|
marci@76
|
67 |
template<typename I> void erase(const I& i) const { graph->erase(i); }
|
|
marci@76
|
68 |
|
|
marci@76
|
69 |
void clear() const { graph->clear(); }
|
|
marci@155
|
70 |
|
|
marci@76
|
71 |
template<typename T> class NodeMap : public Graph::NodeMap<T> {
|
|
marci@76
|
72 |
public:
|
|
marci@155
|
73 |
NodeMap(const TrivGraphWrapper<Graph>& _G) :
|
|
marci@158
|
74 |
Graph::NodeMap<T>(_G.getGraph()) { }
|
|
marci@155
|
75 |
NodeMap(const TrivGraphWrapper<Graph>& _G, T a) :
|
|
marci@158
|
76 |
Graph::NodeMap<T>(_G.getGraph(), a) { }
|
|
marci@76
|
77 |
};
|
|
marci@168
|
78 |
|
|
marci@155
|
79 |
template<typename T> class EdgeMap : public Graph::EdgeMap<T> {
|
|
marci@155
|
80 |
public:
|
|
marci@155
|
81 |
EdgeMap(const TrivGraphWrapper<Graph>& _G) :
|
|
marci@158
|
82 |
Graph::EdgeMap<T>(_G.getGraph()) { }
|
|
marci@155
|
83 |
EdgeMap(const TrivGraphWrapper<Graph>& _G, T a) :
|
|
marci@158
|
84 |
Graph::EdgeMap<T>(_G.getGraph(), a) { }
|
|
marci@155
|
85 |
};
|
|
marci@76
|
86 |
};
|
|
marci@76
|
87 |
|
|
marci@212
|
88 |
template<typename GraphWrapper>
|
|
marci@212
|
89 |
class GraphWrapperSkeleton {
|
|
marci@212
|
90 |
protected:
|
|
marci@212
|
91 |
GraphWrapper gw;
|
|
marci@212
|
92 |
|
|
marci@212
|
93 |
public:
|
|
marci@212
|
94 |
typedef typename GraphWrapper::BaseGraph BaseGraph;
|
|
marci@212
|
95 |
|
|
marci@212
|
96 |
typedef typename GraphWrapper::Node Node;
|
|
marci@212
|
97 |
typedef typename GraphWrapper::NodeIt NodeIt;
|
|
marci@212
|
98 |
|
|
marci@212
|
99 |
typedef typename GraphWrapper::Edge Edge;
|
|
marci@212
|
100 |
typedef typename GraphWrapper::OutEdgeIt OutEdgeIt;
|
|
marci@212
|
101 |
typedef typename GraphWrapper::InEdgeIt InEdgeIt;
|
|
marci@212
|
102 |
//typedef typename GraphWrapper::SymEdgeIt SymEdgeIt;
|
|
marci@212
|
103 |
typedef typename GraphWrapper::EdgeIt EdgeIt;
|
|
marci@212
|
104 |
|
|
marci@212
|
105 |
//GraphWrapperSkeleton() : gw() { }
|
|
marci@230
|
106 |
GraphWrapperSkeleton(GraphWrapper _gw) : gw(_gw) { }
|
|
marci@212
|
107 |
|
|
marci@212
|
108 |
void setGraph(BaseGraph& _graph) { gw.setGraph(_graph); }
|
|
marci@212
|
109 |
BaseGraph& getGraph() const { return gw.getGraph(); }
|
|
marci@212
|
110 |
|
|
marci@212
|
111 |
template<typename I> I& first(I& i) const { return gw.first(i); }
|
|
marci@212
|
112 |
template<typename I, typename P> I& first(I& i, const P& p) const {
|
|
marci@212
|
113 |
return gw.first(i, p); }
|
|
marci@212
|
114 |
|
|
marci@212
|
115 |
template<typename I> I getNext(const I& i) const { return gw.getNext(i); }
|
|
marci@212
|
116 |
template<typename I> I& next(I &i) const { return gw.next(i); }
|
|
marci@212
|
117 |
|
|
marci@212
|
118 |
template< typename It > It first() const {
|
|
marci@212
|
119 |
It e; this->first(e); return e; }
|
|
marci@212
|
120 |
|
|
marci@212
|
121 |
template< typename It > It first(const Node& v) const {
|
|
marci@212
|
122 |
It e; this->first(e, v); return e; }
|
|
marci@212
|
123 |
|
|
marci@212
|
124 |
Node head(const Edge& e) const { return gw.head(e); }
|
|
marci@212
|
125 |
Node tail(const Edge& e) const { return gw.tail(e); }
|
|
marci@212
|
126 |
|
|
marci@212
|
127 |
template<typename I> bool valid(const I& i) const { return gw.valid(i); }
|
|
marci@212
|
128 |
|
|
marci@212
|
129 |
//template<typename I> void setInvalid(const I &i);
|
|
marci@212
|
130 |
//{ return graph->setInvalid(i); }
|
|
marci@212
|
131 |
|
|
marci@212
|
132 |
int nodeNum() const { return gw.nodeNum(); }
|
|
marci@212
|
133 |
int edgeNum() const { return gw.edgeNum(); }
|
|
marci@212
|
134 |
|
|
marci@212
|
135 |
template<typename I> Node aNode(const I& e) const { return gw.aNode(e); }
|
|
marci@212
|
136 |
template<typename I> Node bNode(const I& e) const { return gw.bNode(e); }
|
|
marci@212
|
137 |
|
|
marci@212
|
138 |
Node addNode() const { return gw.addNode(); }
|
|
marci@212
|
139 |
Edge addEdge(const Node& tail, const Node& head) const {
|
|
marci@212
|
140 |
return gw.addEdge(tail, head); }
|
|
marci@212
|
141 |
|
|
marci@212
|
142 |
template<typename I> void erase(const I& i) const { gw.erase(i); }
|
|
marci@212
|
143 |
|
|
marci@212
|
144 |
void clear() const { gw.clear(); }
|
|
marci@212
|
145 |
|
|
marci@212
|
146 |
template<typename T> class NodeMap : public GraphWrapper::NodeMap<T> {
|
|
marci@212
|
147 |
public:
|
|
marci@212
|
148 |
NodeMap(const GraphWrapperSkeleton<GraphWrapper>& _G) :
|
|
marci@212
|
149 |
GraphWrapper::NodeMap<T>(_G.gw) { }
|
|
marci@212
|
150 |
NodeMap(const GraphWrapperSkeleton<GraphWrapper>& _G, T a) :
|
|
marci@212
|
151 |
GraphWrapper::NodeMap<T>(_G.gw, a) { }
|
|
marci@212
|
152 |
};
|
|
marci@212
|
153 |
|
|
marci@212
|
154 |
template<typename T> class EdgeMap : public GraphWrapper::EdgeMap<T> {
|
|
marci@212
|
155 |
public:
|
|
marci@212
|
156 |
EdgeMap(const GraphWrapperSkeleton<GraphWrapper>& _G) :
|
|
marci@212
|
157 |
GraphWrapper::EdgeMap<T>(_G.gw) { }
|
|
marci@212
|
158 |
EdgeMap(const GraphWrapperSkeleton<GraphWrapper>& _G, T a) :
|
|
marci@212
|
159 |
GraphWrapper::EdgeMap<T>(_G.gw, a) { }
|
|
marci@212
|
160 |
};
|
|
marci@212
|
161 |
};
|
|
marci@212
|
162 |
|
|
marci@230
|
163 |
// template<typename Graph>
|
|
marci@230
|
164 |
// class RevGraphWrapper
|
|
marci@230
|
165 |
// {
|
|
marci@230
|
166 |
// protected:
|
|
marci@230
|
167 |
// Graph* graph;
|
|
marci@230
|
168 |
|
|
marci@230
|
169 |
// public:
|
|
marci@230
|
170 |
// typedef Graph BaseGraph;
|
|
marci@230
|
171 |
|
|
marci@230
|
172 |
// typedef typename Graph::Node Node;
|
|
marci@230
|
173 |
// typedef typename Graph::NodeIt NodeIt;
|
|
marci@230
|
174 |
|
|
marci@230
|
175 |
// typedef typename Graph::Edge Edge;
|
|
marci@230
|
176 |
// typedef typename Graph::OutEdgeIt InEdgeIt;
|
|
marci@230
|
177 |
// typedef typename Graph::InEdgeIt OutEdgeIt;
|
|
marci@230
|
178 |
// //typedef typename Graph::SymEdgeIt SymEdgeIt;
|
|
marci@230
|
179 |
// typedef typename Graph::EdgeIt EdgeIt;
|
|
marci@230
|
180 |
|
|
marci@230
|
181 |
// //RevGraphWrapper() : graph(0) { }
|
|
marci@230
|
182 |
// RevGraphWrapper(Graph& _graph) : graph(&_graph) { }
|
|
marci@230
|
183 |
|
|
marci@230
|
184 |
// void setGraph(Graph& _graph) { graph = &_graph; }
|
|
marci@230
|
185 |
// Graph& getGraph() const { return (*graph); }
|
|
marci@230
|
186 |
|
|
marci@230
|
187 |
// template<typename I> I& first(I& i) const { return graph->first(i); }
|
|
marci@230
|
188 |
// template<typename I, typename P> I& first(I& i, const P& p) const {
|
|
marci@230
|
189 |
// return graph->first(i, p); }
|
|
marci@230
|
190 |
|
|
marci@230
|
191 |
// template<typename I> I getNext(const I& i) const {
|
|
marci@230
|
192 |
// return graph->getNext(i); }
|
|
marci@230
|
193 |
// template<typename I> I& next(I &i) const { return graph->next(i); }
|
|
marci@230
|
194 |
|
|
marci@230
|
195 |
// template< typename It > It first() const {
|
|
marci@230
|
196 |
// It e; first(e); return e; }
|
|
marci@230
|
197 |
|
|
marci@230
|
198 |
// template< typename It > It first(const Node& v) const {
|
|
marci@230
|
199 |
// It e; first(e, v); return e; }
|
|
marci@230
|
200 |
|
|
marci@230
|
201 |
// Node head(const Edge& e) const { return graph->tail(e); }
|
|
marci@230
|
202 |
// Node tail(const Edge& e) const { return graph->head(e); }
|
|
marci@230
|
203 |
|
|
marci@230
|
204 |
// template<typename I> bool valid(const I& i) const
|
|
marci@230
|
205 |
// { return graph->valid(i); }
|
|
marci@230
|
206 |
|
|
marci@230
|
207 |
// //template<typename I> void setInvalid(const I &i);
|
|
marci@230
|
208 |
// //{ return graph->setInvalid(i); }
|
|
marci@230
|
209 |
|
|
marci@230
|
210 |
// template<typename I> Node aNode(const I& e) const {
|
|
marci@230
|
211 |
// return graph->aNode(e); }
|
|
marci@230
|
212 |
// template<typename I> Node bNode(const I& e) const {
|
|
marci@230
|
213 |
// return graph->bNode(e); }
|
|
marci@230
|
214 |
|
|
marci@230
|
215 |
// Node addNode() const { return graph->addNode(); }
|
|
marci@230
|
216 |
// Edge addEdge(const Node& tail, const Node& head) const {
|
|
marci@230
|
217 |
// return graph->addEdge(tail, head); }
|
|
marci@230
|
218 |
|
|
marci@230
|
219 |
// int nodeNum() const { return graph->nodeNum(); }
|
|
marci@230
|
220 |
// int edgeNum() const { return graph->edgeNum(); }
|
|
marci@230
|
221 |
|
|
marci@230
|
222 |
// template<typename I> void erase(const I& i) const { graph->erase(i); }
|
|
marci@230
|
223 |
|
|
marci@230
|
224 |
// void clear() const { graph->clear(); }
|
|
marci@230
|
225 |
|
|
marci@230
|
226 |
// template<typename T> class NodeMap : public Graph::NodeMap<T> {
|
|
marci@230
|
227 |
// public:
|
|
marci@230
|
228 |
// NodeMap(const RevGraphWrapper<Graph>& _G) :
|
|
marci@230
|
229 |
// Graph::NodeMap<T>(_G.getGraph()) { }
|
|
marci@230
|
230 |
// NodeMap(const RevGraphWrapper<Graph>& _G, T a) :
|
|
marci@230
|
231 |
// Graph::NodeMap<T>(_G.getGraph(), a) { }
|
|
marci@230
|
232 |
// };
|
|
marci@230
|
233 |
|
|
marci@230
|
234 |
// template<typename T> class EdgeMap : public Graph::EdgeMap<T> {
|
|
marci@230
|
235 |
// public:
|
|
marci@230
|
236 |
// EdgeMap(const RevGraphWrapper<Graph>& _G) :
|
|
marci@230
|
237 |
// Graph::EdgeMap<T>(_G.getGraph()) { }
|
|
marci@230
|
238 |
// EdgeMap(const RevGraphWrapper<Graph>& _G, T a) :
|
|
marci@230
|
239 |
// Graph::EdgeMap<T>(_G.getGraph(), a) { }
|
|
marci@230
|
240 |
// };
|
|
marci@230
|
241 |
// };
|
|
marci@230
|
242 |
|
|
marci@76
|
243 |
template<typename Graph>
|
|
marci@230
|
244 |
class RevGraphWrapper :
|
|
marci@230
|
245 |
public GraphWrapperSkeleton< TrivGraphWrapper<Graph> > {
|
|
marci@199
|
246 |
protected:
|
|
marci@230
|
247 |
//Graph* graph;
|
|
marci@230
|
248 |
|
|
marci@230
|
249 |
public:
|
|
marci@230
|
250 |
//typedef Graph BaseGraph;
|
|
marci@230
|
251 |
|
|
marci@230
|
252 |
//typedef typename Graph::Node Node;
|
|
marci@230
|
253 |
//typedef typename Graph::NodeIt NodeIt;
|
|
marci@76
|
254 |
|
|
marci@230
|
255 |
//typedef typename Graph::Edge Edge;
|
|
marci@230
|
256 |
typedef typename GraphWrapperSkeleton< TrivGraphWrapper<Graph> >::OutEdgeIt InEdgeIt;
|
|
marci@230
|
257 |
typedef typename GraphWrapperSkeleton< TrivGraphWrapper<Graph> >::InEdgeIt OutEdgeIt;
|
|
marci@155
|
258 |
//typedef typename Graph::SymEdgeIt SymEdgeIt;
|
|
marci@230
|
259 |
//typedef typename Graph::EdgeIt EdgeIt;
|
|
marci@168
|
260 |
|
|
marci@168
|
261 |
//RevGraphWrapper() : graph(0) { }
|
|
marci@230
|
262 |
RevGraphWrapper(Graph& _graph) : GraphWrapperSkeleton< TrivGraphWrapper<Graph> >(TrivGraphWrapper<Graph>(_graph)) { }
|
|
marci@230
|
263 |
|
|
marci@230
|
264 |
//void setGraph(Graph& _graph) { graph = &_graph; }
|
|
marci@230
|
265 |
//Graph& getGraph() const { return (*graph); }
|
|
marci@230
|
266 |
|
|
marci@230
|
267 |
//template<typename I> I& first(I& i) const { return graph->first(i); }
|
|
marci@230
|
268 |
//template<typename I, typename P> I& first(I& i, const P& p) const {
|
|
marci@230
|
269 |
// return graph->first(i, p); }
|
|
marci@168
|
270 |
|
|
marci@230
|
271 |
//template<typename I> I getNext(const I& i) const {
|
|
marci@230
|
272 |
// return graph->getNext(i); }
|
|
marci@230
|
273 |
//template<typename I> I& next(I &i) const { return graph->next(i); }
|
|
marci@155
|
274 |
|
|
marci@230
|
275 |
//template< typename It > It first() const {
|
|
marci@230
|
276 |
// It e; first(e); return e; }
|
|
marci@76
|
277 |
|
|
marci@230
|
278 |
//template< typename It > It first(const Node& v) const {
|
|
marci@230
|
279 |
// It e; first(e, v); return e; }
|
|
marci@76
|
280 |
|
|
marci@230
|
281 |
//Node head(const Edge& e) const { return graph->tail(e); }
|
|
marci@230
|
282 |
//Node tail(const Edge& e) const { return graph->head(e); }
|
|
marci@76
|
283 |
|
|
marci@230
|
284 |
//template<typename I> bool valid(const I& i) const
|
|
marci@230
|
285 |
// { return graph->valid(i); }
|
|
marci@155
|
286 |
|
|
marci@155
|
287 |
//template<typename I> void setInvalid(const I &i);
|
|
marci@155
|
288 |
//{ return graph->setInvalid(i); }
|
|
marci@155
|
289 |
|
|
marci@230
|
290 |
//template<typename I> Node aNode(const I& e) const {
|
|
marci@230
|
291 |
// return graph->aNode(e); }
|
|
marci@230
|
292 |
//template<typename I> Node bNode(const I& e) const {
|
|
marci@230
|
293 |
// return graph->bNode(e); }
|
|
marci@155
|
294 |
|
|
marci@230
|
295 |
//Node addNode() const { return graph->addNode(); }
|
|
marci@230
|
296 |
//Edge addEdge(const Node& tail, const Node& head) const {
|
|
marci@230
|
297 |
// return graph->addEdge(tail, head); }
|
|
marci@76
|
298 |
|
|
marci@230
|
299 |
//int nodeNum() const { return graph->nodeNum(); }
|
|
marci@230
|
300 |
//int edgeNum() const { return graph->edgeNum(); }
|
|
marci@76
|
301 |
|
|
marci@230
|
302 |
//template<typename I> void erase(const I& i) const { graph->erase(i); }
|
|
marci@76
|
303 |
|
|
marci@230
|
304 |
//void clear() const { graph->clear(); }
|
|
marci@155
|
305 |
|
|
marci@230
|
306 |
template<typename T> class NodeMap :
|
|
marci@230
|
307 |
public GraphWrapperSkeleton< TrivGraphWrapper<Graph> >::NodeMap<T>
|
|
marci@230
|
308 |
{
|
|
marci@155
|
309 |
public:
|
|
marci@155
|
310 |
NodeMap(const RevGraphWrapper<Graph>& _G) :
|
|
marci@230
|
311 |
GraphWrapperSkeleton< TrivGraphWrapper<Graph> >::NodeMap<T>(_G) { }
|
|
marci@155
|
312 |
NodeMap(const RevGraphWrapper<Graph>& _G, T a) :
|
|
marci@230
|
313 |
GraphWrapperSkeleton< TrivGraphWrapper<Graph> >::NodeMap<T>(_G, a) { }
|
|
marci@155
|
314 |
};
|
|
marci@230
|
315 |
|
|
marci@230
|
316 |
template<typename T> class EdgeMap :
|
|
marci@230
|
317 |
public GraphWrapperSkeleton< TrivGraphWrapper<Graph> >::EdgeMap<T> {
|
|
marci@155
|
318 |
public:
|
|
marci@155
|
319 |
EdgeMap(const RevGraphWrapper<Graph>& _G) :
|
|
marci@230
|
320 |
GraphWrapperSkeleton< TrivGraphWrapper<Graph> >::EdgeMap<T>(_G) { }
|
|
marci@155
|
321 |
EdgeMap(const RevGraphWrapper<Graph>& _G, T a) :
|
|
marci@230
|
322 |
GraphWrapperSkeleton< TrivGraphWrapper<Graph> >::EdgeMap<T>(_G, a) { }
|
|
marci@155
|
323 |
};
|
|
marci@76
|
324 |
};
|
|
marci@76
|
325 |
|
|
marci@155
|
326 |
|
|
marci@230
|
327 |
|
|
marci@230
|
328 |
|
|
marci@230
|
329 |
|
|
marci@158
|
330 |
template<typename Graph>
|
|
marci@158
|
331 |
class UndirGraphWrapper {
|
|
marci@199
|
332 |
protected:
|
|
marci@158
|
333 |
Graph* graph;
|
|
marci@158
|
334 |
|
|
marci@158
|
335 |
public:
|
|
marci@158
|
336 |
typedef Graph BaseGraph;
|
|
marci@158
|
337 |
|
|
marci@174
|
338 |
typedef typename Graph::Node Node;
|
|
marci@158
|
339 |
typedef typename Graph::NodeIt NodeIt;
|
|
marci@158
|
340 |
|
|
marci@174
|
341 |
//typedef typename Graph::Edge Edge;
|
|
marci@158
|
342 |
//typedef typename Graph::OutEdgeIt OutEdgeIt;
|
|
marci@158
|
343 |
//typedef typename Graph::InEdgeIt InEdgeIt;
|
|
marci@158
|
344 |
//typedef typename Graph::SymEdgeIt SymEdgeIt;
|
|
marci@174
|
345 |
//typedef typename Graph::EdgeIt EdgeIt;
|
|
marci@158
|
346 |
|
|
marci@158
|
347 |
//private:
|
|
marci@174
|
348 |
typedef typename Graph::Edge GraphEdge;
|
|
marci@158
|
349 |
typedef typename Graph::OutEdgeIt GraphOutEdgeIt;
|
|
marci@158
|
350 |
typedef typename Graph::InEdgeIt GraphInEdgeIt;
|
|
marci@158
|
351 |
//public:
|
|
marci@158
|
352 |
|
|
marci@168
|
353 |
//UndirGraphWrapper() : graph(0) { }
|
|
marci@168
|
354 |
UndirGraphWrapper(Graph& _graph) : graph(&_graph) { }
|
|
marci@168
|
355 |
|
|
marci@168
|
356 |
void setGraph(Graph& _graph) { graph = &_graph; }
|
|
marci@168
|
357 |
Graph& getGraph() const { return (*graph); }
|
|
marci@168
|
358 |
|
|
marci@174
|
359 |
class Edge {
|
|
marci@158
|
360 |
friend class UndirGraphWrapper<Graph>;
|
|
marci@158
|
361 |
bool out_or_in; //true iff out
|
|
marci@158
|
362 |
GraphOutEdgeIt out;
|
|
marci@158
|
363 |
GraphInEdgeIt in;
|
|
marci@158
|
364 |
public:
|
|
marci@174
|
365 |
Edge() : out_or_in(), out(), in() { }
|
|
marci@174
|
366 |
Edge(const Invalid& i) : out_or_in(false), out(), in(i) { }
|
|
marci@174
|
367 |
operator GraphEdge() const {
|
|
marci@158
|
368 |
if (out_or_in) return(out); else return(in);
|
|
marci@158
|
369 |
}
|
|
marci@174
|
370 |
friend bool operator==(const Edge& u, const Edge& v) {
|
|
marci@174
|
371 |
if (v.out_or_in)
|
|
marci@174
|
372 |
return (u.out_or_in && u.out==v.out);
|
|
marci@174
|
373 |
else
|
|
marci@174
|
374 |
return (!u.out_or_in && u.in==v.in);
|
|
marci@174
|
375 |
}
|
|
marci@174
|
376 |
friend bool operator!=(const Edge& u, const Edge& v) {
|
|
marci@174
|
377 |
if (v.out_or_in)
|
|
marci@174
|
378 |
return (!u.out_or_in || u.out!=v.out);
|
|
marci@174
|
379 |
else
|
|
marci@174
|
380 |
return (u.out_or_in || u.in!=v.in);
|
|
marci@174
|
381 |
}
|
|
marci@158
|
382 |
};
|
|
marci@158
|
383 |
|
|
marci@174
|
384 |
class OutEdgeIt : public Edge {
|
|
marci@158
|
385 |
friend class UndirGraphWrapper<Graph>;
|
|
marci@158
|
386 |
public:
|
|
marci@174
|
387 |
OutEdgeIt() : Edge() { }
|
|
marci@174
|
388 |
OutEdgeIt(const Invalid& i) : Edge(i) { }
|
|
marci@174
|
389 |
OutEdgeIt(const UndirGraphWrapper& _G, const Node& n) : Edge() {
|
|
marci@174
|
390 |
out_or_in=true;
|
|
marci@212
|
391 |
_G.graph->first(out, n);
|
|
marci@158
|
392 |
if (!(_G.graph->valid(out))) {
|
|
marci@158
|
393 |
out_or_in=false;
|
|
marci@212
|
394 |
_G.graph->first(in, n);
|
|
marci@158
|
395 |
}
|
|
marci@158
|
396 |
}
|
|
marci@158
|
397 |
};
|
|
marci@158
|
398 |
|
|
marci@212
|
399 |
OutEdgeIt& first(OutEdgeIt& e, const Node& n) const {
|
|
marci@158
|
400 |
e.out_or_in=true;
|
|
marci@212
|
401 |
graph->first(e.out, n);
|
|
marci@158
|
402 |
if (!(graph->valid(e.out))) {
|
|
marci@158
|
403 |
e.out_or_in=false;
|
|
marci@212
|
404 |
graph->first(e.in, n);
|
|
marci@158
|
405 |
}
|
|
marci@158
|
406 |
return e;
|
|
marci@158
|
407 |
}
|
|
marci@158
|
408 |
|
|
marci@158
|
409 |
OutEdgeIt& next(OutEdgeIt& e) const {
|
|
marci@158
|
410 |
if (e.out_or_in) {
|
|
marci@174
|
411 |
Node n=graph->tail(e.out);
|
|
marci@158
|
412 |
graph->next(e.out);
|
|
marci@158
|
413 |
if (!graph->valid(e.out)) {
|
|
marci@158
|
414 |
e.out_or_in=false;
|
|
marci@212
|
415 |
graph->first(e.in, n);
|
|
marci@158
|
416 |
}
|
|
marci@158
|
417 |
} else {
|
|
marci@158
|
418 |
graph->next(e.in);
|
|
marci@158
|
419 |
}
|
|
marci@158
|
420 |
return e;
|
|
marci@158
|
421 |
}
|
|
marci@158
|
422 |
|
|
marci@174
|
423 |
Node aNode(const OutEdgeIt& e) const {
|
|
marci@158
|
424 |
if (e.out_or_in) return graph->tail(e); else return graph->head(e); }
|
|
marci@174
|
425 |
Node bNode(const OutEdgeIt& e) const {
|
|
marci@158
|
426 |
if (e.out_or_in) return graph->head(e); else return graph->tail(e); }
|
|
marci@158
|
427 |
|
|
marci@158
|
428 |
typedef OutEdgeIt InEdgeIt;
|
|
marci@158
|
429 |
|
|
marci@212
|
430 |
template<typename I> I& first(I& i) const { return graph->first(i); }
|
|
marci@212
|
431 |
// template<typename I, typename P> I& first(I& i, const P& p) const {
|
|
marci@212
|
432 |
// return graph->first(i, p); }
|
|
marci@158
|
433 |
|
|
marci@158
|
434 |
template<typename I> I getNext(const I& i) const {
|
|
marci@158
|
435 |
return graph->getNext(i); }
|
|
marci@158
|
436 |
template<typename I> I& next(I &i) const { return graph->next(i); }
|
|
marci@158
|
437 |
|
|
marci@158
|
438 |
template< typename It > It first() const {
|
|
marci@212
|
439 |
It e; first(e); return e; }
|
|
marci@158
|
440 |
|
|
marci@174
|
441 |
template< typename It > It first(const Node& v) const {
|
|
marci@212
|
442 |
It e; first(e, v); return e; }
|
|
marci@158
|
443 |
|
|
marci@174
|
444 |
Node head(const Edge& e) const { return graph->head(e); }
|
|
marci@174
|
445 |
Node tail(const Edge& e) const { return graph->tail(e); }
|
|
marci@158
|
446 |
|
|
marci@158
|
447 |
template<typename I> bool valid(const I& i) const
|
|
marci@158
|
448 |
{ return graph->valid(i); }
|
|
marci@158
|
449 |
|
|
marci@158
|
450 |
//template<typename I> void setInvalid(const I &i);
|
|
marci@158
|
451 |
//{ return graph->setInvalid(i); }
|
|
marci@158
|
452 |
|
|
marci@158
|
453 |
int nodeNum() const { return graph->nodeNum(); }
|
|
marci@158
|
454 |
int edgeNum() const { return graph->edgeNum(); }
|
|
marci@158
|
455 |
|
|
marci@174
|
456 |
// template<typename I> Node aNode(const I& e) const {
|
|
marci@158
|
457 |
// return graph->aNode(e); }
|
|
marci@174
|
458 |
// template<typename I> Node bNode(const I& e) const {
|
|
marci@158
|
459 |
// return graph->bNode(e); }
|
|
marci@158
|
460 |
|
|
marci@174
|
461 |
Node addNode() const { return graph->addNode(); }
|
|
marci@174
|
462 |
Edge addEdge(const Node& tail, const Node& head) const {
|
|
marci@158
|
463 |
return graph->addEdge(tail, head); }
|
|
marci@158
|
464 |
|
|
marci@158
|
465 |
template<typename I> void erase(const I& i) const { graph->erase(i); }
|
|
marci@158
|
466 |
|
|
marci@158
|
467 |
void clear() const { graph->clear(); }
|
|
marci@158
|
468 |
|
|
marci@158
|
469 |
template<typename T> class NodeMap : public Graph::NodeMap<T> {
|
|
marci@158
|
470 |
public:
|
|
marci@158
|
471 |
NodeMap(const UndirGraphWrapper<Graph>& _G) :
|
|
marci@158
|
472 |
Graph::NodeMap<T>(_G.getGraph()) { }
|
|
marci@158
|
473 |
NodeMap(const UndirGraphWrapper<Graph>& _G, T a) :
|
|
marci@158
|
474 |
Graph::NodeMap<T>(_G.getGraph(), a) { }
|
|
marci@158
|
475 |
};
|
|
marci@168
|
476 |
|
|
marci@158
|
477 |
template<typename T> class EdgeMap : public Graph::EdgeMap<T> {
|
|
marci@158
|
478 |
public:
|
|
marci@158
|
479 |
EdgeMap(const UndirGraphWrapper<Graph>& _G) :
|
|
marci@158
|
480 |
Graph::EdgeMap<T>(_G.getGraph()) { }
|
|
marci@158
|
481 |
EdgeMap(const UndirGraphWrapper<Graph>& _G, T a) :
|
|
marci@158
|
482 |
Graph::EdgeMap<T>(_G.getGraph(), a) { }
|
|
marci@158
|
483 |
};
|
|
marci@158
|
484 |
};
|
|
marci@158
|
485 |
|
|
marci@158
|
486 |
|
|
marci@158
|
487 |
|
|
marci@155
|
488 |
// template<typename Graph>
|
|
marci@155
|
489 |
// class SymGraphWrapper
|
|
marci@155
|
490 |
// {
|
|
marci@155
|
491 |
// Graph* graph;
|
|
marci@76
|
492 |
|
|
marci@155
|
493 |
// public:
|
|
marci@155
|
494 |
// typedef Graph BaseGraph;
|
|
marci@155
|
495 |
|
|
marci@174
|
496 |
// typedef typename Graph::Node Node;
|
|
marci@174
|
497 |
// typedef typename Graph::Edge Edge;
|
|
marci@174
|
498 |
|
|
marci@155
|
499 |
// typedef typename Graph::NodeIt NodeIt;
|
|
marci@155
|
500 |
|
|
marci@155
|
501 |
// //FIXME tag-ekkel megcsinalni, hogy abbol csinaljon
|
|
marci@155
|
502 |
// //iranyitatlant, ami van
|
|
marci@155
|
503 |
// //mert csak 1 dolgot lehet be typedef-elni
|
|
marci@155
|
504 |
// typedef typename Graph::OutEdgeIt SymEdgeIt;
|
|
marci@155
|
505 |
// //typedef typename Graph::InEdgeIt SymEdgeIt;
|
|
marci@155
|
506 |
// //typedef typename Graph::SymEdgeIt SymEdgeIt;
|
|
marci@174
|
507 |
// typedef typename Graph::EdgeIt EdgeIt;
|
|
marci@155
|
508 |
|
|
marci@155
|
509 |
// int nodeNum() const { return graph->nodeNum(); }
|
|
marci@155
|
510 |
// int edgeNum() const { return graph->edgeNum(); }
|
|
marci@155
|
511 |
|
|
marci@212
|
512 |
// template<typename I> I& first(I& i) const { return graph->first(i); }
|
|
marci@212
|
513 |
// template<typename I, typename P> I& first(I& i, const P& p) const {
|
|
marci@212
|
514 |
// return graph->first(i, p); }
|
|
marci@155
|
515 |
// //template<typename I> I next(const I i); { return graph->goNext(i); }
|
|
marci@155
|
516 |
// //template<typename I> I &goNext(I &i); { return graph->goNext(i); }
|
|
marci@155
|
517 |
|
|
marci@155
|
518 |
// template< typename It > It first() const {
|
|
marci@212
|
519 |
// It e; first(e); return e; }
|
|
marci@155
|
520 |
|
|
marci@174
|
521 |
// template< typename It > It first(Node v) const {
|
|
marci@212
|
522 |
// It e; first(e, v); return e; }
|
|
marci@155
|
523 |
|
|
marci@174
|
524 |
// Node head(const Edge& e) const { return graph->head(e); }
|
|
marci@174
|
525 |
// Node tail(const Edge& e) const { return graph->tail(e); }
|
|
marci@155
|
526 |
|
|
marci@174
|
527 |
// template<typename I> Node aNode(const I& e) const {
|
|
marci@155
|
528 |
// return graph->aNode(e); }
|
|
marci@174
|
529 |
// template<typename I> Node bNode(const I& e) const {
|
|
marci@155
|
530 |
// return graph->bNode(e); }
|
|
marci@155
|
531 |
|
|
marci@155
|
532 |
// //template<typename I> bool valid(const I i);
|
|
marci@155
|
533 |
// //{ return graph->valid(i); }
|
|
marci@155
|
534 |
|
|
marci@155
|
535 |
// //template<typename I> void setInvalid(const I &i);
|
|
marci@155
|
536 |
// //{ return graph->setInvalid(i); }
|
|
marci@155
|
537 |
|
|
marci@174
|
538 |
// Node addNode() { return graph->addNode(); }
|
|
marci@174
|
539 |
// Edge addEdge(const Node& tail, const Node& head) {
|
|
marci@155
|
540 |
// return graph->addEdge(tail, head); }
|
|
marci@155
|
541 |
|
|
marci@155
|
542 |
// template<typename I> void erase(const I& i) { graph->erase(i); }
|
|
marci@155
|
543 |
|
|
marci@155
|
544 |
// void clear() { graph->clear(); }
|
|
marci@155
|
545 |
|
|
marci@155
|
546 |
// template<typename T> class NodeMap : public Graph::NodeMap<T> { };
|
|
marci@155
|
547 |
// template<typename T> class EdgeMap : public Graph::EdgeMap<T> { };
|
|
marci@155
|
548 |
|
|
marci@155
|
549 |
// void setGraph(Graph& _graph) { graph = &_graph; }
|
|
marci@155
|
550 |
// Graph& getGraph() { return (*graph); }
|
|
marci@155
|
551 |
|
|
marci@155
|
552 |
// //SymGraphWrapper() : graph(0) { }
|
|
marci@155
|
553 |
// SymGraphWrapper(Graph& _graph) : graph(&_graph) { }
|
|
marci@155
|
554 |
// };
|
|
marci@155
|
555 |
|
|
marci@155
|
556 |
|
|
marci@155
|
557 |
template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
|
|
marci@155
|
558 |
class ResGraphWrapper {
|
|
marci@76
|
559 |
public:
|
|
marci@76
|
560 |
typedef Graph BaseGraph;
|
|
marci@174
|
561 |
typedef typename Graph::Node Node;
|
|
marci@155
|
562 |
typedef typename Graph::NodeIt NodeIt;
|
|
marci@155
|
563 |
private:
|
|
marci@155
|
564 |
typedef typename Graph::OutEdgeIt OldOutEdgeIt;
|
|
marci@155
|
565 |
typedef typename Graph::InEdgeIt OldInEdgeIt;
|
|
marci@199
|
566 |
protected:
|
|
marci@174
|
567 |
const Graph* graph;
|
|
marci@155
|
568 |
FlowMap* flow;
|
|
marci@155
|
569 |
const CapacityMap* capacity;
|
|
marci@155
|
570 |
public:
|
|
marci@168
|
571 |
|
|
marci@155
|
572 |
ResGraphWrapper(const Graph& _G, FlowMap& _flow,
|
|
marci@155
|
573 |
const CapacityMap& _capacity) :
|
|
marci@174
|
574 |
graph(&_G), flow(&_flow), capacity(&_capacity) { }
|
|
marci@168
|
575 |
|
|
marci@168
|
576 |
void setGraph(const Graph& _graph) { graph = &_graph; }
|
|
marci@174
|
577 |
const Graph& getGraph() const { return (*graph); }
|
|
marci@168
|
578 |
|
|
marci@174
|
579 |
class Edge;
|
|
marci@155
|
580 |
class OutEdgeIt;
|
|
marci@174
|
581 |
friend class Edge;
|
|
marci@155
|
582 |
friend class OutEdgeIt;
|
|
marci@76
|
583 |
|
|
marci@174
|
584 |
class Edge {
|
|
marci@155
|
585 |
friend class ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>;
|
|
marci@155
|
586 |
protected:
|
|
marci@168
|
587 |
bool out_or_in; //true, iff out
|
|
marci@155
|
588 |
OldOutEdgeIt out;
|
|
marci@155
|
589 |
OldInEdgeIt in;
|
|
marci@155
|
590 |
public:
|
|
marci@174
|
591 |
Edge() : out_or_in(true) { }
|
|
marci@174
|
592 |
Edge(const Invalid& i) : out_or_in(false), out(), in(i) { }
|
|
marci@168
|
593 |
// bool valid() const {
|
|
marci@168
|
594 |
// return out_or_in && out.valid() || in.valid(); }
|
|
marci@174
|
595 |
friend bool operator==(const Edge& u, const Edge& v) {
|
|
marci@174
|
596 |
if (v.out_or_in)
|
|
marci@174
|
597 |
return (u.out_or_in && u.out==v.out);
|
|
marci@174
|
598 |
else
|
|
marci@174
|
599 |
return (!u.out_or_in && u.in==v.in);
|
|
marci@174
|
600 |
}
|
|
marci@174
|
601 |
friend bool operator!=(const Edge& u, const Edge& v) {
|
|
marci@174
|
602 |
if (v.out_or_in)
|
|
marci@174
|
603 |
return (!u.out_or_in || u.out!=v.out);
|
|
marci@174
|
604 |
else
|
|
marci@174
|
605 |
return (u.out_or_in || u.in!=v.in);
|
|
marci@174
|
606 |
}
|
|
marci@155
|
607 |
};
|
|
marci@155
|
608 |
|
|
marci@155
|
609 |
|
|
marci@174
|
610 |
class OutEdgeIt : public Edge {
|
|
marci@155
|
611 |
friend class ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>;
|
|
marci@155
|
612 |
public:
|
|
marci@155
|
613 |
OutEdgeIt() { }
|
|
marci@168
|
614 |
//FIXME
|
|
marci@174
|
615 |
OutEdgeIt(const Edge& e) : Edge(e) { }
|
|
marci@174
|
616 |
OutEdgeIt(const Invalid& i) : Edge(i) { }
|
|
marci@155
|
617 |
private:
|
|
marci@174
|
618 |
OutEdgeIt(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& resG, Node v) : Edge() {
|
|
marci@212
|
619 |
resG.graph->first(out, v);
|
|
marci@174
|
620 |
while( resG.graph->valid(out) && !(resG.free(out)>0) ) { resG.graph->next(out); }
|
|
marci@174
|
621 |
if (!resG.graph->valid(out)) {
|
|
marci@155
|
622 |
out_or_in=0;
|
|
marci@212
|
623 |
resG.graph->first(in, v);
|
|
marci@174
|
624 |
while( resG.graph->valid(in) && !(resG.free(in)>0) ) { resG.graph->next(in); }
|
|
marci@155
|
625 |
}
|
|
marci@155
|
626 |
}
|
|
marci@168
|
627 |
// public:
|
|
marci@168
|
628 |
// OutEdgeIt& operator++() {
|
|
marci@168
|
629 |
// if (out_or_in) {
|
|
marci@174
|
630 |
// Node v=/*resG->*/G->aNode(out);
|
|
marci@168
|
631 |
// ++out;
|
|
marci@174
|
632 |
// while( out.valid() && !(Edge::free()>0) ) { ++out; }
|
|
marci@168
|
633 |
// if (!out.valid()) {
|
|
marci@168
|
634 |
// out_or_in=0;
|
|
marci@212
|
635 |
// G->first(in, v);
|
|
marci@174
|
636 |
// while( in.valid() && !(Edge::free()>0) ) { ++in; }
|
|
marci@168
|
637 |
// }
|
|
marci@168
|
638 |
// } else {
|
|
marci@168
|
639 |
// ++in;
|
|
marci@174
|
640 |
// while( in.valid() && !(Edge::free()>0) ) { ++in; }
|
|
marci@168
|
641 |
// }
|
|
marci@168
|
642 |
// return *this;
|
|
marci@168
|
643 |
// }
|
|
marci@155
|
644 |
};
|
|
marci@155
|
645 |
|
|
marci@174
|
646 |
class EdgeIt : public Edge {
|
|
marci@155
|
647 |
friend class ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>;
|
|
marci@174
|
648 |
typename Graph::NodeIt v;
|
|
marci@155
|
649 |
public:
|
|
marci@174
|
650 |
EdgeIt() { }
|
|
marci@174
|
651 |
//EdgeIt(const EdgeIt& e) : Edge(e), v(e.v) { }
|
|
marci@174
|
652 |
EdgeIt(const Invalid& i) : Edge(i) { }
|
|
marci@174
|
653 |
EdgeIt(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& resG) : Edge() {
|
|
marci@212
|
654 |
resG.graph->first(v);
|
|
marci@212
|
655 |
if (resG.graph->valid(v)) resG.graph->first(out, v); else out=OldOutEdgeIt(INVALID);
|
|
marci@174
|
656 |
while (resG.graph->valid(out) && !(resG.free(out)>0) ) { resG.graph->next(out); }
|
|
marci@174
|
657 |
while (resG.graph->valid(v) && !resG.graph->valid(out)) {
|
|
marci@174
|
658 |
resG.graph->next(v);
|
|
marci@212
|
659 |
if (resG.graph->valid(v)) resG.graph->first(out, v);
|
|
marci@174
|
660 |
while (resG.graph->valid(out) && !(resG.free(out)>0) ) { resG.graph->next(out); }
|
|
marci@155
|
661 |
}
|
|
marci@174
|
662 |
if (!resG.graph->valid(out)) {
|
|
marci@155
|
663 |
out_or_in=0;
|
|
marci@212
|
664 |
resG.graph->first(v);
|
|
marci@212
|
665 |
if (resG.graph->valid(v)) resG.graph->first(in, v); else in=OldInEdgeIt(INVALID);
|
|
marci@174
|
666 |
while (resG.graph->valid(in) && !(resG.free(in)>0) ) { resG.graph->next(in); }
|
|
marci@174
|
667 |
while (resG.graph->valid(v) && !resG.graph->valid(in)) {
|
|
marci@174
|
668 |
resG.graph->next(v);
|
|
marci@212
|
669 |
if (resG.graph->valid(v)) resG.graph->first(in, v);
|
|
marci@174
|
670 |
while (resG.graph->valid(in) && !(resG.free(in)>0) ) { resG.graph->next(in); }
|
|
marci@155
|
671 |
}
|
|
marci@155
|
672 |
}
|
|
marci@155
|
673 |
}
|
|
marci@174
|
674 |
// EdgeIt& operator++() {
|
|
marci@168
|
675 |
// if (out_or_in) {
|
|
marci@168
|
676 |
// ++out;
|
|
marci@174
|
677 |
// while (out.valid() && !(Edge::free()>0) ) { ++out; }
|
|
marci@168
|
678 |
// while (v.valid() && !out.valid()) {
|
|
marci@168
|
679 |
// ++v;
|
|
marci@212
|
680 |
// if (v.valid()) G->first(out, v);
|
|
marci@174
|
681 |
// while (out.valid() && !(Edge::free()>0) ) { ++out; }
|
|
marci@168
|
682 |
// }
|
|
marci@168
|
683 |
// if (!out.valid()) {
|
|
marci@168
|
684 |
// out_or_in=0;
|
|
marci@212
|
685 |
// G->first(v);
|
|
marci@212
|
686 |
// if (v.valid()) G->first(in, v); else in=OldInEdgeIt();
|
|
marci@174
|
687 |
// while (in.valid() && !(Edge::free()>0) ) { ++in; }
|
|
marci@168
|
688 |
// while (v.valid() && !in.valid()) {
|
|
marci@168
|
689 |
// ++v;
|
|
marci@212
|
690 |
// if (v.valid()) G->first(in, v);
|
|
marci@174
|
691 |
// while (in.valid() && !(Edge::free()>0) ) { ++in; }
|
|
marci@168
|
692 |
// }
|
|
marci@168
|
693 |
// }
|
|
marci@168
|
694 |
// } else {
|
|
marci@168
|
695 |
// ++in;
|
|
marci@174
|
696 |
// while (in.valid() && !(Edge::free()>0) ) { ++in; }
|
|
marci@168
|
697 |
// while (v.valid() && !in.valid()) {
|
|
marci@168
|
698 |
// ++v;
|
|
marci@212
|
699 |
// if (v.valid()) G->first(in, v);
|
|
marci@174
|
700 |
// while (in.valid() && !(Edge::free()>0) ) { ++in; }
|
|
marci@168
|
701 |
// }
|
|
marci@168
|
702 |
// }
|
|
marci@168
|
703 |
// return *this;
|
|
marci@168
|
704 |
// }
|
|
marci@155
|
705 |
};
|
|
marci@155
|
706 |
|
|
marci@212
|
707 |
NodeIt& first(NodeIt& v) const { return graph->first(v); }
|
|
marci@212
|
708 |
OutEdgeIt& first(OutEdgeIt& e, Node v) const {
|
|
marci@168
|
709 |
e=OutEdgeIt(*this, v);
|
|
marci@174
|
710 |
return e;
|
|
marci@155
|
711 |
}
|
|
marci@212
|
712 |
EdgeIt& first(EdgeIt& e) const {
|
|
marci@174
|
713 |
e=EdgeIt(*this);
|
|
marci@174
|
714 |
return e;
|
|
marci@155
|
715 |
}
|
|
marci@155
|
716 |
|
|
marci@174
|
717 |
NodeIt& next(NodeIt& n) const { return graph->next(n); }
|
|
marci@155
|
718 |
|
|
marci@155
|
719 |
OutEdgeIt& next(OutEdgeIt& e) const {
|
|
marci@155
|
720 |
if (e.out_or_in) {
|
|
marci@174
|
721 |
Node v=graph->aNode(e.out);
|
|
marci@174
|
722 |
graph->next(e.out);
|
|
marci@174
|
723 |
while( graph->valid(e.out) && !(free(e.out)>0) ) { graph->next(e.out); }
|
|
marci@174
|
724 |
if (!graph->valid(e.out)) {
|
|
marci@155
|
725 |
e.out_or_in=0;
|
|
marci@212
|
726 |
graph->first(e.in, v);
|
|
marci@174
|
727 |
while( graph->valid(e.in) && !(free(e.in)>0) ) { graph->next(e.in); }
|
|
marci@155
|
728 |
}
|
|
marci@155
|
729 |
} else {
|
|
marci@174
|
730 |
graph->next(e.in);
|
|
marci@174
|
731 |
while( graph->valid(e.in) && !(free(e.in)>0) ) { graph->next(e.in); }
|
|
marci@155
|
732 |
}
|
|
marci@155
|
733 |
return e;
|
|
marci@155
|
734 |
}
|
|
marci@155
|
735 |
|
|
marci@174
|
736 |
EdgeIt& next(EdgeIt& e) const {
|
|
marci@155
|
737 |
if (e.out_or_in) {
|
|
marci@174
|
738 |
graph->next(e.out);
|
|
marci@174
|
739 |
while (graph->valid(e.out) && !(free(e.out)>0) ) { graph->next(e.out); }
|
|
marci@174
|
740 |
while (graph->valid(e.v) && !graph->valid(e.out)) {
|
|
marci@174
|
741 |
graph->next(e.v);
|
|
marci@212
|
742 |
if (graph->valid(e.v)) graph->first(e.out, e.v);
|
|
marci@174
|
743 |
while (graph->valid(e.out) && !(free(e.out)>0) ) { graph->next(e.out); }
|
|
marci@155
|
744 |
}
|
|
marci@174
|
745 |
if (!graph->valid(e.out)) {
|
|
marci@155
|
746 |
e.out_or_in=0;
|
|
marci@212
|
747 |
graph->first(e.v);
|
|
marci@212
|
748 |
if (graph->valid(e.v)) graph->first(e.in, e.v); else e.in=OldInEdgeIt(INVALID);
|
|
marci@174
|
749 |
while (graph->valid(e.in) && !(free(e.in)>0) ) { graph->next(e.in); }
|
|
marci@174
|
750 |
while (graph->valid(e.v) && !graph->valid(e.in)) {
|
|
marci@174
|
751 |
graph->next(e.v);
|
|
marci@212
|
752 |
if (graph->valid(e.v)) graph->first(e.in, e.v);
|
|
marci@174
|
753 |
while (graph->valid(e.in) && !(free(e.in)>0) ) { graph->next(e.in); }
|
|
marci@155
|
754 |
}
|
|
marci@155
|
755 |
}
|
|
marci@155
|
756 |
} else {
|
|
marci@174
|
757 |
graph->next(e.in);
|
|
marci@174
|
758 |
while (graph->valid(e.in) && !(free(e.in)>0) ) { graph->next(e.in); }
|
|
marci@174
|
759 |
while (graph->valid(e.v) && !graph->valid(e.in)) {
|
|
marci@174
|
760 |
graph->next(e.v);
|
|
marci@212
|
761 |
if (graph->valid(e.v)) graph->first(e.in, e.v);
|
|
marci@174
|
762 |
while (graph->valid(e.in) && !(free(e.in)>0) ) { graph->next(e.in); }
|
|
marci@155
|
763 |
}
|
|
marci@155
|
764 |
}
|
|
marci@155
|
765 |
return e;
|
|
marci@155
|
766 |
}
|
|
marci@76
|
767 |
|
|
marci@76
|
768 |
|
|
marci@155
|
769 |
template< typename It >
|
|
marci@155
|
770 |
It first() const {
|
|
marci@155
|
771 |
It e;
|
|
marci@212
|
772 |
first(e);
|
|
marci@155
|
773 |
return e;
|
|
marci@155
|
774 |
}
|
|
marci@76
|
775 |
|
|
marci@155
|
776 |
template< typename It >
|
|
marci@174
|
777 |
It first(Node v) const {
|
|
marci@155
|
778 |
It e;
|
|
marci@212
|
779 |
first(e, v);
|
|
marci@155
|
780 |
return e;
|
|
marci@155
|
781 |
}
|
|
marci@76
|
782 |
|
|
marci@174
|
783 |
Node tail(Edge e) const {
|
|
marci@174
|
784 |
return ((e.out_or_in) ? graph->aNode(e.out) : graph->aNode(e.in)); }
|
|
marci@174
|
785 |
Node head(Edge e) const {
|
|
marci@174
|
786 |
return ((e.out_or_in) ? graph->bNode(e.out) : graph->bNode(e.in)); }
|
|
marci@76
|
787 |
|
|
marci@174
|
788 |
Node aNode(OutEdgeIt e) const {
|
|
marci@174
|
789 |
return ((e.out_or_in) ? graph->aNode(e.out) : graph->aNode(e.in)); }
|
|
marci@174
|
790 |
Node bNode(OutEdgeIt e) const {
|
|
marci@174
|
791 |
return ((e.out_or_in) ? graph->bNode(e.out) : graph->bNode(e.in)); }
|
|
marci@76
|
792 |
|
|
marci@174
|
793 |
int id(Node v) const { return graph->id(v); }
|
|
marci@155
|
794 |
|
|
marci@174
|
795 |
bool valid(Node n) const { return graph->valid(n); }
|
|
marci@174
|
796 |
bool valid(Edge e) const {
|
|
marci@174
|
797 |
return e.out_or_in ? graph->valid(e.out) : graph->valid(e.in); }
|
|
marci@155
|
798 |
|
|
marci@174
|
799 |
void augment(const Edge& e, Number a) const {
|
|
marci@168
|
800 |
if (e.out_or_in)
|
|
marci@168
|
801 |
flow->set(e.out, flow->get(e.out)+a);
|
|
marci@168
|
802 |
else
|
|
marci@168
|
803 |
flow->set(e.in, flow->get(e.in)-a);
|
|
marci@168
|
804 |
}
|
|
marci@168
|
805 |
|
|
marci@174
|
806 |
Number free(const Edge& e) const {
|
|
marci@168
|
807 |
if (e.out_or_in)
|
|
marci@168
|
808 |
return (capacity->get(e.out)-flow->get(e.out));
|
|
marci@168
|
809 |
else
|
|
marci@168
|
810 |
return (flow->get(e.in));
|
|
marci@168
|
811 |
}
|
|
marci@168
|
812 |
|
|
marci@168
|
813 |
Number free(OldOutEdgeIt out) const {
|
|
marci@168
|
814 |
return (capacity->get(out)-flow->get(out));
|
|
marci@168
|
815 |
}
|
|
marci@168
|
816 |
|
|
marci@168
|
817 |
Number free(OldInEdgeIt in) const {
|
|
marci@168
|
818 |
return (flow->get(in));
|
|
marci@168
|
819 |
}
|
|
marci@168
|
820 |
|
|
marci@155
|
821 |
template<typename T> class NodeMap : public Graph::NodeMap<T> {
|
|
marci@155
|
822 |
public:
|
|
marci@155
|
823 |
NodeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G)
|
|
marci@158
|
824 |
: Graph::NodeMap<T>(_G.getGraph()) { }
|
|
marci@155
|
825 |
NodeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G,
|
|
marci@158
|
826 |
T a) : Graph::NodeMap<T>(_G.getGraph(), a) { }
|
|
marci@155
|
827 |
};
|
|
marci@155
|
828 |
|
|
marci@155
|
829 |
// template <typename T>
|
|
marci@155
|
830 |
// class NodeMap {
|
|
marci@155
|
831 |
// typename Graph::NodeMap<T> node_map;
|
|
marci@155
|
832 |
// public:
|
|
marci@174
|
833 |
// NodeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) : node_map(*(_G.graph)) { }
|
|
marci@174
|
834 |
// NodeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, T a) : node_map(*(_G.graph), a) { }
|
|
marci@174
|
835 |
// void set(Node nit, T a) { node_map.set(nit, a); }
|
|
marci@174
|
836 |
// T get(Node nit) const { return node_map.get(nit); }
|
|
marci@155
|
837 |
// };
|
|
marci@155
|
838 |
|
|
marci@155
|
839 |
template <typename T>
|
|
marci@155
|
840 |
class EdgeMap {
|
|
marci@155
|
841 |
typename Graph::EdgeMap<T> forward_map, backward_map;
|
|
marci@155
|
842 |
public:
|
|
marci@158
|
843 |
EdgeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) : forward_map(_G.getGraph()), backward_map(_G.getGraph()) { }
|
|
marci@158
|
844 |
EdgeMap(const ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, T a) : forward_map(_G.getGraph(), a), backward_map(_G.getGraph(), a) { }
|
|
marci@174
|
845 |
void set(Edge e, T a) {
|
|
marci@155
|
846 |
if (e.out_or_in)
|
|
marci@155
|
847 |
forward_map.set(e.out, a);
|
|
marci@155
|
848 |
else
|
|
marci@155
|
849 |
backward_map.set(e.in, a);
|
|
marci@155
|
850 |
}
|
|
marci@174
|
851 |
T get(Edge e) {
|
|
marci@155
|
852 |
if (e.out_or_in)
|
|
marci@155
|
853 |
return forward_map.get(e.out);
|
|
marci@155
|
854 |
else
|
|
marci@155
|
855 |
return backward_map.get(e.in);
|
|
marci@155
|
856 |
}
|
|
marci@155
|
857 |
};
|
|
marci@168
|
858 |
};
|
|
marci@168
|
859 |
|
|
marci@168
|
860 |
template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
|
|
marci@168
|
861 |
class ErasingResGraphWrapper : public ResGraphWrapper<Graph, Number, FlowMap, CapacityMap> {
|
|
marci@168
|
862 |
protected:
|
|
marci@168
|
863 |
ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt> first_out_edges;
|
|
marci@168
|
864 |
//ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<int> dist;
|
|
marci@168
|
865 |
public:
|
|
marci@168
|
866 |
ErasingResGraphWrapper(const Graph& _G, FlowMap& _flow,
|
|
marci@168
|
867 |
const CapacityMap& _capacity) :
|
|
marci@168
|
868 |
ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>(_G, _flow, _capacity),
|
|
marci@168
|
869 |
first_out_edges(*this) /*, dist(*this)*/ {
|
|
marci@174
|
870 |
for(NodeIt n=this->template first<NodeIt>(); this->valid(n); this->next(n)) {
|
|
marci@168
|
871 |
OutEdgeIt e;
|
|
marci@212
|
872 |
ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::first(e, n);
|
|
marci@168
|
873 |
first_out_edges.set(n, e);
|
|
marci@168
|
874 |
}
|
|
marci@168
|
875 |
}
|
|
marci@168
|
876 |
|
|
marci@168
|
877 |
//void setGraph(Graph& _graph) { graph = &_graph; }
|
|
marci@168
|
878 |
//Graph& getGraph() const { return (*graph); }
|
|
marci@168
|
879 |
|
|
marci@168
|
880 |
//TrivGraphWrapper() : graph(0) { }
|
|
marci@168
|
881 |
//ErasingResGraphWrapper(Graph& _graph) : graph(&_graph) { }
|
|
marci@168
|
882 |
|
|
marci@168
|
883 |
//typedef Graph BaseGraph;
|
|
marci@168
|
884 |
|
|
marci@174
|
885 |
//typedef typename Graph::Node Node;
|
|
marci@168
|
886 |
//typedef typename Graph::NodeIt NodeIt;
|
|
marci@168
|
887 |
|
|
marci@174
|
888 |
//typedef typename Graph::Edge Edge;
|
|
marci@168
|
889 |
//typedef typename Graph::OutEdgeIt OutEdgeIt;
|
|
marci@168
|
890 |
//typedef typename Graph::InEdgeIt InEdgeIt;
|
|
marci@168
|
891 |
//typedef typename Graph::SymEdgeIt SymEdgeIt;
|
|
marci@174
|
892 |
//typedef typename Graph::EdgeIt EdgeIt;
|
|
marci@168
|
893 |
|
|
marci@174
|
894 |
typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::Node Node;
|
|
marci@168
|
895 |
typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeIt NodeIt;
|
|
marci@168
|
896 |
|
|
marci@174
|
897 |
typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::Edge Edge;
|
|
marci@168
|
898 |
typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt OutEdgeIt;
|
|
marci@168
|
899 |
//typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::InEdgeIt InEdgeIt;
|
|
marci@168
|
900 |
//typedef typename Graph::SymEdgeIt SymEdgeIt;
|
|
marci@174
|
901 |
//typedef typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeIt EdgeIt;
|
|
marci@168
|
902 |
|
|
marci@212
|
903 |
NodeIt& first(NodeIt& n) const {
|
|
marci@212
|
904 |
return ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::first(n);
|
|
marci@168
|
905 |
}
|
|
marci@168
|
906 |
|
|
marci@212
|
907 |
OutEdgeIt& first(OutEdgeIt& e, const Node& n) const {
|
|
marci@168
|
908 |
e=first_out_edges.get(n);
|
|
marci@168
|
909 |
return e;
|
|
marci@168
|
910 |
}
|
|
marci@168
|
911 |
|
|
marci@212
|
912 |
//ROSSZ template<typename I> I& first(I& i) const { return first(i); }
|
|
marci@212
|
913 |
//ROSSZ template<typename I, typename P> I& first(I& i, const P& p) const {
|
|
marci@212
|
914 |
// return first(i, p); }
|
|
marci@168
|
915 |
|
|
marci@168
|
916 |
//template<typename I> I getNext(const I& i) const {
|
|
marci@168
|
917 |
// return graph->getNext(i); }
|
|
marci@168
|
918 |
//template<typename I> I& next(I &i) const { return graph->next(i); }
|
|
marci@168
|
919 |
|
|
marci@168
|
920 |
template< typename It > It first() const {
|
|
marci@212
|
921 |
It e; first(e); return e; }
|
|
marci@168
|
922 |
|
|
marci@174
|
923 |
template< typename It > It first(const Node& v) const {
|
|
marci@212
|
924 |
It e; first(e, v); return e; }
|
|
marci@168
|
925 |
|
|
marci@174
|
926 |
//Node head(const Edge& e) const { return graph->head(e); }
|
|
marci@174
|
927 |
//Node tail(const Edge& e) const { return graph->tail(e); }
|
|
marci@168
|
928 |
|
|
marci@168
|
929 |
//template<typename I> bool valid(const I& i) const
|
|
marci@168
|
930 |
// { return graph->valid(i); }
|
|
marci@168
|
931 |
|
|
marci@168
|
932 |
//int nodeNum() const { return graph->nodeNum(); }
|
|
marci@168
|
933 |
//int edgeNum() const { return graph->edgeNum(); }
|
|
marci@168
|
934 |
|
|
marci@174
|
935 |
//template<typename I> Node aNode(const I& e) const {
|
|
marci@168
|
936 |
// return graph->aNode(e); }
|
|
marci@174
|
937 |
//template<typename I> Node bNode(const I& e) const {
|
|
marci@168
|
938 |
// return graph->bNode(e); }
|
|
marci@168
|
939 |
|
|
marci@174
|
940 |
//Node addNode() const { return graph->addNode(); }
|
|
marci@174
|
941 |
//Edge addEdge(const Node& tail, const Node& head) const {
|
|
marci@168
|
942 |
// return graph->addEdge(tail, head); }
|
|
marci@168
|
943 |
|
|
marci@168
|
944 |
//void erase(const OutEdgeIt& e) {
|
|
marci@168
|
945 |
// first_out_edge(this->tail(e))=e;
|
|
marci@168
|
946 |
//}
|
|
marci@174
|
947 |
void erase(const Edge& e) {
|
|
marci@168
|
948 |
OutEdgeIt f(e);
|
|
marci@168
|
949 |
next(f);
|
|
marci@168
|
950 |
first_out_edges.set(this->tail(e), f);
|
|
marci@168
|
951 |
}
|
|
marci@168
|
952 |
//template<typename I> void erase(const I& i) const { graph->erase(i); }
|
|
marci@168
|
953 |
|
|
marci@168
|
954 |
//void clear() const { graph->clear(); }
|
|
marci@168
|
955 |
|
|
marci@168
|
956 |
template<typename T> class NodeMap : public ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T> {
|
|
marci@168
|
957 |
public:
|
|
marci@168
|
958 |
NodeMap(const ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) :
|
|
marci@168
|
959 |
ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T>(_G /*_G.getGraph()*/) { }
|
|
marci@168
|
960 |
NodeMap(const ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, T a) :
|
|
marci@168
|
961 |
ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T>(_G /*_G.getGraph()*/, a) { }
|
|
marci@168
|
962 |
};
|
|
marci@168
|
963 |
|
|
marci@168
|
964 |
template<typename T> class EdgeMap : public ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T> {
|
|
marci@168
|
965 |
public:
|
|
marci@168
|
966 |
EdgeMap(const ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G) :
|
|
marci@168
|
967 |
ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T>(_G /*_G.getGraph()*/) { }
|
|
marci@168
|
968 |
EdgeMap(const ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>& _G, T a) :
|
|
marci@168
|
969 |
ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T>(_G /*_G.getGraph()*/, a) { }
|
|
marci@168
|
970 |
};
|
|
marci@168
|
971 |
};
|
|
marci@168
|
972 |
|
|
marci@168
|
973 |
template<typename GraphWrapper>
|
|
marci@168
|
974 |
class FilterGraphWrapper {
|
|
marci@168
|
975 |
};
|
|
marci@168
|
976 |
|
|
marci@168
|
977 |
template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
|
|
marci@168
|
978 |
class FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> > : public ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> {
|
|
marci@168
|
979 |
|
|
marci@168
|
980 |
//Graph* graph;
|
|
marci@168
|
981 |
|
|
marci@168
|
982 |
public:
|
|
marci@168
|
983 |
//typedef Graph BaseGraph;
|
|
marci@168
|
984 |
|
|
marci@174
|
985 |
typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::Node Node;
|
|
marci@168
|
986 |
typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeIt NodeIt;
|
|
marci@168
|
987 |
|
|
marci@174
|
988 |
typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::Edge Edge;
|
|
marci@168
|
989 |
typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt OutEdgeIt;
|
|
marci@168
|
990 |
//typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::InEdgeIt InEdgeIt;
|
|
marci@168
|
991 |
//typedef typename Graph::SymEdgeIt SymEdgeIt;
|
|
marci@174
|
992 |
typedef typename ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeIt EdgeIt;
|
|
marci@168
|
993 |
|
|
marci@168
|
994 |
//FilterGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<typename ResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::OutEdgeIt> first_out_edges;
|
|
marci@168
|
995 |
|
|
marci@168
|
996 |
public:
|
|
marci@168
|
997 |
FilterGraphWrapper(const Graph& _G, FlowMap& _flow,
|
|
marci@168
|
998 |
const CapacityMap& _capacity) :
|
|
marci@199
|
999 |
ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>(_G, _flow, _capacity), dist(*this, graph->nodeNum()) {
|
|
marci@168
|
1000 |
}
|
|
marci@168
|
1001 |
|
|
marci@212
|
1002 |
OutEdgeIt& first(OutEdgeIt& e, const Node& n) const {
|
|
marci@212
|
1003 |
ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::first(e, n);
|
|
marci@199
|
1004 |
while (valid(e) && (dist.get(tail(e))/*+1!=*/>=dist.get(head(e))))
|
|
marci@168
|
1005 |
ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(e);
|
|
marci@168
|
1006 |
return e;
|
|
marci@168
|
1007 |
}
|
|
marci@168
|
1008 |
|
|
marci@174
|
1009 |
NodeIt& next(NodeIt& e) const {
|
|
marci@168
|
1010 |
return ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(e);
|
|
marci@168
|
1011 |
}
|
|
marci@168
|
1012 |
|
|
marci@168
|
1013 |
OutEdgeIt& next(OutEdgeIt& e) const {
|
|
marci@168
|
1014 |
ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(e);
|
|
marci@199
|
1015 |
while (valid(e) && (dist.get(tail(e))/*+1!*/>=dist.get(head(e))))
|
|
marci@168
|
1016 |
ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(e);
|
|
marci@168
|
1017 |
return e;
|
|
marci@168
|
1018 |
}
|
|
marci@168
|
1019 |
|
|
marci@212
|
1020 |
NodeIt& first(NodeIt& n) const {
|
|
marci@212
|
1021 |
return ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::first(n);
|
|
marci@168
|
1022 |
}
|
|
marci@168
|
1023 |
|
|
marci@174
|
1024 |
void erase(const Edge& e) {
|
|
marci@168
|
1025 |
OutEdgeIt f(e);
|
|
marci@168
|
1026 |
ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(f);
|
|
marci@199
|
1027 |
while (valid(f) && (dist.get(tail(f))/*+1!=*/>=dist.get(head(f))))
|
|
marci@168
|
1028 |
ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::next(f);
|
|
marci@168
|
1029 |
first_out_edges.set(this->tail(e), f);
|
|
marci@168
|
1030 |
}
|
|
marci@168
|
1031 |
|
|
marci@168
|
1032 |
//TrivGraphWrapper() : graph(0) { }
|
|
marci@168
|
1033 |
//TrivGraphWrapper(Graph& _graph) : graph(&_graph) { }
|
|
marci@168
|
1034 |
|
|
marci@168
|
1035 |
//void setGraph(Graph& _graph) { graph = &_graph; }
|
|
marci@168
|
1036 |
//Graph& getGraph() const { return (*graph); }
|
|
marci@168
|
1037 |
|
|
marci@212
|
1038 |
//template<typename I> I& first(I& i) const { return graph->first(i); }
|
|
marci@212
|
1039 |
//template<typename I, typename P> I& first(I& i, const P& p) const {
|
|
marci@212
|
1040 |
// return graph->first(i, p); }
|
|
marci@168
|
1041 |
|
|
marci@168
|
1042 |
//template<typename I> I getNext(const I& i) const {
|
|
marci@168
|
1043 |
// return graph->getNext(i); }
|
|
marci@168
|
1044 |
//template<typename I> I& next(I &i) const { return graph->next(i); }
|
|
marci@168
|
1045 |
|
|
marci@168
|
1046 |
template< typename It > It first() const {
|
|
marci@212
|
1047 |
It e; first(e); return e; }
|
|
marci@168
|
1048 |
|
|
marci@174
|
1049 |
template< typename It > It first(const Node& v) const {
|
|
marci@212
|
1050 |
It e; first(e, v); return e; }
|
|
marci@168
|
1051 |
|
|
marci@174
|
1052 |
//Node head(const Edge& e) const { return graph->head(e); }
|
|
marci@174
|
1053 |
//Node tail(const Edge& e) const { return graph->tail(e); }
|
|
marci@168
|
1054 |
|
|
marci@168
|
1055 |
//template<typename I> bool valid(const I& i) const
|
|
marci@168
|
1056 |
// { return graph->valid(i); }
|
|
marci@168
|
1057 |
|
|
marci@168
|
1058 |
//template<typename I> void setInvalid(const I &i);
|
|
marci@168
|
1059 |
//{ return graph->setInvalid(i); }
|
|
marci@168
|
1060 |
|
|
marci@168
|
1061 |
//int nodeNum() const { return graph->nodeNum(); }
|
|
marci@168
|
1062 |
//int edgeNum() const { return graph->edgeNum(); }
|
|
marci@168
|
1063 |
|
|
marci@174
|
1064 |
//template<typename I> Node aNode(const I& e) const {
|
|
marci@168
|
1065 |
// return graph->aNode(e); }
|
|
marci@174
|
1066 |
//template<typename I> Node bNode(const I& e) const {
|
|
marci@168
|
1067 |
// return graph->bNode(e); }
|
|
marci@168
|
1068 |
|
|
marci@174
|
1069 |
//Node addNode() const { return graph->addNode(); }
|
|
marci@174
|
1070 |
//Edge addEdge(const Node& tail, const Node& head) const {
|
|
marci@168
|
1071 |
// return graph->addEdge(tail, head); }
|
|
marci@168
|
1072 |
|
|
marci@168
|
1073 |
//template<typename I> void erase(const I& i) const { graph->erase(i); }
|
|
marci@168
|
1074 |
|
|
marci@168
|
1075 |
//void clear() const { graph->clear(); }
|
|
marci@168
|
1076 |
|
|
marci@168
|
1077 |
template<typename T> class NodeMap : public ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T> {
|
|
marci@168
|
1078 |
public:
|
|
marci@168
|
1079 |
NodeMap(const FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> >& _G) :
|
|
marci@168
|
1080 |
ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T>(_G /*_G.getGraph()*/) { }
|
|
marci@168
|
1081 |
NodeMap(const FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> >& _G, T a) :
|
|
marci@168
|
1082 |
ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<T>(_G /*_G.getGraph()*/, a) { }
|
|
marci@168
|
1083 |
};
|
|
marci@168
|
1084 |
|
|
marci@168
|
1085 |
template<typename T> class EdgeMap : public ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T> {
|
|
marci@168
|
1086 |
public:
|
|
marci@168
|
1087 |
EdgeMap(const FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> >& _G) :
|
|
marci@168
|
1088 |
ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T>(_G /*_G.getGraph()*/) { }
|
|
marci@168
|
1089 |
EdgeMap(const FilterGraphWrapper<ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap> >& _G, T a) :
|
|
marci@168
|
1090 |
ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::EdgeMap<T>(_G /*_G.getGraph()*/, a) { }
|
|
marci@168
|
1091 |
};
|
|
marci@168
|
1092 |
|
|
marci@168
|
1093 |
public:
|
|
marci@168
|
1094 |
ErasingResGraphWrapper<Graph, Number, FlowMap, CapacityMap>::NodeMap<int> dist;
|
|
marci@155
|
1095 |
|
|
marci@76
|
1096 |
};
|
|
marci@76
|
1097 |
|
|
marci@76
|
1098 |
|
|
marci@148
|
1099 |
|
|
marci@148
|
1100 |
// // FIXME: comparison should be made better!!!
|
|
marci@148
|
1101 |
// template<typename Graph, typename T, typename LowerMap, typename FlowMap, typename UpperMap>
|
|
marci@148
|
1102 |
// class ResGraphWrapper
|
|
marci@148
|
1103 |
// {
|
|
marci@148
|
1104 |
// Graph* graph;
|
|
marci@76
|
1105 |
|
|
marci@148
|
1106 |
// public:
|
|
marci@148
|
1107 |
// typedef Graph BaseGraph;
|
|
marci@76
|
1108 |
|
|
marci@174
|
1109 |
// typedef typename Graph::Node Node;
|
|
marci@174
|
1110 |
// typedef typename Graph::Edge Edge;
|
|
marci@174
|
1111 |
|
|
marci@148
|
1112 |
// typedef typename Graph::NodeIt NodeIt;
|
|
marci@76
|
1113 |
|
|
marci@148
|
1114 |
// class OutEdgeIt {
|
|
marci@148
|
1115 |
// public:
|
|
marci@174
|
1116 |
// //Graph::Node n;
|
|
marci@148
|
1117 |
// bool out_or_in;
|
|
marci@148
|
1118 |
// typename Graph::OutEdgeIt o;
|
|
marci@148
|
1119 |
// typename Graph::InEdgeIt i;
|
|
marci@148
|
1120 |
// };
|
|
marci@148
|
1121 |
// class InEdgeIt {
|
|
marci@148
|
1122 |
// public:
|
|
marci@174
|
1123 |
// //Graph::Node n;
|
|
marci@148
|
1124 |
// bool out_or_in;
|
|
marci@148
|
1125 |
// typename Graph::OutEdgeIt o;
|
|
marci@148
|
1126 |
// typename Graph::InEdgeIt i;
|
|
marci@148
|
1127 |
// };
|
|
marci@148
|
1128 |
// typedef typename Graph::SymEdgeIt SymEdgeIt;
|
|
marci@174
|
1129 |
// typedef typename Graph::EdgeIt EdgeIt;
|
|
marci@76
|
1130 |
|
|
marci@148
|
1131 |
// int nodeNum() const { return graph->nodeNum(); }
|
|
marci@148
|
1132 |
// int edgeNum() const { return graph->edgeNum(); }
|
|
marci@76
|
1133 |
|
|
marci@212
|
1134 |
// Node& first(Node& n) const { return graph->first(n); }
|
|
marci@76
|
1135 |
|
|
marci@174
|
1136 |
// // Edge and SymEdge is missing!!!!
|
|
marci@174
|
1137 |
// // Edge <-> In/OutEdgeIt conversion is missing!!!!
|
|
marci@76
|
1138 |
|
|
marci@148
|
1139 |
// //FIXME
|
|
marci@212
|
1140 |
// OutEdgeIt& first(OutEdgeIt& e, const Node& n) const
|
|
marci@148
|
1141 |
// {
|
|
marci@148
|
1142 |
// e.n=n;
|
|
marci@212
|
1143 |
// graph->first(e.o,n);
|
|
marci@148
|
1144 |
// while(graph->valid(e.o) && fmap.get(e.o)>=himap.get(e.o))
|
|
marci@148
|
1145 |
// graph->goNext(e.o);
|
|
marci@148
|
1146 |
// if(!graph->valid(e.o)) {
|
|
marci@212
|
1147 |
// graph->first(e.i,n);
|
|
marci@148
|
1148 |
// while(graph->valid(e.i) && fmap.get(e.i)<=lomap.get(e.i))
|
|
marci@148
|
1149 |
// graph->goNext(e.i);
|
|
marci@148
|
1150 |
// }
|
|
marci@148
|
1151 |
// return e;
|
|
marci@148
|
1152 |
// }
|
|
marci@148
|
1153 |
// /*
|
|
marci@148
|
1154 |
// OutEdgeIt &goNext(OutEdgeIt &e)
|
|
marci@148
|
1155 |
// {
|
|
marci@148
|
1156 |
// if(graph->valid(e.o)) {
|
|
marci@148
|
1157 |
// while(graph->valid(e.o) && fmap.get(e.o)>=himap.get(e.o))
|
|
marci@148
|
1158 |
// graph->goNext(e.o);
|
|
marci@148
|
1159 |
// if(graph->valid(e.o)) return e;
|
|
marci@212
|
1160 |
// else graph->first(e.i,e.n);
|
|
marci@148
|
1161 |
// }
|
|
marci@148
|
1162 |
// else {
|
|
marci@148
|
1163 |
// while(graph->valid(e.i) && fmap.get(e.i)<=lomap.get(e.i))
|
|
marci@148
|
1164 |
// graph->goNext(e.i);
|
|
marci@148
|
1165 |
// return e;
|
|
marci@148
|
1166 |
// }
|
|
marci@148
|
1167 |
// }
|
|
marci@148
|
1168 |
// OutEdgeIt Next(const OutEdgeIt &e) {OutEdgeIt t(e); return goNext(t);}
|
|
marci@148
|
1169 |
// */
|
|
marci@148
|
1170 |
// //bool valid(const OutEdgeIt e) { return graph->valid(e.o)||graph->valid(e.i);}
|
|
marci@76
|
1171 |
|
|
marci@148
|
1172 |
// //FIXME
|
|
marci@212
|
1173 |
// InEdgeIt& first(InEdgeIt& e, const Node& n) const
|
|
marci@148
|
1174 |
// {
|
|
marci@148
|
1175 |
// e.n=n;
|
|
marci@212
|
1176 |
// graph->first(e.i,n);
|
|
marci@148
|
1177 |
// while(graph->valid(e.i) && fmap.get(e.i)>=himap.get(e.i))
|
|
marci@148
|
1178 |
// graph->goNext(e.i);
|
|
marci@148
|
1179 |
// if(!graph->valid(e.i)) {
|
|
marci@212
|
1180 |
// graph->first(e.o,n);
|
|
marci@148
|
1181 |
// while(graph->valid(e.o) && fmap.get(e.o)<=lomap.get(e.o))
|
|
marci@148
|
1182 |
// graph->goNext(e.o);
|
|
marci@148
|
1183 |
// }
|
|
marci@148
|
1184 |
// return e;
|
|
marci@148
|
1185 |
// }
|
|
marci@148
|
1186 |
// /*
|
|
marci@148
|
1187 |
// InEdgeIt &goNext(InEdgeIt &e)
|
|
marci@148
|
1188 |
// {
|
|
marci@148
|
1189 |
// if(graph->valid(e.i)) {
|
|
marci@148
|
1190 |
// while(graph->valid(e.i) && fmap.get(e.i)>=himap.get(e.i))
|
|
marci@148
|
1191 |
// graph->goNext(e.i);
|
|
marci@148
|
1192 |
// if(graph->valid(e.i)) return e;
|
|
marci@212
|
1193 |
// else graph->first(e.o,e.n);
|
|
marci@148
|
1194 |
// }
|
|
marci@148
|
1195 |
// else {
|
|
marci@148
|
1196 |
// while(graph->valid(e.o) && fmap.get(e.o)<=lomap.get(e.o))
|
|
marci@148
|
1197 |
// graph->goNext(e.o);
|
|
marci@148
|
1198 |
// return e;
|
|
marci@148
|
1199 |
// }
|
|
marci@148
|
1200 |
// }
|
|
marci@148
|
1201 |
// InEdgeIt Next(const InEdgeIt &e) {InEdgeIt t(e); return goNext(t);}
|
|
marci@148
|
1202 |
// */
|
|
marci@148
|
1203 |
// //bool valid(const InEdgeIt e) { return graph->valid(e.i)||graph->valid(e.o);}
|
|
marci@76
|
1204 |
|
|
marci@148
|
1205 |
// //template<typename I> I &goNext(I &i); { return graph->goNext(i); }
|
|
marci@148
|
1206 |
// //template<typename I> I next(const I i); { return graph->goNext(i); }
|
|
marci@76
|
1207 |
|
|
marci@148
|
1208 |
// template< typename It > It first() const {
|
|
marci@212
|
1209 |
// It e; first(e); return e; }
|
|
marci@76
|
1210 |
|
|
marci@174
|
1211 |
// template< typename It > It first(Node v) const {
|
|
marci@212
|
1212 |
// It e; first(e, v); return e; }
|
|
marci@76
|
1213 |
|
|
marci@174
|
1214 |
// Node head(const Edge& e) const { return graph->head(e); }
|
|
marci@174
|
1215 |
// Node tail(const Edge& e) const { return graph->tail(e); }
|
|
marci@76
|
1216 |
|
|
marci@174
|
1217 |
// template<typename I> Node aNode(const I& e) const {
|
|
marci@148
|
1218 |
// return graph->aNode(e); }
|
|
marci@174
|
1219 |
// template<typename I> Node bNode(const I& e) const {
|
|
marci@148
|
1220 |
// return graph->bNode(e); }
|
|
marci@76
|
1221 |
|
|
marci@148
|
1222 |
// //template<typename I> bool valid(const I i);
|
|
marci@148
|
1223 |
// //{ return graph->valid(i); }
|
|
marci@76
|
1224 |
|
|
marci@148
|
1225 |
// //template<typename I> void setInvalid(const I &i);
|
|
marci@148
|
1226 |
// //{ return graph->setInvalid(i); }
|
|
marci@76
|
1227 |
|
|
marci@174
|
1228 |
// Node addNode() { return graph->addNode(); }
|
|
marci@174
|
1229 |
// Edge addEdge(const Node& tail, const Node& head) {
|
|
marci@148
|
1230 |
// return graph->addEdge(tail, head); }
|
|
marci@76
|
1231 |
|
|
marci@148
|
1232 |
// template<typename I> void erase(const I& i) { graph->erase(i); }
|
|
marci@76
|
1233 |
|
|
marci@148
|
1234 |
// void clear() { graph->clear(); }
|
|
marci@76
|
1235 |
|
|
marci@148
|
1236 |
// template<typename S> class NodeMap : public Graph::NodeMap<S> { };
|
|
marci@148
|
1237 |
// template<typename S> class EdgeMap : public Graph::EdgeMap<S> { };
|
|
marci@76
|
1238 |
|
|
marci@148
|
1239 |
// void setGraph(Graph& _graph) { graph = &_graph; }
|
|
marci@148
|
1240 |
// Graph& getGraph() { return (*graph); }
|
|
marci@76
|
1241 |
|
|
marci@148
|
1242 |
// //ResGraphWrapper() : graph(0) { }
|
|
marci@148
|
1243 |
// ResGraphWrapper(Graph& _graph) : graph(&_graph) { }
|
|
marci@148
|
1244 |
// };
|
|
marci@76
|
1245 |
|
|
alpar@105
|
1246 |
} //namespace hugo
|
|
marci@76
|
1247 |
|
|
marci@76
|
1248 |
#endif //GRAPH_WRAPPER_H
|
|
marci@76
|
1249 |
|