1.1 --- a/benchmark/edge_lookup.cc	Mon Oct 30 16:12:44 2006 +0000
     1.2 +++ b/benchmark/edge_lookup.cc	Mon Oct 30 16:19:18 2006 +0000
     1.3 @@ -428,39 +428,39 @@
     1.4    
     1.5  };
     1.6  
     1.7 -class EL4
     1.8 -{
     1.9 -public:
    1.10 -  Graph &_g;
    1.11 -  EdgeLookUp4<Graph> _el;
    1.12 -  EL4(Graph &g) :_g(g), _el(g) {}
    1.13 -  void operator()() 
    1.14 -  {
    1.15 -    Edge e;
    1.16 +// class EL4
    1.17 +// {
    1.18 +// public:
    1.19 +//   Graph &_g;
    1.20 +//   EdgeLookUp4<Graph> _el;
    1.21 +//   EL4(Graph &g) :_g(g), _el(g) {}
    1.22 +//   void operator()() 
    1.23 +//   {
    1.24 +//     Edge e;
    1.25      
    1.26 -    for(NodeIt v(_g);v!=INVALID;++v)
    1.27 -      for(NodeIt u(_g);u!=INVALID;++u)
    1.28 -	e=_el(u,v);
    1.29 -  }
    1.30 +//     for(NodeIt v(_g);v!=INVALID;++v)
    1.31 +//       for(NodeIt u(_g);u!=INVALID;++u)
    1.32 +// 	e=_el(u,v);
    1.33 +//   }
    1.34    
    1.35 -};
    1.36 +// };
    1.37  
    1.38 -class EL5
    1.39 -{
    1.40 -public:
    1.41 -  Graph &_g;
    1.42 -  EdgeLookUp5<Graph> _el;
    1.43 -  EL5(Graph &g) :_g(g), _el(g) {}
    1.44 -  void operator()() 
    1.45 -  {
    1.46 -    Edge e;
    1.47 +// class EL5
    1.48 +// {
    1.49 +// public:
    1.50 +//   Graph &_g;
    1.51 +//   EdgeLookUp5<Graph> _el;
    1.52 +//   EL5(Graph &g) :_g(g), _el(g) {}
    1.53 +//   void operator()() 
    1.54 +//   {
    1.55 +//     Edge e;
    1.56      
    1.57 -    for(NodeIt v(_g);v!=INVALID;++v)
    1.58 -      for(NodeIt u(_g);u!=INVALID;++u)
    1.59 -	e=_el(u,v);
    1.60 -  }
    1.61 +//     for(NodeIt v(_g);v!=INVALID;++v)
    1.62 +//       for(NodeIt u(_g);u!=INVALID;++u)
    1.63 +// 	e=_el(u,v);
    1.64 +//   }
    1.65    
    1.66 -};
    1.67 +// };
    1.68  
    1.69  int main(int, char**argv)
    1.70  {