Changeset 1847:7cbc12e42482 in lemon-0.x for benchmark
- Timestamp:
- 12/05/05 18:03:31 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2408
- Location:
- benchmark
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
benchmark/bfs-bench.cc
r1756 r1847 115 115 // << dim*(1<<dim) << " edges):"; 116 116 117 T.res et();117 T.restart(); 118 118 vector<Node> nodes; 119 119 addBiDirHyperCube(G,dim,nodes); … … 121 121 PrintTime("GENGRAPH",T); 122 122 123 T.res et();123 T.restart(); 124 124 { 125 125 for(int i=0;i<mul;i++) … … 127 127 } 128 128 PrintTime("BFS-STL",T); 129 T.res et();129 T.restart(); 130 130 { 131 131 for(int i=0;i<mul;i++) … … 133 133 } 134 134 PrintTime("BFS-OWN",T); 135 T.res et();135 T.restart(); 136 136 { 137 137 for(int i=0;i<mul;i++) -
benchmark/graph-bench.cc
r1756 r1847 49 49 50 50 PrintTime("BIG",T); 51 T.res et();51 T.restart(); 52 52 makeFullGraph<ListGraph>(nextPrim(100),nextPrim(30000),nextPrim(150)); 53 53 -
benchmark/hcube.cc
r1756 r1847 53 53 // << dim*(1<<dim) << " edges):"; 54 54 55 T.res et();55 T.restart(); 56 56 vector<Node> nodes; 57 57 addBiDirHyperCube(G,dim,nodes); … … 59 59 PrintTime("GENGRAPH",T); 60 60 61 T.res et();61 T.restart(); 62 62 Graph::EdgeMap<int> map(G); 63 63 for(int i=0;i<5;i++) { … … 85 85 PrintTime("GENLENGTHS",T); 86 86 87 T.res et();87 T.restart(); 88 88 { 89 89 Dijkstra<Graph> Dij(G,map); … … 93 93 PrintTime("DIJKSTRA",T); 94 94 95 T.res et();95 T.restart(); 96 96 { 97 97 Graph::EdgeMap<int> flow(G);
Note: See TracChangeset
for help on using the changeset viewer.