equal
deleted
inserted
replaced
1 #include<iostream> |
1 #include<iostream> |
2 #include<hugo/smart_graph.h> |
2 #include<hugo/smart_graph.h> |
3 #include<hugo/skeletons/graph.h> |
3 //#include<hugo/skeletons/graph.h> |
4 #include<../work/alpar/list_graph.h> |
4 //#include<../work/alpar/list_graph.h> |
5 |
5 |
6 /* |
6 /* |
7 This test makes consistency checks of list graph structures. |
7 This test makes consistency checks of list graph structures. |
8 |
8 |
9 G.addNode(), G.addEdge(), G.valid(), G.tail(), G.head() |
9 G.addNode(), G.addEdge(), G.valid(), G.tail(), G.head() |
267 checkOutEdgeList(G,n,3); |
267 checkOutEdgeList(G,n,3); |
268 G.next(n); |
268 G.next(n); |
269 } |
269 } |
270 } |
270 } |
271 |
271 |
272 template void checkCompile<GraphSkeleton>(GraphSkeleton &); |
272 //template void checkCompile<GraphSkeleton>(GraphSkeleton &); |
273 template void checkCompile<SmartGraph>(SmartGraph &); |
273 template void checkCompile<SmartGraph>(SmartGraph &); |
274 template void checkCompile<SymSmartGraph>(SymSmartGraph &); |
274 template void checkCompile<SymSmartGraph>(SymSmartGraph &); |
275 template void checkCompile<ListGraph>(ListGraph &); |
275 //template void checkCompile<ListGraph>(ListGraph &); |
276 template void checkCompile<SymListGraph>(SymListGraph &); |
276 //template void checkCompile<SymListGraph>(SymListGraph &); |
|
277 |
277 //Due to some mysterious and some conceptual problems it does not work. |
278 //Due to some mysterious and some conceptual problems it does not work. |
278 //template void checkCompile<EdgeSet <ListGraph> >(EdgeSet <ListGraph> &); |
279 //template void checkCompile<EdgeSet <ListGraph> >(EdgeSet <ListGraph> &); |
279 |
280 |
280 int main() |
281 int main() |
281 { |
282 { |