# source:lemon-0.x/benchmark/graph-bench.cc@1955:daca31868d70

Last change on this file since 1955:daca31868d70 was 1855:c72636dcf0bd, checked in by Alpar Juttner, 15 years ago

Eliminate warnins

File size: 1.4 KB
RevLine
[921]1#include<lemon/list_graph.h>
[711]2
3#include"bench_tools.h"
[699]4
[921]5using namespace lemon;
[699]6
7///Makes a full graph by adding and deleting a lot of edges;
8
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.
14template <class Graph>
15void makeFullGraph(int n, int rat, int p)
16{
[1756]17  GRAPH_TYPEDEFS(typename Graph);
[699]18
19  Graph G;
20
[708]21  //  Node nodes[n];
22  std::vector<Node> nodes(n);
24
[708]25  //Edge equ[rat];
26  std::vector<Edge> equ(rat);
[699]27
[718]28  long long int count;
[699]29
30  for(count=0;count<rat;count++) {
32                                  nodes[int((count*p/n)%n)]);
[699]33  }
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]);
38                                  nodes[int((count*p/n)%n)]);
[699]39  }
[718]40//   std::cout << "Added " << count
41//          << " ( " << n << "^2 * " << rat << " ) edges\n";
42
43
[699]44  //  for(int i=0;1;i++) ;
45}
46
47int main()
48{
[921]49  lemon::Timer T;
[699]50  makeFullGraph<ListGraph>(nextPrim(1000),nextPrim(300),nextPrim(100));
[718]51
52  PrintTime("BIG",T);
[1847]53  T.restart();
[699]54  makeFullGraph<ListGraph>(nextPrim(100),nextPrim(30000),nextPrim(150));
[718]55
56  PrintTime("SMALL",T);
[699]57}
Note: See TracBrowser for help on using the repository browser.