resetXxx() changed to setXxx().
1 #ifndef HUGO_TEST_TEST_TOOLS_H
2 #define HUGO_TEST_TEST_TOOLS_H
6 //! \brief Some utility to write test programs.
12 ///If \c rc is fail, writes an error message end exit.
14 ///If \c rc is fail, writes an error message end exit.
15 ///The error message contains the file name and the line number of the
16 ///source code in a standard from, which makes it possible to go there
17 ///using good source browsers like e.g. \c emacs.
20 ///\code check(0==1,"This is obviously false.");\endcode will
21 ///print this (and then exits).
22 ///\verbatim graph_test.cc:123: error: This is obviously false. \endverbatim
23 #define check(rc, msg) \
25 std::cerr << __FILE__ ":" << __LINE__ << ": error: " << msg << std::endl; \
29 ///Structure returned by \ref addPetersen().
31 ///Structure returned by \ref addPetersen().
33 template<class Graph> struct PetStruct
36 std::vector<typename Graph::Node> outer, inner;
38 std::vector<typename Graph::Edge> outcir, incir, chords;
43 ///Adds a Petersen graph to \c G.
45 ///Adds a Petersen graph to \c G.
46 ///The nodes end edges will be listed in the return structure.
48 template<typename Graph>
49 PetStruct<Graph> addPetersen(Graph &G,int num=5)
53 for(int i=0;i<num;i++) {
54 n.outer.push_back(G.addNode());
55 n.inner.push_back(G.addNode());
58 for(int i=0;i<num;i++) {
59 n.chords.push_back(G.addEdge(n.outer[i],n.inner[i]));
60 n.outcir.push_back(G.addEdge(n.outer[i],n.outer[(i+1)%5]));
61 n.incir.push_back(G.addEdge(n.inner[i],n.inner[(i+2)%5]));