0
3
0
... | ... |
@@ -289,3 +289,4 @@ |
289 | 289 |
/// This class is completely static and it needs constant memory space. |
290 |
/// Thus you can neither add nor delete nodes or edges |
|
290 |
/// Thus you can neither add nor delete nodes or edges, however |
|
291 |
/// the structure can be resized using resize(). |
|
291 | 292 |
/// |
... | ... |
@@ -308,2 +309,17 @@ |
308 | 309 |
|
310 |
/// \brief Resizes the graph |
|
311 |
/// |
|
312 |
/// This function resizes the graph. It fully destroys and |
|
313 |
/// rebuilds the structure, therefore the maps of the graph will be |
|
314 |
/// reallocated automatically and the previous values will be lost. |
|
315 |
void resize(int dim) { |
|
316 |
Parent::notifier(Arc()).clear(); |
|
317 |
Parent::notifier(Edge()).clear(); |
|
318 |
Parent::notifier(Node()).clear(); |
|
319 |
construct(dim); |
|
320 |
Parent::notifier(Node()).build(); |
|
321 |
Parent::notifier(Edge()).build(); |
|
322 |
Parent::notifier(Arc()).build(); |
|
323 |
} |
|
324 |
|
|
309 | 325 |
/// \brief The number of dimensions. |
... | ... |
@@ -272,2 +272,9 @@ |
272 | 272 |
Graph G(num); |
273 |
check(G.nodeNum() == num && G.edgeNum() == num * (num - 1) / 2, |
|
274 |
"Wrong size"); |
|
275 |
|
|
276 |
G.resize(num); |
|
277 |
check(G.nodeNum() == num && G.edgeNum() == num * (num - 1) / 2, |
|
278 |
"Wrong size"); |
|
279 |
|
|
273 | 280 |
checkGraphNodeList(G, num); |
... | ... |
@@ -416,2 +423,6 @@ |
416 | 423 |
|
424 |
G.resize(width, height); |
|
425 |
check(G.width() == width, "Wrong column number"); |
|
426 |
check(G.height() == height, "Wrong row number"); |
|
427 |
|
|
417 | 428 |
for (int i = 0; i < width; ++i) { |
... | ... |
@@ -491,2 +502,7 @@ |
491 | 502 |
HypercubeGraph G(dim); |
503 |
check(G.dimension() == dim, "Wrong dimension"); |
|
504 |
|
|
505 |
G.resize(dim); |
|
506 |
check(G.dimension() == dim, "Wrong dimension"); |
|
507 |
|
|
492 | 508 |
checkGraphNodeList(G, 1 << dim); |
0 comments (0 inline)