deba@2115
|
1 |
/* -*- C++ -*-
|
deba@2115
|
2 |
*
|
deba@2115
|
3 |
* This file is a part of LEMON, a generic C++ optimization library
|
deba@2115
|
4 |
*
|
deba@2115
|
5 |
* Copyright (C) 2003-2006
|
deba@2115
|
6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
|
deba@2115
|
7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES).
|
deba@2115
|
8 |
*
|
deba@2115
|
9 |
* Permission to use, modify and distribute this software is granted
|
deba@2115
|
10 |
* provided that this copyright notice appears in all copies. For
|
deba@2115
|
11 |
* precise terms see the accompanying LICENSE file.
|
deba@2115
|
12 |
*
|
deba@2115
|
13 |
* This software is provided "AS IS" with no warranty of any kind,
|
deba@2115
|
14 |
* express or implied, and with no claim as to its suitability for any
|
deba@2115
|
15 |
* purpose.
|
deba@2115
|
16 |
*
|
deba@2115
|
17 |
*/
|
deba@2115
|
18 |
|
deba@2115
|
19 |
#ifndef LEMON_BITS_UGRAPH_EXTENDER_H
|
deba@2115
|
20 |
#define LEMON_BITS_UGRAPH_EXTENDER_H
|
deba@2115
|
21 |
|
deba@2115
|
22 |
#include <lemon/bits/invalid.h>
|
deba@2115
|
23 |
#include <lemon/error.h>
|
deba@2115
|
24 |
|
deba@2115
|
25 |
#include <lemon/bits/map_extender.h>
|
deba@2115
|
26 |
#include <lemon/bits/default_map.h>
|
deba@2115
|
27 |
|
deba@2115
|
28 |
#include <lemon/concept_check.h>
|
deba@2115
|
29 |
#include <lemon/concept/maps.h>
|
deba@2115
|
30 |
|
deba@2115
|
31 |
///\ingroup graphbits
|
deba@2115
|
32 |
///\file
|
deba@2115
|
33 |
///\brief Extenders for the graph types
|
deba@2115
|
34 |
namespace lemon {
|
deba@2115
|
35 |
|
deba@2115
|
36 |
/// \ingroup graphbits
|
deba@2115
|
37 |
///
|
deba@2115
|
38 |
/// \brief Extender for the UGraphs
|
deba@2115
|
39 |
template <typename Base>
|
deba@2115
|
40 |
class UGraphExtender : public Base {
|
deba@2115
|
41 |
public:
|
deba@2115
|
42 |
|
deba@2115
|
43 |
typedef Base Parent;
|
deba@2115
|
44 |
typedef UGraphExtender Graph;
|
deba@2115
|
45 |
|
deba@2115
|
46 |
typedef typename Parent::Node Node;
|
deba@2115
|
47 |
typedef typename Parent::Edge Edge;
|
deba@2115
|
48 |
typedef typename Parent::UEdge UEdge;
|
deba@2115
|
49 |
|
deba@2115
|
50 |
// UGraph extension
|
deba@2115
|
51 |
|
deba@2115
|
52 |
int maxId(Node) const {
|
deba@2115
|
53 |
return Parent::maxNodeId();
|
deba@2115
|
54 |
}
|
deba@2115
|
55 |
|
deba@2115
|
56 |
int maxId(Edge) const {
|
deba@2115
|
57 |
return Parent::maxEdgeId();
|
deba@2115
|
58 |
}
|
deba@2115
|
59 |
|
deba@2115
|
60 |
int maxId(UEdge) const {
|
deba@2115
|
61 |
return Parent::maxUEdgeId();
|
deba@2115
|
62 |
}
|
deba@2115
|
63 |
|
deba@2115
|
64 |
Node fromId(int id, Node) const {
|
deba@2115
|
65 |
return Parent::nodeFromId(id);
|
deba@2115
|
66 |
}
|
deba@2115
|
67 |
|
deba@2115
|
68 |
Edge fromId(int id, Edge) const {
|
deba@2115
|
69 |
return Parent::edgeFromId(id);
|
deba@2115
|
70 |
}
|
deba@2115
|
71 |
|
deba@2115
|
72 |
UEdge fromId(int id, UEdge) const {
|
deba@2115
|
73 |
return Parent::uEdgeFromId(id);
|
deba@2115
|
74 |
}
|
deba@2115
|
75 |
|
deba@2115
|
76 |
Node oppositeNode(const Node &n, const UEdge &e) const {
|
deba@2115
|
77 |
if( n == Parent::source(e))
|
deba@2115
|
78 |
return Parent::target(e);
|
deba@2115
|
79 |
else if( n == Parent::target(e))
|
deba@2115
|
80 |
return Parent::source(e);
|
deba@2115
|
81 |
else
|
deba@2115
|
82 |
return INVALID;
|
deba@2115
|
83 |
}
|
deba@2115
|
84 |
|
deba@2115
|
85 |
Edge oppositeEdge(const Edge &e) const {
|
deba@2115
|
86 |
return Parent::direct(e, !Parent::direction(e));
|
deba@2115
|
87 |
}
|
deba@2115
|
88 |
|
deba@2115
|
89 |
using Parent::direct;
|
deba@2115
|
90 |
Edge direct(const UEdge &ue, const Node &s) const {
|
deba@2115
|
91 |
return Parent::direct(ue, Parent::source(ue) == s);
|
deba@2115
|
92 |
}
|
deba@2115
|
93 |
|
deba@2115
|
94 |
// Alterable extension
|
deba@2115
|
95 |
|
deba@2115
|
96 |
typedef AlterationNotifier<UGraphExtender, Node> NodeNotifier;
|
deba@2115
|
97 |
typedef AlterationNotifier<UGraphExtender, Edge> EdgeNotifier;
|
deba@2115
|
98 |
typedef AlterationNotifier<UGraphExtender, UEdge> UEdgeNotifier;
|
deba@2115
|
99 |
|
deba@2115
|
100 |
|
deba@2115
|
101 |
protected:
|
deba@2115
|
102 |
|
deba@2115
|
103 |
mutable NodeNotifier node_notifier;
|
deba@2115
|
104 |
mutable EdgeNotifier edge_notifier;
|
deba@2115
|
105 |
mutable UEdgeNotifier uedge_notifier;
|
deba@2115
|
106 |
|
deba@2115
|
107 |
public:
|
deba@2115
|
108 |
|
deba@2115
|
109 |
NodeNotifier& getNotifier(Node) const {
|
deba@2115
|
110 |
return node_notifier;
|
deba@2115
|
111 |
}
|
deba@2115
|
112 |
|
deba@2115
|
113 |
EdgeNotifier& getNotifier(Edge) const {
|
deba@2115
|
114 |
return edge_notifier;
|
deba@2115
|
115 |
}
|
deba@2115
|
116 |
|
deba@2115
|
117 |
UEdgeNotifier& getNotifier(UEdge) const {
|
deba@2115
|
118 |
return uedge_notifier;
|
deba@2115
|
119 |
}
|
deba@2115
|
120 |
|
deba@2115
|
121 |
|
deba@2115
|
122 |
|
deba@2115
|
123 |
class NodeIt : public Node {
|
deba@2115
|
124 |
const Graph* graph;
|
deba@2115
|
125 |
public:
|
deba@2115
|
126 |
|
deba@2115
|
127 |
NodeIt() {}
|
deba@2115
|
128 |
|
deba@2115
|
129 |
NodeIt(Invalid i) : Node(i) { }
|
deba@2115
|
130 |
|
deba@2115
|
131 |
explicit NodeIt(const Graph& _graph) : graph(&_graph) {
|
deba@2115
|
132 |
_graph.first(static_cast<Node&>(*this));
|
deba@2115
|
133 |
}
|
deba@2115
|
134 |
|
deba@2115
|
135 |
NodeIt(const Graph& _graph, const Node& node)
|
deba@2115
|
136 |
: Node(node), graph(&_graph) {}
|
deba@2115
|
137 |
|
deba@2115
|
138 |
NodeIt& operator++() {
|
deba@2115
|
139 |
graph->next(*this);
|
deba@2115
|
140 |
return *this;
|
deba@2115
|
141 |
}
|
deba@2115
|
142 |
|
deba@2115
|
143 |
};
|
deba@2115
|
144 |
|
deba@2115
|
145 |
|
deba@2115
|
146 |
class EdgeIt : public Edge {
|
deba@2115
|
147 |
const Graph* graph;
|
deba@2115
|
148 |
public:
|
deba@2115
|
149 |
|
deba@2115
|
150 |
EdgeIt() { }
|
deba@2115
|
151 |
|
deba@2115
|
152 |
EdgeIt(Invalid i) : Edge(i) { }
|
deba@2115
|
153 |
|
deba@2115
|
154 |
explicit EdgeIt(const Graph& _graph) : graph(&_graph) {
|
deba@2115
|
155 |
_graph.first(static_cast<Edge&>(*this));
|
deba@2115
|
156 |
}
|
deba@2115
|
157 |
|
deba@2115
|
158 |
EdgeIt(const Graph& _graph, const Edge& e) :
|
deba@2115
|
159 |
Edge(e), graph(&_graph) { }
|
deba@2115
|
160 |
|
deba@2115
|
161 |
EdgeIt& operator++() {
|
deba@2115
|
162 |
graph->next(*this);
|
deba@2115
|
163 |
return *this;
|
deba@2115
|
164 |
}
|
deba@2115
|
165 |
|
deba@2115
|
166 |
};
|
deba@2115
|
167 |
|
deba@2115
|
168 |
|
deba@2115
|
169 |
class OutEdgeIt : public Edge {
|
deba@2115
|
170 |
const Graph* graph;
|
deba@2115
|
171 |
public:
|
deba@2115
|
172 |
|
deba@2115
|
173 |
OutEdgeIt() { }
|
deba@2115
|
174 |
|
deba@2115
|
175 |
OutEdgeIt(Invalid i) : Edge(i) { }
|
deba@2115
|
176 |
|
deba@2115
|
177 |
OutEdgeIt(const Graph& _graph, const Node& node)
|
deba@2115
|
178 |
: graph(&_graph) {
|
deba@2115
|
179 |
_graph.firstOut(*this, node);
|
deba@2115
|
180 |
}
|
deba@2115
|
181 |
|
deba@2115
|
182 |
OutEdgeIt(const Graph& _graph, const Edge& edge)
|
deba@2115
|
183 |
: Edge(edge), graph(&_graph) {}
|
deba@2115
|
184 |
|
deba@2115
|
185 |
OutEdgeIt& operator++() {
|
deba@2115
|
186 |
graph->nextOut(*this);
|
deba@2115
|
187 |
return *this;
|
deba@2115
|
188 |
}
|
deba@2115
|
189 |
|
deba@2115
|
190 |
};
|
deba@2115
|
191 |
|
deba@2115
|
192 |
|
deba@2115
|
193 |
class InEdgeIt : public Edge {
|
deba@2115
|
194 |
const Graph* graph;
|
deba@2115
|
195 |
public:
|
deba@2115
|
196 |
|
deba@2115
|
197 |
InEdgeIt() { }
|
deba@2115
|
198 |
|
deba@2115
|
199 |
InEdgeIt(Invalid i) : Edge(i) { }
|
deba@2115
|
200 |
|
deba@2115
|
201 |
InEdgeIt(const Graph& _graph, const Node& node)
|
deba@2115
|
202 |
: graph(&_graph) {
|
deba@2115
|
203 |
_graph.firstIn(*this, node);
|
deba@2115
|
204 |
}
|
deba@2115
|
205 |
|
deba@2115
|
206 |
InEdgeIt(const Graph& _graph, const Edge& edge) :
|
deba@2115
|
207 |
Edge(edge), graph(&_graph) {}
|
deba@2115
|
208 |
|
deba@2115
|
209 |
InEdgeIt& operator++() {
|
deba@2115
|
210 |
graph->nextIn(*this);
|
deba@2115
|
211 |
return *this;
|
deba@2115
|
212 |
}
|
deba@2115
|
213 |
|
deba@2115
|
214 |
};
|
deba@2115
|
215 |
|
deba@2115
|
216 |
|
deba@2115
|
217 |
class UEdgeIt : public Parent::UEdge {
|
deba@2115
|
218 |
const Graph* graph;
|
deba@2115
|
219 |
public:
|
deba@2115
|
220 |
|
deba@2115
|
221 |
UEdgeIt() { }
|
deba@2115
|
222 |
|
deba@2115
|
223 |
UEdgeIt(Invalid i) : UEdge(i) { }
|
deba@2115
|
224 |
|
deba@2115
|
225 |
explicit UEdgeIt(const Graph& _graph) : graph(&_graph) {
|
deba@2115
|
226 |
_graph.first(static_cast<UEdge&>(*this));
|
deba@2115
|
227 |
}
|
deba@2115
|
228 |
|
deba@2115
|
229 |
UEdgeIt(const Graph& _graph, const UEdge& e) :
|
deba@2115
|
230 |
UEdge(e), graph(&_graph) { }
|
deba@2115
|
231 |
|
deba@2115
|
232 |
UEdgeIt& operator++() {
|
deba@2115
|
233 |
graph->next(*this);
|
deba@2115
|
234 |
return *this;
|
deba@2115
|
235 |
}
|
deba@2115
|
236 |
|
deba@2115
|
237 |
};
|
deba@2115
|
238 |
|
deba@2115
|
239 |
class IncEdgeIt : public Parent::UEdge {
|
deba@2115
|
240 |
friend class UGraphExtender;
|
deba@2115
|
241 |
const Graph* graph;
|
deba@2115
|
242 |
bool direction;
|
deba@2115
|
243 |
public:
|
deba@2115
|
244 |
|
deba@2115
|
245 |
IncEdgeIt() { }
|
deba@2115
|
246 |
|
deba@2115
|
247 |
IncEdgeIt(Invalid i) : UEdge(i), direction(false) { }
|
deba@2115
|
248 |
|
deba@2115
|
249 |
IncEdgeIt(const Graph& _graph, const Node &n) : graph(&_graph) {
|
deba@2115
|
250 |
_graph.firstInc(*this, direction, n);
|
deba@2115
|
251 |
}
|
deba@2115
|
252 |
|
deba@2115
|
253 |
IncEdgeIt(const Graph& _graph, const UEdge &ue, const Node &n)
|
deba@2115
|
254 |
: graph(&_graph), UEdge(ue) {
|
deba@2115
|
255 |
direction = (_graph.source(ue) == n);
|
deba@2115
|
256 |
}
|
deba@2115
|
257 |
|
deba@2115
|
258 |
IncEdgeIt& operator++() {
|
deba@2115
|
259 |
graph->nextInc(*this, direction);
|
deba@2115
|
260 |
return *this;
|
deba@2115
|
261 |
}
|
deba@2115
|
262 |
};
|
deba@2115
|
263 |
|
deba@2115
|
264 |
/// \brief Base node of the iterator
|
deba@2115
|
265 |
///
|
deba@2115
|
266 |
/// Returns the base node (ie. the source in this case) of the iterator
|
deba@2115
|
267 |
Node baseNode(const OutEdgeIt &e) const {
|
deba@2115
|
268 |
return Parent::source((Edge)e);
|
deba@2115
|
269 |
}
|
deba@2115
|
270 |
/// \brief Running node of the iterator
|
deba@2115
|
271 |
///
|
deba@2115
|
272 |
/// Returns the running node (ie. the target in this case) of the
|
deba@2115
|
273 |
/// iterator
|
deba@2115
|
274 |
Node runningNode(const OutEdgeIt &e) const {
|
deba@2115
|
275 |
return Parent::target((Edge)e);
|
deba@2115
|
276 |
}
|
deba@2115
|
277 |
|
deba@2115
|
278 |
/// \brief Base node of the iterator
|
deba@2115
|
279 |
///
|
deba@2115
|
280 |
/// Returns the base node (ie. the target in this case) of the iterator
|
deba@2115
|
281 |
Node baseNode(const InEdgeIt &e) const {
|
deba@2115
|
282 |
return Parent::target((Edge)e);
|
deba@2115
|
283 |
}
|
deba@2115
|
284 |
/// \brief Running node of the iterator
|
deba@2115
|
285 |
///
|
deba@2115
|
286 |
/// Returns the running node (ie. the source in this case) of the
|
deba@2115
|
287 |
/// iterator
|
deba@2115
|
288 |
Node runningNode(const InEdgeIt &e) const {
|
deba@2115
|
289 |
return Parent::source((Edge)e);
|
deba@2115
|
290 |
}
|
deba@2115
|
291 |
|
deba@2115
|
292 |
/// Base node of the iterator
|
deba@2115
|
293 |
///
|
deba@2115
|
294 |
/// Returns the base node of the iterator
|
deba@2115
|
295 |
Node baseNode(const IncEdgeIt &e) const {
|
deba@2115
|
296 |
return e.direction ? source(e) : target(e);
|
deba@2115
|
297 |
}
|
deba@2115
|
298 |
/// Running node of the iterator
|
deba@2115
|
299 |
///
|
deba@2115
|
300 |
/// Returns the running node of the iterator
|
deba@2115
|
301 |
Node runningNode(const IncEdgeIt &e) const {
|
deba@2115
|
302 |
return e.direction ? target(e) : source(e);
|
deba@2115
|
303 |
}
|
deba@2115
|
304 |
|
deba@2115
|
305 |
// Mappable extension
|
deba@2115
|
306 |
|
deba@2115
|
307 |
template <typename _Value>
|
deba@2115
|
308 |
class NodeMap
|
deba@2115
|
309 |
: public MapExtender<DefaultMap<Graph, Node, _Value> > {
|
deba@2115
|
310 |
public:
|
deba@2115
|
311 |
typedef UGraphExtender Graph;
|
deba@2115
|
312 |
typedef MapExtender<DefaultMap<Graph, Node, _Value> > Parent;
|
deba@2115
|
313 |
|
deba@2115
|
314 |
NodeMap(const Graph& graph)
|
deba@2115
|
315 |
: Parent(graph) {}
|
deba@2115
|
316 |
NodeMap(const Graph& graph, const _Value& value)
|
deba@2115
|
317 |
: Parent(graph, value) {}
|
deba@2115
|
318 |
|
deba@2115
|
319 |
NodeMap& operator=(const NodeMap& cmap) {
|
deba@2115
|
320 |
return operator=<NodeMap>(cmap);
|
deba@2115
|
321 |
}
|
deba@2115
|
322 |
|
deba@2115
|
323 |
template <typename CMap>
|
deba@2115
|
324 |
NodeMap& operator=(const CMap& cmap) {
|
deba@2115
|
325 |
Parent::operator=(cmap);
|
deba@2115
|
326 |
return *this;
|
deba@2115
|
327 |
}
|
deba@2115
|
328 |
|
deba@2115
|
329 |
};
|
deba@2115
|
330 |
|
deba@2115
|
331 |
template <typename _Value>
|
deba@2115
|
332 |
class EdgeMap
|
deba@2115
|
333 |
: public MapExtender<DefaultMap<Graph, Edge, _Value> > {
|
deba@2115
|
334 |
public:
|
deba@2115
|
335 |
typedef UGraphExtender Graph;
|
deba@2115
|
336 |
typedef MapExtender<DefaultMap<Graph, Edge, _Value> > Parent;
|
deba@2115
|
337 |
|
deba@2115
|
338 |
EdgeMap(const Graph& graph)
|
deba@2115
|
339 |
: Parent(graph) {}
|
deba@2115
|
340 |
EdgeMap(const Graph& graph, const _Value& value)
|
deba@2115
|
341 |
: Parent(graph, value) {}
|
deba@2115
|
342 |
|
deba@2115
|
343 |
EdgeMap& operator=(const EdgeMap& cmap) {
|
deba@2115
|
344 |
return operator=<EdgeMap>(cmap);
|
deba@2115
|
345 |
}
|
deba@2115
|
346 |
|
deba@2115
|
347 |
template <typename CMap>
|
deba@2115
|
348 |
EdgeMap& operator=(const CMap& cmap) {
|
deba@2115
|
349 |
Parent::operator=(cmap);
|
deba@2115
|
350 |
return *this;
|
deba@2115
|
351 |
}
|
deba@2115
|
352 |
};
|
deba@2115
|
353 |
|
deba@2115
|
354 |
|
deba@2115
|
355 |
template <typename _Value>
|
deba@2115
|
356 |
class UEdgeMap
|
deba@2115
|
357 |
: public MapExtender<DefaultMap<Graph, UEdge, _Value> > {
|
deba@2115
|
358 |
public:
|
deba@2115
|
359 |
typedef UGraphExtender Graph;
|
deba@2115
|
360 |
typedef MapExtender<DefaultMap<Graph, UEdge, _Value> > Parent;
|
deba@2115
|
361 |
|
deba@2115
|
362 |
UEdgeMap(const Graph& graph)
|
deba@2115
|
363 |
: Parent(graph) {}
|
deba@2115
|
364 |
|
deba@2115
|
365 |
UEdgeMap(const Graph& graph, const _Value& value)
|
deba@2115
|
366 |
: Parent(graph, value) {}
|
deba@2115
|
367 |
|
deba@2115
|
368 |
UEdgeMap& operator=(const UEdgeMap& cmap) {
|
deba@2115
|
369 |
return operator=<UEdgeMap>(cmap);
|
deba@2115
|
370 |
}
|
deba@2115
|
371 |
|
deba@2115
|
372 |
template <typename CMap>
|
deba@2115
|
373 |
UEdgeMap& operator=(const CMap& cmap) {
|
deba@2115
|
374 |
Parent::operator=(cmap);
|
deba@2115
|
375 |
return *this;
|
deba@2115
|
376 |
}
|
deba@2115
|
377 |
|
deba@2115
|
378 |
};
|
deba@2115
|
379 |
|
deba@2115
|
380 |
// Alteration extension
|
deba@2115
|
381 |
|
deba@2115
|
382 |
Node addNode() {
|
deba@2115
|
383 |
Node node = Parent::addNode();
|
deba@2115
|
384 |
getNotifier(Node()).add(node);
|
deba@2115
|
385 |
return node;
|
deba@2115
|
386 |
}
|
deba@2115
|
387 |
|
deba@2115
|
388 |
UEdge addEdge(const Node& from, const Node& to) {
|
deba@2115
|
389 |
UEdge uedge = Parent::addEdge(from, to);
|
deba@2115
|
390 |
getNotifier(UEdge()).add(uedge);
|
deba@2115
|
391 |
getNotifier(Edge()).add(Parent::direct(uedge, true));
|
deba@2115
|
392 |
getNotifier(Edge()).add(Parent::direct(uedge, false));
|
deba@2115
|
393 |
return uedge;
|
deba@2115
|
394 |
}
|
deba@2115
|
395 |
|
deba@2115
|
396 |
void clear() {
|
deba@2115
|
397 |
getNotifier(Edge()).clear();
|
deba@2115
|
398 |
getNotifier(UEdge()).clear();
|
deba@2115
|
399 |
getNotifier(Node()).clear();
|
deba@2115
|
400 |
Parent::clear();
|
deba@2115
|
401 |
}
|
deba@2115
|
402 |
|
deba@2115
|
403 |
void erase(const Node& node) {
|
deba@2115
|
404 |
Edge edge;
|
deba@2115
|
405 |
Parent::firstOut(edge, node);
|
deba@2115
|
406 |
while (edge != INVALID ) {
|
deba@2115
|
407 |
erase(edge);
|
deba@2115
|
408 |
Parent::firstOut(edge, node);
|
deba@2115
|
409 |
}
|
deba@2115
|
410 |
|
deba@2115
|
411 |
Parent::firstIn(edge, node);
|
deba@2115
|
412 |
while (edge != INVALID ) {
|
deba@2115
|
413 |
erase(edge);
|
deba@2115
|
414 |
Parent::firstIn(edge, node);
|
deba@2115
|
415 |
}
|
deba@2115
|
416 |
|
deba@2115
|
417 |
getNotifier(Node()).erase(node);
|
deba@2115
|
418 |
Parent::erase(node);
|
deba@2115
|
419 |
}
|
deba@2115
|
420 |
|
deba@2115
|
421 |
void erase(const UEdge& uedge) {
|
deba@2115
|
422 |
getNotifier(Edge()).erase(Parent::direct(uedge, true));
|
deba@2115
|
423 |
getNotifier(Edge()).erase(Parent::direct(uedge, false));
|
deba@2115
|
424 |
getNotifier(UEdge()).erase(uedge);
|
deba@2115
|
425 |
Parent::erase(uedge);
|
deba@2115
|
426 |
}
|
deba@2115
|
427 |
|
deba@2115
|
428 |
UGraphExtender() {
|
deba@2115
|
429 |
node_notifier.setContainer(*this);
|
deba@2115
|
430 |
edge_notifier.setContainer(*this);
|
deba@2115
|
431 |
uedge_notifier.setContainer(*this);
|
deba@2115
|
432 |
}
|
deba@2115
|
433 |
|
deba@2115
|
434 |
~UGraphExtender() {
|
deba@2115
|
435 |
uedge_notifier.clear();
|
deba@2115
|
436 |
edge_notifier.clear();
|
deba@2115
|
437 |
node_notifier.clear();
|
deba@2115
|
438 |
}
|
deba@2115
|
439 |
|
deba@2115
|
440 |
};
|
deba@2115
|
441 |
|
deba@2115
|
442 |
}
|
deba@2115
|
443 |
|
deba@2115
|
444 |
#endif
|