benchmark/bench_tools.h
changeset 1715 e71778873dd0
parent 1435 8e85e6bbefdf
child 1756 b1f441f24d08
equal deleted inserted replaced
0:ab9aa64a0851 1:e5decafed5f7
    81 };
    81 };
    82 
    82 
    83 inline void PrintTime(char *ID,lemon::Timer &T) 
    83 inline void PrintTime(char *ID,lemon::Timer &T) 
    84 {
    84 {
    85   lemon::TimeStamp S(T);
    85   lemon::TimeStamp S(T);
    86   std::cout << ID << ' ' << S.getUserTime() << ' '
    86   std::cout << ID << ' ' << S.userTime() << ' '
    87 	    << S.getSystemTime() << ' ' << S.getRealTime() << std::endl;
    87 	    << S.systemTime() << ' ' << S.realTime() << std::endl;
    88 }
    88 }
    89 
    89 
    90 
    90 
    91 
    91 
    92 ///
    92 ///
    93 template<class Graph>
    93 template<class Graph>
    94 void addHiperCube(Graph &G,int dim,std::vector<typename Graph::Node> &nodes)
    94 void addHyperCube(Graph &G,int dim,std::vector<typename Graph::Node> &nodes)
    95 {
    95 {
    96   GRAPH_TYPEDEF_FACTORY(Graph);
    96   GRAPH_TYPEDEF_FACTORY(Graph);
    97   
    97   
    98   std::vector<int> bits(dim+1);
    98   std::vector<int> bits(dim+1);
    99   bits[0]=1;
    99   bits[0]=1;
   105   }
   105   }
   106 }
   106 }
   107 
   107 
   108 ///
   108 ///
   109 template<class Graph>
   109 template<class Graph>
   110 void addBiDirHiperCube(Graph &G,int dim,std::vector<typename Graph::Node>&nodes)
   110 void addBiDirHyperCube(Graph &G,int dim,std::vector<typename Graph::Node>&nodes)
   111 {
   111 {
   112   GRAPH_TYPEDEF_FACTORY(Graph);
   112   GRAPH_TYPEDEF_FACTORY(Graph);
   113   
   113   
   114   std::vector<int> bits(dim+1);
   114   std::vector<int> bits(dim+1);
   115   bits[0]=1;
   115   bits[0]=1;