1.1 --- a/src/benchmark/graph-bench.cc	Mon Jul 19 13:30:20 2004 +0000
     1.2 +++ b/src/benchmark/graph-bench.cc	Mon Jul 19 13:31:47 2004 +0000
     1.3 @@ -3,6 +3,7 @@
     1.4  #include<hugo/time_measure.h>
     1.5  #include<iostream>
     1.6  #include<sage_graph.h>
     1.7 +#include<vector>
     1.8  
     1.9  using namespace hugo;
    1.10  
    1.11 @@ -48,10 +49,12 @@
    1.12  
    1.13    Graph G;
    1.14    
    1.15 -  Node nodes[n];
    1.16 +  //  Node nodes[n];
    1.17 +  std::vector<Node> nodes(n);
    1.18    for(int i=0;i<n;i++) nodes[i]=G.addNode();
    1.19    
    1.20 -  Edge equ[rat];
    1.21 +  //Edge equ[rat];
    1.22 +  std::vector<Edge> equ(rat);
    1.23    
    1.24    unsigned long long int count;
    1.25