Erasing from graph would be possible, if erasing from graph would be possible... (Afternoon has become timewasting...)
2 * test/sym_graph_test.cc - Part of LEMON, a generic C++ optimization library
4 * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
5 * (Egervary Research Group on Combinatorial Optimization, EGRES).
7 * Permission to use, modify and distribute this software is granted
8 * provided that this copyright notice appears in all copies. For
9 * precise terms see the accompanying LICENSE file.
11 * This software is provided "AS IS" with no warranty of any kind,
12 * express or implied, and with no claim as to its suitability for any
19 #include<lemon/concept/sym_graph.h>
21 #include<lemon/list_graph.h>
22 #include<lemon/smart_graph.h>
23 #include<lemon/full_graph.h>
25 #include"test_tools.h"
26 #include"graph_test.h"
27 #include"sym_graph_test.h"
31 This test makes consistency checks of list graph structures.
33 G.addNode(), G.addEdge(), G.source(), G.target()
35 \todo Checks for empty graphs and isolated points.
39 using namespace lemon;
41 template<class Graph> void checkPetersen(Graph &G)
43 typedef typename Graph::NodeIt NodeIt;
46 checkGraphNodeList(G,10);
47 checkGraphEdgeList(G,30);
48 checkGraphSymEdgeList(G,15);
50 for(NodeIt n(G);n!=INVALID;++n) {
51 checkGraphInEdgeList(G,n,3);
52 checkGraphOutEdgeList(G,n,3);
57 template void lemon::checkCompileStaticSymGraph<concept::StaticSymGraph>
58 (concept::StaticSymGraph &);
60 template void lemon::checkCompileSymGraph<concept::ExtendableSymGraph>
61 (concept::ExtendableSymGraph &);
63 template void lemon::checkCompileErasableSymGraph<concept::ErasableSymGraph>
64 (concept::ErasableSymGraph &);
67 //Compile SymSmartGraph
68 template void lemon::checkCompileSymGraph<SymSmartGraph>(SymSmartGraph &);
70 void lemon::concept::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
72 //Compile SymListGraph
73 template void lemon::checkCompileSymGraph<SymListGraph>(SymListGraph &);
74 template void lemon::checkCompileErasableSymGraph<SymListGraph>(SymListGraph &);
76 void lemon::concept::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
93 ///\todo copy constr tests.
95 std::cout << __FILE__ ": All tests passed.\n";