1.1 --- a/benchmark/graph-bench.cc	Wed Dec 07 15:40:27 2005 +0000
     1.2 +++ b/benchmark/graph-bench.cc	Wed Dec 07 15:43:44 2005 +0000
     1.3 @@ -28,12 +28,14 @@
     1.4    long long int count;
     1.5    
     1.6    for(count=0;count<rat;count++) {
     1.7 -    equ[count%rat]=G.addEdge(nodes[(count*p)%n],nodes[(count*p/n)%n]);
     1.8 +    equ[int(count%rat)]=G.addEdge(nodes[int((count*p)%n)],
     1.9 +				  nodes[int((count*p/n)%n)]);
    1.10    }
    1.11    for(;(count%rat)||((count*p)%n)||((count*p/n)%n);count++) {
    1.12      //    if(!(count%1000000)) fprintf(stderr,"%d\r",count);
    1.13      if(count%rat) G.erase(equ[count%rat]);
    1.14 -    equ[count%rat]=G.addEdge(nodes[(count*p)%n],nodes[(count*p/n)%n]);
    1.15 +    equ[int(count%rat)]=G.addEdge(nodes[int((count*p)%n)],
    1.16 +				  nodes[int((count*p/n)%n)]);
    1.17    }
    1.18  //   std::cout << "Added " << count
    1.19  // 	    << " ( " << n << "^2 * " << rat << " ) edges\n";