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_FULL_BPUGRAPH_H
|
deba@2115
|
20 |
#define LEMON_FULL_BPUGRAPH_H
|
deba@2115
|
21 |
|
deba@2115
|
22 |
#include <cmath>
|
deba@2115
|
23 |
|
deba@2115
|
24 |
#include <lemon/bits/bpugraph_extender.h>
|
deba@2115
|
25 |
|
deba@2115
|
26 |
#include <lemon/bits/invalid.h>
|
deba@2115
|
27 |
#include <lemon/bits/utility.h>
|
deba@2115
|
28 |
|
deba@2115
|
29 |
|
deba@2115
|
30 |
///\ingroup graphs
|
deba@2115
|
31 |
///\file
|
deba@2115
|
32 |
///\brief FullBpUGraph class.
|
deba@2115
|
33 |
|
deba@2115
|
34 |
|
deba@2115
|
35 |
namespace lemon {
|
deba@2115
|
36 |
|
deba@2115
|
37 |
class FullBpUGraphBase {
|
deba@2115
|
38 |
protected:
|
deba@2115
|
39 |
|
deba@2115
|
40 |
int _aNodeNum;
|
deba@2115
|
41 |
int _bNodeNum;
|
deba@2115
|
42 |
|
deba@2115
|
43 |
int _edgeNum;
|
deba@2115
|
44 |
|
deba@2115
|
45 |
public:
|
deba@2115
|
46 |
|
deba@2115
|
47 |
class NodeSetError : public LogicError {
|
deba@2115
|
48 |
virtual const char* exceptionName() const {
|
deba@2115
|
49 |
return "lemon::FullBpUGraph::NodeSetError";
|
deba@2115
|
50 |
}
|
deba@2115
|
51 |
};
|
deba@2115
|
52 |
|
deba@2115
|
53 |
class Node {
|
deba@2115
|
54 |
friend class FullBpUGraphBase;
|
deba@2115
|
55 |
protected:
|
deba@2115
|
56 |
int id;
|
deba@2115
|
57 |
|
deba@2115
|
58 |
Node(int _id) : id(_id) {}
|
deba@2115
|
59 |
public:
|
deba@2115
|
60 |
Node() {}
|
deba@2115
|
61 |
Node(Invalid) { id = -1; }
|
deba@2115
|
62 |
bool operator==(const Node i) const {return id==i.id;}
|
deba@2115
|
63 |
bool operator!=(const Node i) const {return id!=i.id;}
|
deba@2115
|
64 |
bool operator<(const Node i) const {return id<i.id;}
|
deba@2115
|
65 |
};
|
deba@2115
|
66 |
|
deba@2115
|
67 |
class UEdge {
|
deba@2115
|
68 |
friend class FullBpUGraphBase;
|
deba@2115
|
69 |
protected:
|
deba@2115
|
70 |
int id;
|
deba@2115
|
71 |
|
deba@2115
|
72 |
UEdge(int _id) { id = _id;}
|
deba@2115
|
73 |
public:
|
deba@2115
|
74 |
UEdge() {}
|
deba@2115
|
75 |
UEdge (Invalid) { id = -1; }
|
deba@2115
|
76 |
bool operator==(const UEdge i) const {return id==i.id;}
|
deba@2115
|
77 |
bool operator!=(const UEdge i) const {return id!=i.id;}
|
deba@2115
|
78 |
bool operator<(const UEdge i) const {return id<i.id;}
|
deba@2115
|
79 |
};
|
deba@2115
|
80 |
|
deba@2115
|
81 |
void construct(int aNodeNum, int bNodeNum) {
|
deba@2115
|
82 |
_aNodeNum = aNodeNum;
|
deba@2115
|
83 |
_bNodeNum = bNodeNum;
|
deba@2115
|
84 |
_edgeNum = aNodeNum * bNodeNum;
|
deba@2115
|
85 |
}
|
deba@2115
|
86 |
|
deba@2115
|
87 |
void firstANode(Node& node) const {
|
deba@2115
|
88 |
node.id = 2 * _aNodeNum - 2;
|
deba@2115
|
89 |
if (node.id < 0) node.id = -1;
|
deba@2115
|
90 |
}
|
deba@2115
|
91 |
void nextANode(Node& node) const {
|
deba@2115
|
92 |
node.id -= 2;
|
deba@2115
|
93 |
if (node.id < 0) node.id = -1;
|
deba@2115
|
94 |
}
|
deba@2115
|
95 |
|
deba@2115
|
96 |
void firstBNode(Node& node) const {
|
deba@2115
|
97 |
node.id = 2 * _bNodeNum - 1;
|
deba@2115
|
98 |
}
|
deba@2115
|
99 |
void nextBNode(Node& node) const {
|
deba@2115
|
100 |
node.id -= 2;
|
deba@2115
|
101 |
}
|
deba@2115
|
102 |
|
deba@2115
|
103 |
void first(Node& node) const {
|
deba@2115
|
104 |
if (_aNodeNum > 0) {
|
deba@2115
|
105 |
node.id = 2 * _aNodeNum - 2;
|
deba@2115
|
106 |
} else {
|
deba@2115
|
107 |
node.id = 2 * _bNodeNum - 1;
|
deba@2115
|
108 |
}
|
deba@2115
|
109 |
}
|
deba@2115
|
110 |
void next(Node& node) const {
|
deba@2115
|
111 |
node.id -= 2;
|
deba@2115
|
112 |
if (node.id == -2) {
|
deba@2115
|
113 |
node.id = 2 * _bNodeNum - 1;
|
deba@2115
|
114 |
}
|
deba@2115
|
115 |
}
|
deba@2115
|
116 |
|
deba@2115
|
117 |
void first(UEdge& edge) const {
|
deba@2115
|
118 |
edge.id = _edgeNum - 1;
|
deba@2115
|
119 |
}
|
deba@2115
|
120 |
void next(UEdge& edge) const {
|
deba@2115
|
121 |
--edge.id;
|
deba@2115
|
122 |
}
|
deba@2115
|
123 |
|
deba@2115
|
124 |
void firstFromANode(UEdge& edge, const Node& node) const {
|
deba@2115
|
125 |
LEMON_ASSERT((node.id & 1) == 0, NodeSetError());
|
deba@2115
|
126 |
edge.id = (node.id >> 1) * _bNodeNum;
|
deba@2115
|
127 |
}
|
deba@2115
|
128 |
void nextFromANode(UEdge& edge) const {
|
deba@2115
|
129 |
++(edge.id);
|
deba@2115
|
130 |
if (edge.id % _bNodeNum == 0) edge.id = -1;
|
deba@2115
|
131 |
}
|
deba@2115
|
132 |
|
deba@2115
|
133 |
void firstFromBNode(UEdge& edge, const Node& node) const {
|
deba@2115
|
134 |
LEMON_ASSERT((node.id & 1) == 1, NodeSetError());
|
deba@2115
|
135 |
edge.id = (node.id >> 1);
|
deba@2115
|
136 |
}
|
deba@2115
|
137 |
void nextFromBNode(UEdge& edge) const {
|
deba@2115
|
138 |
edge.id += _bNodeNum;
|
deba@2115
|
139 |
if (edge.id >= _edgeNum) edge.id = -1;
|
deba@2115
|
140 |
}
|
deba@2115
|
141 |
|
deba@2115
|
142 |
static int id(const Node& node) {
|
deba@2115
|
143 |
return node.id;
|
deba@2115
|
144 |
}
|
deba@2115
|
145 |
static Node nodeFromId(int id) {
|
deba@2115
|
146 |
return Node(id);
|
deba@2115
|
147 |
}
|
deba@2115
|
148 |
int maxNodeId() const {
|
deba@2115
|
149 |
return _aNodeNum > _bNodeNum ?
|
deba@2115
|
150 |
_aNodeNum * 2 - 2 : _bNodeNum * 2 - 1;
|
deba@2115
|
151 |
}
|
deba@2115
|
152 |
|
deba@2115
|
153 |
static int id(const UEdge& edge) {
|
deba@2115
|
154 |
return edge.id;
|
deba@2115
|
155 |
}
|
deba@2115
|
156 |
static UEdge uEdgeFromId(int id) {
|
deba@2115
|
157 |
return UEdge(id);
|
deba@2115
|
158 |
}
|
deba@2115
|
159 |
int maxUEdgeId() const {
|
deba@2115
|
160 |
return _edgeNum - 1;
|
deba@2115
|
161 |
}
|
deba@2115
|
162 |
|
deba@2115
|
163 |
static int aNodeId(const Node& node) {
|
deba@2115
|
164 |
return node.id >> 1;
|
deba@2115
|
165 |
}
|
deba@2115
|
166 |
static Node fromANodeId(int id) {
|
deba@2115
|
167 |
return Node(id << 1);
|
deba@2115
|
168 |
}
|
deba@2115
|
169 |
int maxANodeId() const {
|
deba@2115
|
170 |
return _aNodeNum;
|
deba@2115
|
171 |
}
|
deba@2115
|
172 |
|
deba@2115
|
173 |
static int bNodeId(const Node& node) {
|
deba@2115
|
174 |
return node.id >> 1;
|
deba@2115
|
175 |
}
|
deba@2115
|
176 |
static Node fromBNodeId(int id) {
|
deba@2115
|
177 |
return Node((id << 1) + 1);
|
deba@2115
|
178 |
}
|
deba@2115
|
179 |
int maxBNodeId() const {
|
deba@2115
|
180 |
return _bNodeNum;
|
deba@2115
|
181 |
}
|
deba@2115
|
182 |
|
deba@2115
|
183 |
Node aNode(const UEdge& edge) const {
|
deba@2115
|
184 |
return Node((edge.id / _bNodeNum) << 1);
|
deba@2115
|
185 |
}
|
deba@2115
|
186 |
Node bNode(const UEdge& edge) const {
|
deba@2115
|
187 |
return Node(((edge.id % _bNodeNum) << 1) + 1);
|
deba@2115
|
188 |
}
|
deba@2115
|
189 |
|
deba@2115
|
190 |
static bool aNode(const Node& node) {
|
deba@2115
|
191 |
return (node.id & 1) == 0;
|
deba@2115
|
192 |
}
|
deba@2115
|
193 |
|
deba@2115
|
194 |
static bool bNode(const Node& node) {
|
deba@2115
|
195 |
return (node.id & 1) == 1;
|
deba@2115
|
196 |
}
|
deba@2115
|
197 |
|
deba@2115
|
198 |
static Node aNode(int index) {
|
deba@2115
|
199 |
return Node(index << 1);
|
deba@2115
|
200 |
}
|
deba@2115
|
201 |
|
deba@2115
|
202 |
static Node bNode(int index) {
|
deba@2115
|
203 |
return Node((index << 1) + 1);
|
deba@2115
|
204 |
}
|
deba@2115
|
205 |
|
deba@2115
|
206 |
typedef True NodeNumTag;
|
deba@2115
|
207 |
int nodeNum() const { return _aNodeNum + _bNodeNum; }
|
deba@2115
|
208 |
int aNodeNum() const { return _aNodeNum; }
|
deba@2115
|
209 |
int bNodeNum() const { return _bNodeNum; }
|
deba@2115
|
210 |
|
deba@2115
|
211 |
typedef True EdgeNumTag;
|
deba@2115
|
212 |
int uEdgeNum() const { return _edgeNum; }
|
deba@2115
|
213 |
|
deba@2115
|
214 |
};
|
deba@2115
|
215 |
|
deba@2115
|
216 |
|
deba@2115
|
217 |
typedef BpUGraphExtender<FullBpUGraphBase> ExtendedFullBpUGraphBase;
|
deba@2115
|
218 |
|
deba@2115
|
219 |
|
deba@2115
|
220 |
/// \ingroup graphs
|
deba@2115
|
221 |
///
|
deba@2115
|
222 |
/// \brief An undirected full bipartite graph class.
|
deba@2115
|
223 |
///
|
deba@2115
|
224 |
/// This is a simple and fast bipartite undirected full graph implementation.
|
deba@2115
|
225 |
/// It is completely static, so you can neither add nor delete either
|
deba@2115
|
226 |
/// edges or nodes.
|
deba@2115
|
227 |
///
|
deba@2115
|
228 |
/// \sa FullUGraphBase
|
deba@2115
|
229 |
/// \sa FullGraph
|
deba@2115
|
230 |
///
|
deba@2115
|
231 |
/// \author Balazs Dezso
|
deba@2115
|
232 |
class FullBpUGraph :
|
deba@2115
|
233 |
public ExtendedFullBpUGraphBase {
|
deba@2115
|
234 |
public:
|
deba@2115
|
235 |
|
deba@2115
|
236 |
typedef ExtendedFullBpUGraphBase Parent;
|
deba@2115
|
237 |
|
deba@2115
|
238 |
FullBpUGraph() {
|
deba@2115
|
239 |
Parent::construct(0, 0);
|
deba@2115
|
240 |
}
|
deba@2115
|
241 |
|
deba@2115
|
242 |
FullBpUGraph(int aNodeNum, int bNodeNum) {
|
deba@2115
|
243 |
Parent::construct(aNodeNum, bNodeNum);
|
deba@2115
|
244 |
}
|
deba@2115
|
245 |
|
deba@2115
|
246 |
/// \brief Resize the graph
|
deba@2115
|
247 |
///
|
deba@2115
|
248 |
void resize(int n, int m) {
|
deba@2115
|
249 |
Parent::getNotifier(Edge()).clear();
|
deba@2115
|
250 |
Parent::getNotifier(UEdge()).clear();
|
deba@2115
|
251 |
Parent::getNotifier(Node()).clear();
|
deba@2115
|
252 |
Parent::getNotifier(ANode()).clear();
|
deba@2115
|
253 |
Parent::getNotifier(BNode()).clear();
|
deba@2115
|
254 |
construct(n, m);
|
deba@2115
|
255 |
Parent::getNotifier(ANode()).build();
|
deba@2115
|
256 |
Parent::getNotifier(BNode()).build();
|
deba@2115
|
257 |
Parent::getNotifier(Node()).build();
|
deba@2115
|
258 |
Parent::getNotifier(UEdge()).build();
|
deba@2115
|
259 |
Parent::getNotifier(Edge()).build();
|
deba@2115
|
260 |
}
|
deba@2115
|
261 |
};
|
deba@2115
|
262 |
|
deba@2115
|
263 |
} //namespace lemon
|
deba@2115
|
264 |
|
deba@2115
|
265 |
|
deba@2115
|
266 |
#endif //LEMON_FULL_GRAPH_H
|