Changeset 2229:4dbb6dd2dd4b in lemon-0.x for test
- Timestamp:
- 10/02/06 18:11:00 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2969
- Location:
- test
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
test/graph_utils_test.h
r1956 r2229 51 51 typedef typename Graph::EdgeIt EdgeIt; 52 52 Graph graph; 53 srand(time(0));54 53 for (int i = 0; i < 10; ++i) { 55 54 graph.addNode(); … … 58 57 typename DescriptorMap<Graph, Node>::InverseMap invNodes(nodes); 59 58 for (int i = 0; i < 100; ++i) { 60 int src = (int)(rand() / (RAND_MAX + 1.0) *invNodes.size());61 int trg = (int)(rand() / (RAND_MAX + 1.0) *invNodes.size());59 int src = rnd.getInt(invNodes.size()); 60 int trg = rnd.getInt(invNodes.size()); 62 61 graph.addEdge(invNodes[src], invNodes[trg]); 63 62 } -
test/heap_test.h
r1956 r2229 46 46 47 47 for (int i = 0; i < n; ++i) { 48 v[i] = r and() % 1000;48 v[i] = rnd.getInt(1000); 49 49 heap.push(i, v[i]); 50 50 } … … 66 66 67 67 for (int i = 0; i < n; ++i) { 68 v[i] = r and() % 1000;68 v[i] = rnd.getInt(1000); 69 69 heap.push(i, v[i]); 70 70 } 71 71 for (int i = 0; i < n; ++i) { 72 v[i] += r and() % 1000;72 v[i] += rnd.getInt(1000); 73 73 heap.increase(i, v[i]); 74 74 } -
test/test_tools.h
r2198 r2229 28 28 #include <lemon/concept_check.h> 29 29 #include <lemon/concept/graph.h> 30 31 #include <lemon/random.h> 30 32 31 33 using namespace lemon; … … 177 179 } 178 180 179 int _urandom_init() {180 int seed = time(0);181 srand(seed);182 return seed;183 }184 185 181 int urandom(int n) { 186 static int seed = _urandom_init(); 187 ignore_unused_variable_warning(seed); 188 return (int)(rand() / (1.0 + RAND_MAX) * n); 182 return rnd.getInt(n); 189 183 } 190 184
Note: See TracChangeset
for help on using the changeset viewer.