Changeset 364:b4a01426c0d9 in lemon1.2
 Timestamp:
 11/05/08 21:36:28 (11 years ago)
 Branch:
 default
 Phase:
 public
 Files:

 1 added
 2 edited
Legend:
 Unmodified
 Added
 Removed

lemon/Makefile.am
r356 r364 32 32 lemon/graph_to_eps.h \ 33 33 lemon/grid_graph.h \ 34 lemon/hypercube_graph.h \ 34 35 lemon/kruskal.h \ 35 36 lemon/lgf_reader.h \ 
test/digraph_test.cc
r354 r364 21 21 #include <lemon/smart_graph.h> 22 22 #include <lemon/full_graph.h> 23 //#include <lemon/hypercube_graph.h>23 #include <lemon/hypercube_graph.h> 24 24 25 25 #include "test_tools.h" … … 113 113 } 114 114 115 void checkHypercubeDigraph(int dim) { 116 DIGRAPH_TYPEDEFS(HypercubeDigraph); 117 118 HypercubeDigraph G(dim); 119 checkGraphNodeList(G, 1 << dim); 120 checkGraphArcList(G, (1 << dim) * dim); 121 122 Node n = G.nodeFromId(dim); 123 124 checkGraphOutArcList(G, n, dim); 125 for (OutArcIt a(G, n); a != INVALID; ++a) 126 check(G.source(a) == n && 127 G.id(G.target(a)) == G.id(n) ^ (1 << G.dimension(a)), 128 "Wrong arc"); 129 130 checkGraphInArcList(G, n, dim); 131 for (InArcIt a(G, n); a != INVALID; ++a) 132 check(G.target(a) == n && 133 G.id(G.source(a)) == G.id(n) ^ (1 << G.dimension(a)), 134 "Wrong arc"); 135 136 checkGraphConArcList(G, (1 << dim) * dim); 137 138 checkNodeIds(G); 139 checkArcIds(G); 140 checkGraphNodeMap(G); 141 checkGraphArcMap(G); 142 } 143 115 144 116 145 void checkConcepts() { … … 146 175 checkConcept<Digraph, FullDigraph>(); 147 176 } 148 // { // Checking HyperCubeDigraph149 // checkConcept<Digraph, HyperCubeDigraph>();150 //}177 { // Checking HypercubeDigraph 178 checkConcept<Digraph, HypercubeDigraph>(); 179 } 151 180 } 152 181 … … 213 242 checkFullDigraph(8); 214 243 } 244 { // Checking HypercubeDigraph 245 checkHypercubeDigraph(1); 246 checkHypercubeDigraph(2); 247 checkHypercubeDigraph(3); 248 checkHypercubeDigraph(4); 249 } 215 250 } 216 251
Note: See TracChangeset
for help on using the changeset viewer.