equal
deleted
inserted
replaced
41 for(int i=0;i<n;i++) nodes[i]=G.addNode(); |
41 for(int i=0;i<n;i++) nodes[i]=G.addNode(); |
42 |
42 |
43 //Edge equ[rat]; |
43 //Edge equ[rat]; |
44 std::vector<Edge> equ(rat); |
44 std::vector<Edge> equ(rat); |
45 |
45 |
46 long long int count; |
46 long int count; |
47 |
47 |
48 for(count=0;count<rat;count++) { |
48 for(count=0;count<rat;count++) { |
49 equ[int(count%rat)]=G.addEdge(nodes[int((count*p)%n)], |
49 equ[int(count%rat)]=G.addEdge(nodes[int((count*p)%n)], |
50 nodes[int((count*p/n)%n)]); |
50 nodes[int((count*p/n)%n)]); |
51 } |
51 } |