equal
deleted
inserted
replaced
1 #include<math.h> |
1 #include<math.h> |
2 #include<hugo/list_graph.h> |
2 #include<hugo/list_graph.h> |
3 #include<hugo/time_measure.h> |
3 #include<hugo/time_measure.h> |
4 #include<iostream> |
4 #include<iostream> |
5 #include<sage_graph.h> |
5 #include<sage_graph.h> |
|
6 #include<vector> |
6 |
7 |
7 using namespace hugo; |
8 using namespace hugo; |
8 |
9 |
9 ///An experimental typedef factory |
10 ///An experimental typedef factory |
10 #define GRAPH_TYPEDEF_FACTORY(Graph) \ |
11 #define GRAPH_TYPEDEF_FACTORY(Graph) \ |
46 { |
47 { |
47 GRAPH_TYPEDEF_FACTORY(Graph); |
48 GRAPH_TYPEDEF_FACTORY(Graph); |
48 |
49 |
49 Graph G; |
50 Graph G; |
50 |
51 |
51 Node nodes[n]; |
52 // Node nodes[n]; |
|
53 std::vector<Node> nodes(n); |
52 for(int i=0;i<n;i++) nodes[i]=G.addNode(); |
54 for(int i=0;i<n;i++) nodes[i]=G.addNode(); |
53 |
55 |
54 Edge equ[rat]; |
56 //Edge equ[rat]; |
|
57 std::vector<Edge> equ(rat); |
55 |
58 |
56 unsigned long long int count; |
59 unsigned long long int count; |
57 |
60 |
58 for(count=0;count<rat;count++) { |
61 for(count=0;count<rat;count++) { |
59 equ[count%rat]=G.addEdge(nodes[(count*p)%n],nodes[(count*p/n)%n]); |
62 equ[count%rat]=G.addEdge(nodes[(count*p)%n],nodes[(count*p/n)%n]); |