Changeset 592:5961cce7ec53 in lemon0.x for src/test/graph_test.cc
 Timestamp:
 05/09/04 18:29:53 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@771
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/test/graph_test.cc
r579 r592 3 3 #include<hugo/skeletons/graph.h> 4 4 #include<hugo/list_graph.h> 5 #include<hugo/full_graph.h> 5 6 6 7 #include"test_tools.h" … … 11 12 G.addNode(), G.addEdge(), G.valid(), G.tail(), G.head() 12 13 14 \todo Checks for empty graphs and isolated points. 13 15 */ 14 16 15 17 using namespace hugo; 16 18 17 template<class Graph> void checkCompile (Graph &G)19 template<class Graph> void checkCompileStaticGraph(Graph &G) 18 20 { 19 21 typedef typename Graph::Node Node; … … 80 82 81 83 Node n,m; 82 n= G.addNode();84 n=m=INVALID; 83 85 Edge e; 84 e= G.addEdge(n,m);86 e=INVALID; 85 87 n=G.tail(e); 86 88 n=G.head(e); … … 92 94 { int i=G.id(e); i=i; } 93 95 94 G.clear();96 // G.clear(); 95 97 96 98 //NodeMap tests … … 161 163 } 162 164 165 template<class Graph> void checkCompile(Graph &G) 166 { 167 checkCompileStaticGraph(G); 168 169 typedef typename Graph::Node Node; 170 typedef typename Graph::NodeIt NodeIt; 171 typedef typename Graph::Edge Edge; 172 typedef typename Graph::EdgeIt EdgeIt; 173 typedef typename Graph::InEdgeIt InEdgeIt; 174 typedef typename Graph::OutEdgeIt OutEdgeIt; 175 176 Node n,m; 177 n=G.addNode(); 178 m=G.addNode(); 179 180 G.addEdge(n,m); 181 } 182 183 163 184 template<class Graph> void checkNodeList(Graph &G, int nn) 164 185 { … … 245 266 template void checkCompile<ListGraph>(ListGraph &); 246 267 template void checkCompile<SymListGraph>(SymListGraph &); 268 template void checkCompileStaticGraph<FullGraph>(FullGraph &); 247 269 248 270 //Due to some mysterious problems it does not work.
Note: See TracChangeset
for help on using the changeset viewer.