Changeset 946:c94ef40a22ce in lemon0.x for src/test/graph_test.h
 Timestamp:
 10/28/04 00:38:50 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1322
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/test/graph_test.h
r938 r946 22 22 //! \ingroup misc 23 23 //! \file 24 //! \brief Some utility totest graph classes.24 //! \brief Some utility and test cases to test graph classes. 25 25 namespace lemon { 26 26 27 27 template<class Graph> void checkGraphNodeList(Graph &G, int nn) 28 { 29 typename Graph::NodeIt n(G); 30 for(int i=0;i<nn;i++) { 31 check(n!=INVALID,"Wrong Node list linking."); 32 ++n; 33 } 34 check(n==INVALID,"Wrong Node list linking."); 28 { 29 typename Graph::NodeIt n(G); 30 for(int i=0;i<nn;i++) { 31 check(n!=INVALID,"Wrong Node list linking."); 32 ++n; 35 33 } 34 check(n==INVALID,"Wrong Node list linking."); 35 } 36 36 37 template<class Graph> void checkGraphEdgeList(Graph &G, int nn) 38 { 39 typedef typename Graph::EdgeIt EdgeIt; 37 template<class Graph> 38 void checkGraphEdgeList(Graph &G, int nn) 39 { 40 typedef typename Graph::EdgeIt EdgeIt; 40 41 41 EdgeIt e(G); 42 for(int i=0;i<nn;i++) { 43 check(e!=INVALID,"Wrong Edge list linking."); 44 ++e; 45 } 46 check(e==INVALID,"Wrong Edge list linking."); 42 EdgeIt e(G); 43 for(int i=0;i<nn;i++) { 44 check(e!=INVALID,"Wrong Edge list linking."); 45 ++e; 47 46 } 47 check(e==INVALID,"Wrong Edge list linking."); 48 } 48 49 49 template<class Graph> void checkGraphOutEdgeList(Graph &G, 50 typename Graph::Node n, 51 int nn) 52 { 53 typename Graph::OutEdgeIt e(G,n); 54 for(int i=0;i<nn;i++) { 55 check(e!=INVALID,"Wrong OutEdge list linking."); 56 check(n==G.tail(e), "Wrong OutEdge list linking."); 57 ++e; 58 } 59 check(e==INVALID,"Wrong OutEdge list linking."); 50 template<class Graph> 51 void checkGraphOutEdgeList(Graph &G, typename Graph::Node n, int nn) 52 { 53 typename Graph::OutEdgeIt e(G,n); 54 for(int i=0;i<nn;i++) { 55 check(e!=INVALID,"Wrong OutEdge list linking."); 56 check(n==G.tail(e), "Wrong OutEdge list linking."); 57 ++e; 60 58 } 59 check(e==INVALID,"Wrong OutEdge list linking."); 60 } 61 61 62 template<class Graph> void checkGraphInEdgeList(Graph &G, 63 typename Graph::Node n, 64 int nn) 65 { 66 typename Graph::InEdgeIt e(G,n); 67 for(int i=0;i<nn;i++) { 68 check(e!=INVALID,"Wrong InEdge list linking."); 69 check(n==G.head(e), "Wrong InEdge list linking."); 70 ++e; 71 } 72 check(e==INVALID,"Wrong InEdge list linking."); 62 template<class Graph> void 63 checkGraphInEdgeList(Graph &G, typename Graph::Node n, int nn) 64 { 65 typename Graph::InEdgeIt e(G,n); 66 for(int i=0;i<nn;i++) { 67 check(e!=INVALID,"Wrong InEdge list linking."); 68 check(n==G.head(e), "Wrong InEdge list linking."); 69 ++e; 73 70 } 71 check(e==INVALID,"Wrong InEdge list linking."); 72 } 73 74 template <class Graph> 75 void checkGraph() { 76 const int num = 5; 77 Graph G; 78 addPetersen(G, num); 79 bidirGraph(G); 80 checkBidirPetersen(G, num); 81 } 74 82 75 83 ///\file
Note: See TracChangeset
for help on using the changeset viewer.