deba@1791
|
1 |
/* -*- C++ -*-
|
deba@1791
|
2 |
*
|
alpar@1956
|
3 |
* This file is a part of LEMON, a generic C++ optimization library
|
alpar@1956
|
4 |
*
|
alpar@1956
|
5 |
* Copyright (C) 2003-2006
|
alpar@1956
|
6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
|
alpar@1956
|
7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES).
|
deba@1791
|
8 |
*
|
deba@1791
|
9 |
* Permission to use, modify and distribute this software is granted
|
deba@1791
|
10 |
* provided that this copyright notice appears in all copies. For
|
deba@1791
|
11 |
* precise terms see the accompanying LICENSE file.
|
deba@1791
|
12 |
*
|
deba@1791
|
13 |
* This software is provided "AS IS" with no warranty of any kind,
|
deba@1791
|
14 |
* express or implied, and with no claim as to its suitability for any
|
deba@1791
|
15 |
* purpose.
|
deba@1791
|
16 |
*
|
deba@1791
|
17 |
*/
|
deba@1791
|
18 |
|
deba@1996
|
19 |
#ifndef LEMON_BITS_GRAPH_EXTENDER_H
|
deba@1996
|
20 |
#define LEMON_BITS_GRAPH_EXTENDER_H
|
deba@1791
|
21 |
|
deba@1993
|
22 |
#include <lemon/bits/invalid.h>
|
deba@1791
|
23 |
|
deba@1999
|
24 |
#include <lemon/bits/map_extender.h>
|
deba@1979
|
25 |
#include <lemon/bits/default_map.h>
|
deba@1979
|
26 |
|
deba@1996
|
27 |
///\ingroup graphbits
|
deba@1996
|
28 |
///\file
|
deba@1996
|
29 |
///\brief Extenders for the graph types
|
deba@1791
|
30 |
namespace lemon {
|
deba@1791
|
31 |
|
deba@1996
|
32 |
/// \ingroup graphbits
|
deba@1996
|
33 |
///
|
deba@1996
|
34 |
/// \brief Extender for the Graphs
|
deba@1979
|
35 |
template <typename Base>
|
deba@1979
|
36 |
class GraphExtender : public Base {
|
deba@1791
|
37 |
public:
|
deba@1791
|
38 |
|
deba@1979
|
39 |
typedef Base Parent;
|
deba@1791
|
40 |
typedef GraphExtender Graph;
|
deba@1791
|
41 |
|
deba@1979
|
42 |
// Base extensions
|
deba@1979
|
43 |
|
deba@1791
|
44 |
typedef typename Parent::Node Node;
|
deba@1791
|
45 |
typedef typename Parent::Edge Edge;
|
deba@1791
|
46 |
|
deba@1791
|
47 |
int maxId(Node) const {
|
deba@1791
|
48 |
return Parent::maxNodeId();
|
deba@1791
|
49 |
}
|
deba@1791
|
50 |
|
deba@1791
|
51 |
int maxId(Edge) const {
|
deba@1791
|
52 |
return Parent::maxEdgeId();
|
deba@1791
|
53 |
}
|
deba@1791
|
54 |
|
deba@1791
|
55 |
Node fromId(int id, Node) const {
|
deba@1791
|
56 |
return Parent::nodeFromId(id);
|
deba@1791
|
57 |
}
|
deba@1791
|
58 |
|
deba@1791
|
59 |
Edge fromId(int id, Edge) const {
|
deba@1791
|
60 |
return Parent::edgeFromId(id);
|
deba@1791
|
61 |
}
|
deba@1791
|
62 |
|
deba@1791
|
63 |
Node oppositeNode(const Node &n, const Edge &e) const {
|
deba@1791
|
64 |
if (n == Parent::source(e))
|
deba@1791
|
65 |
return Parent::target(e);
|
deba@1791
|
66 |
else if(n==Parent::target(e))
|
deba@1791
|
67 |
return Parent::source(e);
|
deba@1791
|
68 |
else
|
deba@1791
|
69 |
return INVALID;
|
deba@1791
|
70 |
}
|
deba@1791
|
71 |
|
deba@1979
|
72 |
// Alterable extension
|
deba@1791
|
73 |
|
deba@1999
|
74 |
typedef AlterationNotifier<GraphExtender, Node> NodeNotifier;
|
deba@1999
|
75 |
typedef AlterationNotifier<GraphExtender, Edge> EdgeNotifier;
|
deba@1979
|
76 |
|
deba@1979
|
77 |
|
deba@1979
|
78 |
protected:
|
deba@1979
|
79 |
|
deba@1979
|
80 |
mutable NodeNotifier node_notifier;
|
deba@1979
|
81 |
mutable EdgeNotifier edge_notifier;
|
deba@1791
|
82 |
|
deba@1791
|
83 |
public:
|
deba@1791
|
84 |
|
deba@1979
|
85 |
NodeNotifier& getNotifier(Node) const {
|
deba@1979
|
86 |
return node_notifier;
|
deba@1979
|
87 |
}
|
deba@1979
|
88 |
|
deba@1979
|
89 |
EdgeNotifier& getNotifier(Edge) const {
|
deba@1979
|
90 |
return edge_notifier;
|
deba@1979
|
91 |
}
|
deba@1979
|
92 |
|
deba@1979
|
93 |
class NodeIt : public Node {
|
deba@1979
|
94 |
const Graph* graph;
|
deba@1979
|
95 |
public:
|
deba@1979
|
96 |
|
deba@1979
|
97 |
NodeIt() {}
|
deba@1979
|
98 |
|
deba@1979
|
99 |
NodeIt(Invalid i) : Node(i) { }
|
deba@1979
|
100 |
|
deba@1979
|
101 |
explicit NodeIt(const Graph& _graph) : graph(&_graph) {
|
deba@2031
|
102 |
_graph.first(static_cast<Node&>(*this));
|
deba@1979
|
103 |
}
|
deba@1979
|
104 |
|
deba@1979
|
105 |
NodeIt(const Graph& _graph, const Node& node)
|
deba@1979
|
106 |
: Node(node), graph(&_graph) {}
|
deba@1979
|
107 |
|
deba@1979
|
108 |
NodeIt& operator++() {
|
deba@1979
|
109 |
graph->next(*this);
|
deba@1979
|
110 |
return *this;
|
deba@1979
|
111 |
}
|
deba@1979
|
112 |
|
deba@1979
|
113 |
};
|
deba@1979
|
114 |
|
deba@1979
|
115 |
|
deba@1979
|
116 |
class EdgeIt : public Edge {
|
deba@1979
|
117 |
const Graph* graph;
|
deba@1979
|
118 |
public:
|
deba@1979
|
119 |
|
deba@1979
|
120 |
EdgeIt() { }
|
deba@1979
|
121 |
|
deba@1979
|
122 |
EdgeIt(Invalid i) : Edge(i) { }
|
deba@1979
|
123 |
|
deba@1979
|
124 |
explicit EdgeIt(const Graph& _graph) : graph(&_graph) {
|
deba@2031
|
125 |
_graph.first(static_cast<Edge&>(*this));
|
deba@1979
|
126 |
}
|
deba@1979
|
127 |
|
deba@1979
|
128 |
EdgeIt(const Graph& _graph, const Edge& e) :
|
deba@1979
|
129 |
Edge(e), graph(&_graph) { }
|
deba@1979
|
130 |
|
deba@1979
|
131 |
EdgeIt& operator++() {
|
deba@1979
|
132 |
graph->next(*this);
|
deba@1979
|
133 |
return *this;
|
deba@1979
|
134 |
}
|
deba@1979
|
135 |
|
deba@1979
|
136 |
};
|
deba@1979
|
137 |
|
deba@1979
|
138 |
|
deba@1979
|
139 |
class OutEdgeIt : public Edge {
|
deba@1979
|
140 |
const Graph* graph;
|
deba@1979
|
141 |
public:
|
deba@1979
|
142 |
|
deba@1979
|
143 |
OutEdgeIt() { }
|
deba@1979
|
144 |
|
deba@1979
|
145 |
OutEdgeIt(Invalid i) : Edge(i) { }
|
deba@1979
|
146 |
|
deba@1979
|
147 |
OutEdgeIt(const Graph& _graph, const Node& node)
|
deba@1979
|
148 |
: graph(&_graph) {
|
deba@1979
|
149 |
_graph.firstOut(*this, node);
|
deba@1979
|
150 |
}
|
deba@1979
|
151 |
|
deba@1979
|
152 |
OutEdgeIt(const Graph& _graph, const Edge& edge)
|
deba@1979
|
153 |
: Edge(edge), graph(&_graph) {}
|
deba@1979
|
154 |
|
deba@1979
|
155 |
OutEdgeIt& operator++() {
|
deba@1979
|
156 |
graph->nextOut(*this);
|
deba@1979
|
157 |
return *this;
|
deba@1979
|
158 |
}
|
deba@1979
|
159 |
|
deba@1979
|
160 |
};
|
deba@1979
|
161 |
|
deba@1979
|
162 |
|
deba@1979
|
163 |
class InEdgeIt : public Edge {
|
deba@1979
|
164 |
const Graph* graph;
|
deba@1979
|
165 |
public:
|
deba@1979
|
166 |
|
deba@1979
|
167 |
InEdgeIt() { }
|
deba@1979
|
168 |
|
deba@1979
|
169 |
InEdgeIt(Invalid i) : Edge(i) { }
|
deba@1979
|
170 |
|
deba@1979
|
171 |
InEdgeIt(const Graph& _graph, const Node& node)
|
deba@1979
|
172 |
: graph(&_graph) {
|
deba@1979
|
173 |
_graph.firstIn(*this, node);
|
deba@1979
|
174 |
}
|
deba@1979
|
175 |
|
deba@1979
|
176 |
InEdgeIt(const Graph& _graph, const Edge& edge) :
|
deba@1979
|
177 |
Edge(edge), graph(&_graph) {}
|
deba@1979
|
178 |
|
deba@1979
|
179 |
InEdgeIt& operator++() {
|
deba@1979
|
180 |
graph->nextIn(*this);
|
deba@1979
|
181 |
return *this;
|
deba@1979
|
182 |
}
|
deba@1979
|
183 |
|
deba@1979
|
184 |
};
|
deba@1979
|
185 |
|
deba@1979
|
186 |
/// \brief Base node of the iterator
|
deba@1979
|
187 |
///
|
athos@2102
|
188 |
/// Returns the base node (i.e. the source in this case) of the iterator
|
deba@1979
|
189 |
Node baseNode(const OutEdgeIt &e) const {
|
deba@1979
|
190 |
return Parent::source(e);
|
deba@1979
|
191 |
}
|
deba@1979
|
192 |
/// \brief Running node of the iterator
|
deba@1979
|
193 |
///
|
athos@2102
|
194 |
/// Returns the running node (i.e. the target in this case) of the
|
deba@1979
|
195 |
/// iterator
|
deba@1979
|
196 |
Node runningNode(const OutEdgeIt &e) const {
|
deba@1979
|
197 |
return Parent::target(e);
|
deba@1979
|
198 |
}
|
deba@1979
|
199 |
|
deba@1979
|
200 |
/// \brief Base node of the iterator
|
deba@1979
|
201 |
///
|
athos@2102
|
202 |
/// Returns the base node (i.e. the target in this case) of the iterator
|
deba@1979
|
203 |
Node baseNode(const InEdgeIt &e) const {
|
deba@1979
|
204 |
return Parent::target(e);
|
deba@1979
|
205 |
}
|
deba@1979
|
206 |
/// \brief Running node of the iterator
|
deba@1979
|
207 |
///
|
athos@2102
|
208 |
/// Returns the running node (i.e. the source in this case) of the
|
deba@1979
|
209 |
/// iterator
|
deba@1979
|
210 |
Node runningNode(const InEdgeIt &e) const {
|
deba@1979
|
211 |
return Parent::source(e);
|
deba@1979
|
212 |
}
|
deba@1979
|
213 |
|
deba@1979
|
214 |
|
deba@1979
|
215 |
template <typename _Value>
|
deba@1979
|
216 |
class NodeMap
|
deba@1999
|
217 |
: public MapExtender<DefaultMap<Graph, Node, _Value> > {
|
deba@1979
|
218 |
public:
|
deba@1979
|
219 |
typedef GraphExtender Graph;
|
deba@1999
|
220 |
typedef MapExtender<DefaultMap<Graph, Node, _Value> > Parent;
|
deba@1979
|
221 |
|
klao@2046
|
222 |
explicit NodeMap(const Graph& graph)
|
deba@1999
|
223 |
: Parent(graph) {}
|
deba@1999
|
224 |
NodeMap(const Graph& graph, const _Value& value)
|
deba@1999
|
225 |
: Parent(graph, value) {}
|
deba@1979
|
226 |
|
deba@1979
|
227 |
NodeMap& operator=(const NodeMap& cmap) {
|
deba@1979
|
228 |
return operator=<NodeMap>(cmap);
|
deba@1979
|
229 |
}
|
deba@1979
|
230 |
|
deba@1979
|
231 |
template <typename CMap>
|
deba@1979
|
232 |
NodeMap& operator=(const CMap& cmap) {
|
deba@2031
|
233 |
Parent::operator=(cmap);
|
deba@1979
|
234 |
return *this;
|
deba@1979
|
235 |
}
|
deba@1979
|
236 |
|
deba@1979
|
237 |
};
|
deba@1979
|
238 |
|
deba@1979
|
239 |
template <typename _Value>
|
deba@1979
|
240 |
class EdgeMap
|
deba@1999
|
241 |
: public MapExtender<DefaultMap<Graph, Edge, _Value> > {
|
deba@1979
|
242 |
public:
|
deba@1979
|
243 |
typedef GraphExtender Graph;
|
deba@1999
|
244 |
typedef MapExtender<DefaultMap<Graph, Edge, _Value> > Parent;
|
deba@1979
|
245 |
|
klao@2046
|
246 |
explicit EdgeMap(const Graph& graph)
|
deba@1999
|
247 |
: Parent(graph) {}
|
deba@1999
|
248 |
EdgeMap(const Graph& graph, const _Value& value)
|
deba@1999
|
249 |
: Parent(graph, value) {}
|
deba@1979
|
250 |
|
deba@1979
|
251 |
EdgeMap& operator=(const EdgeMap& cmap) {
|
deba@1979
|
252 |
return operator=<EdgeMap>(cmap);
|
deba@1979
|
253 |
}
|
deba@1979
|
254 |
|
deba@1979
|
255 |
template <typename CMap>
|
deba@1979
|
256 |
EdgeMap& operator=(const CMap& cmap) {
|
deba@2031
|
257 |
Parent::operator=(cmap);
|
deba@1979
|
258 |
return *this;
|
deba@1979
|
259 |
}
|
deba@1979
|
260 |
};
|
deba@1979
|
261 |
|
deba@1979
|
262 |
|
deba@1979
|
263 |
Node addNode() {
|
deba@1979
|
264 |
Node node = Parent::addNode();
|
deba@1979
|
265 |
getNotifier(Node()).add(node);
|
deba@1979
|
266 |
return node;
|
deba@1979
|
267 |
}
|
deba@1979
|
268 |
|
deba@1979
|
269 |
Edge addEdge(const Node& from, const Node& to) {
|
deba@1979
|
270 |
Edge edge = Parent::addEdge(from, to);
|
deba@1979
|
271 |
getNotifier(Edge()).add(edge);
|
deba@1979
|
272 |
return edge;
|
deba@1979
|
273 |
}
|
deba@1979
|
274 |
|
deba@1979
|
275 |
void clear() {
|
deba@1979
|
276 |
getNotifier(Edge()).clear();
|
deba@1979
|
277 |
getNotifier(Node()).clear();
|
deba@1979
|
278 |
Parent::clear();
|
deba@1979
|
279 |
}
|
deba@1979
|
280 |
|
deba@1979
|
281 |
|
deba@1979
|
282 |
void erase(const Node& node) {
|
deba@1979
|
283 |
Edge edge;
|
deba@1979
|
284 |
Parent::firstOut(edge, node);
|
deba@1979
|
285 |
while (edge != INVALID ) {
|
deba@1979
|
286 |
erase(edge);
|
deba@1979
|
287 |
Parent::firstOut(edge, node);
|
deba@1979
|
288 |
}
|
deba@1979
|
289 |
|
deba@1979
|
290 |
Parent::firstIn(edge, node);
|
deba@1979
|
291 |
while (edge != INVALID ) {
|
deba@1979
|
292 |
erase(edge);
|
deba@1979
|
293 |
Parent::firstIn(edge, node);
|
deba@1979
|
294 |
}
|
deba@1979
|
295 |
|
deba@1979
|
296 |
getNotifier(Node()).erase(node);
|
deba@1979
|
297 |
Parent::erase(node);
|
deba@1979
|
298 |
}
|
deba@1979
|
299 |
|
deba@1979
|
300 |
void erase(const Edge& edge) {
|
deba@1979
|
301 |
getNotifier(Edge()).erase(edge);
|
deba@1979
|
302 |
Parent::erase(edge);
|
deba@1979
|
303 |
}
|
deba@1979
|
304 |
|
deba@1999
|
305 |
GraphExtender() {
|
deba@1999
|
306 |
node_notifier.setContainer(*this);
|
deba@1999
|
307 |
edge_notifier.setContainer(*this);
|
deba@1999
|
308 |
}
|
deba@1999
|
309 |
|
deba@1979
|
310 |
|
deba@1979
|
311 |
~GraphExtender() {
|
deba@1999
|
312 |
edge_notifier.clear();
|
deba@1999
|
313 |
node_notifier.clear();
|
deba@1979
|
314 |
}
|
deba@1979
|
315 |
};
|
deba@1979
|
316 |
|
deba@1791
|
317 |
}
|
deba@1791
|
318 |
|
deba@1996
|
319 |
#endif
|