1.1 --- a/src/benchmark/hcube.cc	Tue Jul 27 16:04:21 2004 +0000
     1.2 +++ b/src/benchmark/hcube.cc	Tue Jul 27 16:09:42 2004 +0000
     1.3 @@ -11,40 +11,6 @@
     1.4  using namespace std;
     1.5  using namespace hugo;
     1.6  
     1.7 -template<class Graph>
     1.8 -void addHiperCube(Graph &G,int dim,vector<typename Graph::Node> &nodes)
     1.9 -{
    1.10 -  GRAPH_TYPEDEF_FACTORY(Graph);
    1.11 -  
    1.12 -  vector<int> bits(dim+1);
    1.13 -  bits[0]=1;
    1.14 -  for(int i=1;i<=dim;i++) bits[i]=2*bits[i-1];
    1.15 -  
    1.16 -  for(int i=0;i<bits[dim];i++) {
    1.17 -    nodes.push_back(G.addNode());
    1.18 -    for(int j=0;j<dim;j++) if(i&bits[j]) G.addEdge(nodes[i-bits[j]],nodes[i]);
    1.19 -  }
    1.20 -}
    1.21 -
    1.22 -template<class Graph>
    1.23 -void addBiDirHiperCube(Graph &G,int dim,vector<typename Graph::Node> &nodes)
    1.24 -{
    1.25 -  GRAPH_TYPEDEF_FACTORY(Graph);
    1.26 -  
    1.27 -  vector<int> bits(dim+1);
    1.28 -  bits[0]=1;
    1.29 -  for(int i=1;i<=dim;i++) bits[i]=2*bits[i-1];
    1.30 -  
    1.31 -  for(int i=0;i<bits[dim];i++) {
    1.32 -    nodes.push_back(G.addNode());
    1.33 -    for(int j=0;j<dim;j++) if(i&bits[j]) {
    1.34 -      G.addEdge(nodes[i-bits[j]],nodes[i]);
    1.35 -      G.addEdge(nodes[i],nodes[i-bits[j]]);
    1.36 -    }
    1.37 -    
    1.38 -  }
    1.39 -}
    1.40 -
    1.41  inline int numOfOnes(int n,int dim)
    1.42  {
    1.43    int s=0;