equal
deleted
inserted
replaced
14 * |
14 * |
15 */ |
15 */ |
16 #ifndef LEMON_TEST_GRAPH_TEST_H |
16 #ifndef LEMON_TEST_GRAPH_TEST_H |
17 #define LEMON_TEST_GRAPH_TEST_H |
17 #define LEMON_TEST_GRAPH_TEST_H |
18 |
18 |
19 |
19 #include <lemon/graph_utils.h> |
20 #include "test_tools.h" |
20 #include "test_tools.h" |
21 |
21 |
22 //! \ingroup misc |
22 //! \ingroup misc |
23 //! \file |
23 //! \file |
24 //! \brief Some utility and test cases to test graph classes. |
24 //! \brief Some utility and test cases to test graph classes. |
78 addPetersen(G, num); |
78 addPetersen(G, num); |
79 bidirGraph(G); |
79 bidirGraph(G); |
80 checkBidirPetersen(G, num); |
80 checkBidirPetersen(G, num); |
81 } |
81 } |
82 |
82 |
|
83 template <class Graph> |
|
84 void checkGraphIterators(const Graph& graph) { |
|
85 typedef typename Graph::Node Node; |
|
86 typedef typename Graph::NodeIt NodeIt; |
|
87 typedef typename Graph::Edge Edge; |
|
88 typedef typename Graph::EdgeIt EdgeIt; |
|
89 typedef typename Graph::InEdgeIt InEdgeIt; |
|
90 typedef typename Graph::OutEdgeIt OutEdgeIt; |
|
91 typedef ConEdgeIt<Graph> ConEdgeIt; |
|
92 |
|
93 for (NodeIt it(graph); it != INVALID; ++it) {} |
|
94 } |
|
95 |
83 ///\file |
96 ///\file |
84 ///\todo Check target(), source() as well; |
97 ///\todo Check target(), source() as well; |
85 |
98 |
86 |
99 |
87 } //namespace lemon |
100 } //namespace lemon |