0
2
0
... | ... |
@@ -271,24 +271,26 @@ |
271 | 271 |
|
272 | 272 |
// \ingroup digraphbits |
273 | 273 |
// |
274 | 274 |
// \brief Extender for the EdgeSets |
275 | 275 |
template <typename Base> |
276 | 276 |
class EdgeSetExtender : public Base { |
277 | 277 |
typedef Base Parent; |
278 | 278 |
|
279 | 279 |
public: |
280 | 280 |
|
281 | 281 |
typedef EdgeSetExtender Graph; |
282 | 282 |
|
283 |
typedef True UndirectedTag; |
|
284 |
|
|
283 | 285 |
typedef typename Parent::Node Node; |
284 | 286 |
typedef typename Parent::Arc Arc; |
285 | 287 |
typedef typename Parent::Edge Edge; |
286 | 288 |
|
287 | 289 |
int maxId(Node) const { |
288 | 290 |
return Parent::maxNodeId(); |
289 | 291 |
} |
290 | 292 |
|
291 | 293 |
int maxId(Arc) const { |
292 | 294 |
return Parent::maxArcId(); |
293 | 295 |
} |
294 | 296 |
... | ... |
@@ -172,24 +172,26 @@ |
172 | 172 |
|
173 | 173 |
}; |
174 | 174 |
|
175 | 175 |
template <typename _Graph> |
176 | 176 |
class GraphAdaptorExtender : public _Graph { |
177 | 177 |
typedef _Graph Parent; |
178 | 178 |
|
179 | 179 |
public: |
180 | 180 |
|
181 | 181 |
typedef _Graph Graph; |
182 | 182 |
typedef GraphAdaptorExtender Adaptor; |
183 | 183 |
|
184 |
typedef True UndirectedTag; |
|
185 |
|
|
184 | 186 |
typedef typename Parent::Node Node; |
185 | 187 |
typedef typename Parent::Arc Arc; |
186 | 188 |
typedef typename Parent::Edge Edge; |
187 | 189 |
|
188 | 190 |
// Graph extension |
189 | 191 |
|
190 | 192 |
int maxId(Node) const { |
191 | 193 |
return Parent::maxNodeId(); |
192 | 194 |
} |
193 | 195 |
|
194 | 196 |
int maxId(Arc) const { |
195 | 197 |
return Parent::maxArcId(); |
0 comments (0 inline)