equal
deleted
inserted
replaced
13 |
13 |
14 \todo Checks for empty graphs and isolated points. |
14 \todo Checks for empty graphs and isolated points. |
15 */ |
15 */ |
16 |
16 |
17 using namespace hugo; |
17 using namespace hugo; |
|
18 using namespace hugo::skeleton; |
18 |
19 |
19 template<class Graph> void checkCompileStaticGraph(Graph &G) |
20 template<class Graph> void checkCompileStaticGraph(Graph &G) |
20 { |
21 { |
21 typedef typename Graph::Node Node; |
22 typedef typename Graph::Node Node; |
22 typedef typename Graph::NodeIt NodeIt; |
23 typedef typename Graph::NodeIt NodeIt; |
258 checkOutEdgeList(G,n,3); |
259 checkOutEdgeList(G,n,3); |
259 G.next(n); |
260 G.next(n); |
260 } |
261 } |
261 } |
262 } |
262 |
263 |
|
264 template |
|
265 void checkCompileStaticGraph<StaticGraphSkeleton>(StaticGraphSkeleton &); |
263 template void checkCompile<GraphSkeleton>(GraphSkeleton &); |
266 template void checkCompile<GraphSkeleton>(GraphSkeleton &); |
|
267 |
264 template void checkCompile<SmartGraph>(SmartGraph &); |
268 template void checkCompile<SmartGraph>(SmartGraph &); |
265 template void checkCompile<SymSmartGraph>(SymSmartGraph &); |
269 template void checkCompile<SymSmartGraph>(SymSmartGraph &); |
266 template void checkCompile<ListGraph>(ListGraph &); |
270 template void checkCompile<ListGraph>(ListGraph &); |
267 template void checkCompile<SymListGraph>(SymListGraph &); |
271 template void checkCompile<SymListGraph>(SymListGraph &); |
268 template void checkCompileStaticGraph<FullGraph>(FullGraph &); |
272 template void checkCompileStaticGraph<FullGraph>(FullGraph &); |