Some bug fixes.
2 #ifndef LEMON_BENCH_TEST_H
3 #define LEMON_BENCH_TEST_H
8 #include<lemon/time_measure.h>
10 ///An experimental typedef factory
11 #define GRAPH_TYPEDEF_FACTORY(Graph) \
12 typedef typename Graph:: Node Node;\
13 typedef typename Graph:: NodeIt NodeIt;\
14 typedef typename Graph:: Edge Edge;\
15 typedef typename Graph:: EdgeIt EdgeIt;\
16 typedef typename Graph:: InEdgeIt InEdgeIt;\
17 typedef typename Graph::OutEdgeIt OutEdgeIt;
19 #define GRAPH_TYPEDEF_FACTORY_NOTYPENAME(Graph) \
20 typedef Graph:: Node Node;\
21 typedef Graph:: NodeIt NodeIt;\
22 typedef Graph:: Edge Edge;\
23 typedef Graph:: EdgeIt EdgeIt;\
24 typedef Graph:: InEdgeIt InEdgeIt;\
25 typedef Graph::OutEdgeIt OutEdgeIt;
28 ///A primitive primtest
30 ///\bug 2 is not a prime according to this function!
32 ///\bug This function should go out of header file. I'm making it
34 inline bool isPrim(int n)
37 for(int k=3;n/k>=k;k+=2)
38 if(!(n%k)) return false;
44 ///Finds the smallest prime not less then \c n.
46 ///\bug This function should go out of header file. I'm making it
48 inline int nextPrim(int n)
50 for(n+=!(n%2);!isPrim(n);n+=2) ;
55 /// Class to generate consecutive primes
58 std::vector<int> primes;
63 for(int i=0;m<primes[i]*primes[i];i++) if(!(m%primes[i])) return false;
71 if(primes.size()==0) {
76 do n+=2; while(!isPrime(n));
83 inline void PrintTime(char *ID,lemon::Timer &T)
85 lemon::TimeStamp S(T);
86 std::cout << ID << ' ' << S.getUserTime() << ' '
87 << S.getSystemTime() << ' ' << S.getRealTime() << std::endl;
94 void addHiperCube(Graph &G,int dim,std::vector<typename Graph::Node> &nodes)
96 GRAPH_TYPEDEF_FACTORY(Graph);
98 std::vector<int> bits(dim+1);
100 for(int i=1;i<=dim;i++) bits[i]=2*bits[i-1];
102 for(int i=0;i<bits[dim];i++) {
103 nodes.push_back(G.addNode());
104 for(int j=0;j<dim;j++) if(i&bits[j]) G.addEdge(nodes[i-bits[j]],nodes[i]);
109 template<class Graph>
110 void addBiDirHiperCube(Graph &G,int dim,std::vector<typename Graph::Node>&nodes)
112 GRAPH_TYPEDEF_FACTORY(Graph);
114 std::vector<int> bits(dim+1);
116 for(int i=1;i<=dim;i++) bits[i]=2*bits[i-1];
118 for(int i=0;i<bits[dim];i++) {
119 nodes.push_back(G.addNode());
120 for(int j=0;j<dim;j++) if(i&bits[j]) {
121 G.addEdge(nodes[i-bits[j]],nodes[i]);
122 G.addEdge(nodes[i],nodes[i-bits[j]]);