Polish the doc.
1 #include<lemon/list_graph.h>
3 #include"bench_tools.h"
7 ///Makes a full graph by adding and deleting a lot of edges;
9 ///\param n Number of nodes.
10 ///\param rat The funcion will make \f$rat\timesn^2\f$ edge addition and
11 ///\f$(rat-1)\timesn^2\f$ deletion.
12 ///\param p Tuning parameters.
13 ///\warning \c rat, \c p, and \c n must be pairwise relative primes.
14 template <class Graph>
15 void makeFullGraph(int n, int rat, int p)
17 GRAPH_TYPEDEFS(typename Graph);
22 std::vector<Node> nodes(n);
23 for(int i=0;i<n;i++) nodes[i]=G.addNode();
26 std::vector<Edge> equ(rat);
30 for(count=0;count<rat;count++) {
31 equ[int(count%rat)]=G.addEdge(nodes[int((count*p)%n)],
32 nodes[int((count*p/n)%n)]);
34 for(;(count%rat)||((count*p)%n)||((count*p/n)%n);count++) {
35 // if(!(count%1000000)) fprintf(stderr,"%d\r",count);
36 if(count%rat) G.erase(equ[count%rat]);
37 equ[int(count%rat)]=G.addEdge(nodes[int((count*p)%n)],
38 nodes[int((count*p/n)%n)]);
40 // std::cout << "Added " << count
41 // << " ( " << n << "^2 * " << rat << " ) edges\n";
44 // for(int i=0;1;i++) ;
50 makeFullGraph<ListGraph>(nextPrim(1000),nextPrim(300),nextPrim(100));
54 makeFullGraph<ListGraph>(nextPrim(100),nextPrim(30000),nextPrim(150));