equal
deleted
inserted
replaced
25 //! \brief Some utility to test symmetric graph classes. |
25 //! \brief Some utility to test symmetric graph classes. |
26 namespace lemon { |
26 namespace lemon { |
27 |
27 |
28 /// \e |
28 /// \e |
29 |
29 |
30 /// \todo This should go to lemon/skeleton/symgraph.h |
30 /// \todo This should go to lemon/concept/symgraph.h |
31 /// |
31 /// |
32 template<class Graph> void checkCompileStaticSymGraph(Graph &G) |
32 template<class Graph> void checkCompileStaticSymGraph(Graph &G) |
33 { |
33 { |
34 typedef typename Graph::Node Node; |
34 typedef typename Graph::Node Node; |
35 typedef typename Graph::NodeIt NodeIt; |
35 typedef typename Graph::NodeIt NodeIt; |
38 typedef typename Graph::Edge Edge; |
38 typedef typename Graph::Edge Edge; |
39 typedef typename Graph::EdgeIt EdgeIt; |
39 typedef typename Graph::EdgeIt EdgeIt; |
40 typedef typename Graph::InEdgeIt InEdgeIt; |
40 typedef typename Graph::InEdgeIt InEdgeIt; |
41 typedef typename Graph::OutEdgeIt OutEdgeIt; |
41 typedef typename Graph::OutEdgeIt OutEdgeIt; |
42 |
42 |
43 lemon::skeleton::checkCompileStaticGraph(G); |
43 lemon::concept::checkCompileStaticGraph(G); |
44 |
44 |
45 { |
45 { |
46 SymEdge i; SymEdge j(i); SymEdge k(INVALID); |
46 SymEdge i; SymEdge j(i); SymEdge k(INVALID); |
47 i=j; |
47 i=j; |
48 bool b; b=true; |
48 bool b; b=true; |
155 } |
155 } |
156 |
156 |
157 template<class Graph> void checkCompileErasableSymGraph(Graph &G) |
157 template<class Graph> void checkCompileErasableSymGraph(Graph &G) |
158 { |
158 { |
159 checkCompileSymGraph(G); |
159 checkCompileSymGraph(G); |
160 lemon::skeleton::checkCompileGraphEraseNode(G); |
160 lemon::concept::checkCompileGraphEraseNode(G); |
161 checkCompileSymGraphEraseSymEdge(G); |
161 checkCompileSymGraphEraseSymEdge(G); |
162 } |
162 } |
163 |
163 |
164 template<class Graph> void checkGraphSymEdgeList(Graph &G, int nn) |
164 template<class Graph> void checkGraphSymEdgeList(Graph &G, int nn) |
165 { |
165 { |