r372:75cf49ce5390
Tue, 04 Nov 2008 21:36:46
[Not Reviewed]
0 comments (0 inline)
0
4
0
| ... | ... |
@@ -213,29 +213,55 @@ |
| 213 | 213 |
struct NodeNumTagIndicator< |
| 214 | 214 |
Graph, |
| 215 | 215 |
typename enable_if<typename Graph::NodeNumTag, void>::type |
| 216 | 216 |
> {
|
| 217 | 217 |
static const bool value = true; |
| 218 | 218 |
}; |
| 219 | 219 |
|
| 220 | 220 |
template <typename Graph, typename Enable = void> |
| 221 |
struct ArcNumTagIndicator {
|
|
| 222 |
static const bool value = false; |
|
| 223 |
}; |
|
| 224 |
|
|
| 225 |
template <typename Graph> |
|
| 226 |
struct ArcNumTagIndicator< |
|
| 227 |
Graph, |
|
| 228 |
typename enable_if<typename Graph::ArcNumTag, void>::type |
|
| 229 |
> {
|
|
| 230 |
static const bool value = true; |
|
| 231 |
}; |
|
| 232 |
|
|
| 233 |
template <typename Graph, typename Enable = void> |
|
| 221 | 234 |
struct EdgeNumTagIndicator {
|
| 222 | 235 |
static const bool value = false; |
| 223 | 236 |
}; |
| 224 | 237 |
|
| 225 | 238 |
template <typename Graph> |
| 226 | 239 |
struct EdgeNumTagIndicator< |
| 227 | 240 |
Graph, |
| 228 | 241 |
typename enable_if<typename Graph::EdgeNumTag, void>::type |
| 229 | 242 |
> {
|
| 230 | 243 |
static const bool value = true; |
| 231 | 244 |
}; |
| 232 | 245 |
|
| 233 | 246 |
template <typename Graph, typename Enable = void> |
| 247 |
struct FindArcTagIndicator {
|
|
| 248 |
static const bool value = false; |
|
| 249 |
}; |
|
| 250 |
|
|
| 251 |
template <typename Graph> |
|
| 252 |
struct FindArcTagIndicator< |
|
| 253 |
Graph, |
|
| 254 |
typename enable_if<typename Graph::FindArcTag, void>::type |
|
| 255 |
> {
|
|
| 256 |
static const bool value = true; |
|
| 257 |
}; |
|
| 258 |
|
|
| 259 |
template <typename Graph, typename Enable = void> |
|
| 234 | 260 |
struct FindEdgeTagIndicator {
|
| 235 | 261 |
static const bool value = false; |
| 236 | 262 |
}; |
| 237 | 263 |
|
| 238 | 264 |
template <typename Graph> |
| 239 | 265 |
struct FindEdgeTagIndicator< |
| 240 | 266 |
Graph, |
| 241 | 267 |
typename enable_if<typename Graph::FindEdgeTag, void>::type |
| ... | ... |
@@ -301,16 +301,17 @@ |
| 301 | 301 |
} else if (s._id != t._id) {
|
| 302 | 302 |
return Arc(_eid(t._id, s._id) << 1); |
| 303 | 303 |
} else {
|
| 304 | 304 |
return INVALID; |
| 305 | 305 |
} |
| 306 | 306 |
} |
| 307 | 307 |
|
| 308 | 308 |
typedef True NodeNumTag; |
| 309 |
typedef True ArcNumTag; |
|
| 309 | 310 |
typedef True EdgeNumTag; |
| 310 | 311 |
|
| 311 | 312 |
int nodeNum() const { return _node_num; }
|
| 312 | 313 |
int arcNum() const { return 2 * _edge_num; }
|
| 313 | 314 |
int edgeNum() const { return _edge_num; }
|
| 314 | 315 |
|
| 315 | 316 |
static int id(Node node) { return node._id; }
|
| 316 | 317 |
static int id(Arc arc) { return arc._id; }
|
| ... | ... |
@@ -338,16 +339,17 @@ |
| 338 | 339 |
} |
| 339 | 340 |
|
| 340 | 341 |
Node target(Arc arc) const {
|
| 341 | 342 |
return Node((arc._id & 1) == 1 ? |
| 342 | 343 |
_vid(arc._id >> 1) : _uid(arc._id >> 1)); |
| 343 | 344 |
} |
| 344 | 345 |
|
| 345 | 346 |
typedef True FindEdgeTag; |
| 347 |
typedef True FindArcTag; |
|
| 346 | 348 |
|
| 347 | 349 |
Edge findEdge(Node u, Node v, Edge prev = INVALID) const {
|
| 348 | 350 |
return prev != INVALID ? INVALID : edge(u, v); |
| 349 | 351 |
} |
| 350 | 352 |
|
| 351 | 353 |
Arc findArc(Node s, Node t, Arc prev = INVALID) const {
|
| 352 | 354 |
return prev != INVALID ? INVALID : arc(s, t); |
| 353 | 355 |
} |
| ... | ... |
@@ -77,16 +77,17 @@ |
| 77 | 77 |
return _width; |
| 78 | 78 |
} |
| 79 | 79 |
|
| 80 | 80 |
int height() const {
|
| 81 | 81 |
return _height; |
| 82 | 82 |
} |
| 83 | 83 |
|
| 84 | 84 |
typedef True NodeNumTag; |
| 85 |
typedef True EdgeNumTag; |
|
| 85 | 86 |
typedef True ArcNumTag; |
| 86 | 87 |
|
| 87 | 88 |
int nodeNum() const { return _node_num; }
|
| 88 | 89 |
int edgeNum() const { return _edge_num; }
|
| 89 | 90 |
int arcNum() const { return 2 * _edge_num; }
|
| 90 | 91 |
|
| 91 | 92 |
Node u(Edge edge) const {
|
| 92 | 93 |
if (edge._id < _edge_limit) {
|
| ... | ... |
@@ -122,16 +123,17 @@ |
| 122 | 123 |
int maxEdgeId() const { return _edge_num - 1; }
|
| 123 | 124 |
int maxArcId() const { return 2 * _edge_num - 1; }
|
| 124 | 125 |
|
| 125 | 126 |
static Node nodeFromId(int id) { return Node(id);}
|
| 126 | 127 |
static Edge edgeFromId(int id) { return Edge(id);}
|
| 127 | 128 |
static Arc arcFromId(int id) { return Arc(id);}
|
| 128 | 129 |
|
| 129 | 130 |
typedef True FindEdgeTag; |
| 131 |
typedef True FindArcTag; |
|
| 130 | 132 |
|
| 131 | 133 |
Edge findEdge(Node u, Node v, Edge prev = INVALID) const {
|
| 132 | 134 |
if (prev != INVALID) return INVALID; |
| 133 | 135 |
if (v._id > u._id) {
|
| 134 | 136 |
if (v._id - u._id == _width) |
| 135 | 137 |
return Edge(u._id); |
| 136 | 138 |
if (v._id - u._id == 1 && u._id % _width < _width - 1) {
|
| 137 | 139 |
return Edge(u._id / _width * (_width - 1) + |
| ... | ... |
@@ -62,17 +62,17 @@ |
| 62 | 62 |
|
| 63 | 63 |
public: |
| 64 | 64 |
|
| 65 | 65 |
SmartDigraphBase() : nodes(), arcs() { }
|
| 66 | 66 |
SmartDigraphBase(const SmartDigraphBase &_g) |
| 67 | 67 |
: nodes(_g.nodes), arcs(_g.arcs) { }
|
| 68 | 68 |
|
| 69 | 69 |
typedef True NodeNumTag; |
| 70 |
typedef True |
|
| 70 |
typedef True ArcNumTag; |
|
| 71 | 71 |
|
| 72 | 72 |
int nodeNum() const { return nodes.size(); }
|
| 73 | 73 |
int arcNum() const { return arcs.size(); }
|
| 74 | 74 |
|
| 75 | 75 |
int maxNodeId() const { return nodes.size()-1; }
|
| 76 | 76 |
int maxArcId() const { return arcs.size()-1; }
|
| 77 | 77 |
|
| 78 | 78 |
Node addNode() {
|
0 comments (0 inline)