author | ladanyi |
Sat, 01 Mar 2008 20:07:29 +0000 | |
changeset 2590 | 47c245b97199 |
parent 2589 | 1bbb28acb8c9 |
child 2591 | 3b4d5bc3b4fb |
1.1 --- a/benchmark/graph-bench.cc Fri Feb 29 16:09:29 2008 +0000 1.2 +++ b/benchmark/graph-bench.cc Sat Mar 01 20:07:29 2008 +0000 1.3 @@ -43,7 +43,7 @@ 1.4 //Edge equ[rat]; 1.5 std::vector<Edge> equ(rat); 1.6 1.7 - long long int count; 1.8 + long int count; 1.9 1.10 for(count=0;count<rat;count++) { 1.11 equ[int(count%rat)]=G.addEdge(nodes[int((count*p)%n)],