1.1 --- a/test/digraph_test.cc Wed Nov 05 21:36:28 2008 +0100
1.2 +++ b/test/digraph_test.cc Thu Nov 06 15:16:37 2008 +0100
1.3 @@ -20,7 +20,6 @@
1.4 #include <lemon/list_graph.h>
1.5 #include <lemon/smart_graph.h>
1.6 #include <lemon/full_graph.h>
1.7 -#include <lemon/hypercube_graph.h>
1.8
1.9 #include "test_tools.h"
1.10 #include "graph_test.h"
1.11 @@ -112,36 +111,6 @@
1.12
1.13 }
1.14
1.15 -void checkHypercubeDigraph(int dim) {
1.16 - DIGRAPH_TYPEDEFS(HypercubeDigraph);
1.17 -
1.18 - HypercubeDigraph G(dim);
1.19 - checkGraphNodeList(G, 1 << dim);
1.20 - checkGraphArcList(G, (1 << dim) * dim);
1.21 -
1.22 - Node n = G.nodeFromId(dim);
1.23 -
1.24 - checkGraphOutArcList(G, n, dim);
1.25 - for (OutArcIt a(G, n); a != INVALID; ++a)
1.26 - check(G.source(a) == n &&
1.27 - G.id(G.target(a)) == G.id(n) ^ (1 << G.dimension(a)),
1.28 - "Wrong arc");
1.29 -
1.30 - checkGraphInArcList(G, n, dim);
1.31 - for (InArcIt a(G, n); a != INVALID; ++a)
1.32 - check(G.target(a) == n &&
1.33 - G.id(G.source(a)) == G.id(n) ^ (1 << G.dimension(a)),
1.34 - "Wrong arc");
1.35 -
1.36 - checkGraphConArcList(G, (1 << dim) * dim);
1.37 -
1.38 - checkNodeIds(G);
1.39 - checkArcIds(G);
1.40 - checkGraphNodeMap(G);
1.41 - checkGraphArcMap(G);
1.42 -}
1.43 -
1.44 -
1.45 void checkConcepts() {
1.46 { // Checking digraph components
1.47 checkConcept<BaseDigraphComponent, BaseDigraphComponent >();
1.48 @@ -174,9 +143,6 @@
1.49 { // Checking FullDigraph
1.50 checkConcept<Digraph, FullDigraph>();
1.51 }
1.52 - { // Checking HypercubeDigraph
1.53 - checkConcept<Digraph, HypercubeDigraph>();
1.54 - }
1.55 }
1.56
1.57 template <typename Digraph>
1.58 @@ -241,12 +207,6 @@
1.59 { // Checking FullDigraph
1.60 checkFullDigraph(8);
1.61 }
1.62 - { // Checking HypercubeDigraph
1.63 - checkHypercubeDigraph(1);
1.64 - checkHypercubeDigraph(2);
1.65 - checkHypercubeDigraph(3);
1.66 - checkHypercubeDigraph(4);
1.67 - }
1.68 }
1.69
1.70 int main() {