Changeset 365:a12eef1f82b2 in lemon-main for test/digraph_test.cc

Timestamp:

11/06/08 15:16:37 (15 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Rework hypercube graph implementation to be undirected (#57)

File:

• test/digraph_test.cc (modified) (4 diffs)

test/digraph_test.cc

@@ -21 +21 @@
 #include <lemon/smart_graph.h>
 #include <lemon/full_graph.h>
-#include <lemon/hypercube_graph.h>
 
 #include "test_tools.h"
@@ -113 +112 @@
 }
 
-void checkHypercubeDigraph(int dim) {
-  DIGRAPH_TYPEDEFS(HypercubeDigraph);
-
-  HypercubeDigraph G(dim);
-  checkGraphNodeList(G, 1 << dim);
-  checkGraphArcList(G, (1 << dim) * dim);
-
-  Node n = G.nodeFromId(dim);
-
-  checkGraphOutArcList(G, n, dim);
-  for (OutArcIt a(G, n); a != INVALID; ++a)
-    check(G.source(a) == n &&
-          G.id(G.target(a)) == G.id(n) ^ (1 << G.dimension(a)),
-          "Wrong arc");
-
-  checkGraphInArcList(G, n, dim);
-  for (InArcIt a(G, n); a != INVALID; ++a)
-    check(G.target(a) == n &&
-          G.id(G.source(a)) == G.id(n) ^ (1 << G.dimension(a)),
-          "Wrong arc");
-
-  checkGraphConArcList(G, (1 << dim) * dim);
-
-  checkNodeIds(G);
-  checkArcIds(G);
-  checkGraphNodeMap(G);
-  checkGraphArcMap(G);
-}
-
-
 void checkConcepts() {
   { // Checking digraph components
@@ -175 +144 @@
     checkConcept<Digraph, FullDigraph>();
   }
-  { // Checking HypercubeDigraph
-    checkConcept<Digraph, HypercubeDigraph>();
-  }
 }
 
@@ -242 +208 @@
     checkFullDigraph(8);
   }
-  { // Checking HypercubeDigraph
-    checkHypercubeDigraph(1);
-    checkHypercubeDigraph(2);
-    checkHypercubeDigraph(3);
-    checkHypercubeDigraph(4);
-  }
 }