Changeset 2242:16523135943d in lemon0.x for test/matrix_maps_test.cc
 Timestamp:
 10/14/06 17:26:05 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2991
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

test/matrix_maps_test.cc
r2039 r2242 68 68 for (Graph::NodeIt it(graph); it != INVALID; ++it) { 69 69 for (Graph::NodeIt jt(graph); jt != INVALID; ++jt) { 70 int val = urandom(100);70 int val = rnd[100]; 71 71 matrix.set(it, jt, val); 72 72 check(matrix(it, jt) == val, "Wrong assign"); … … 109 109 for (Graph::NodeIt it(graph); it != INVALID; ++it) { 110 110 for (Graph::NodeIt jt(graph); jt != INVALID; ++jt) { 111 int val = urandom(100);111 int val = rnd[100]; 112 112 matrix.set(it, jt, val); 113 113 check(matrix(it, jt) == val, "Wrong assign"); … … 155 155 for (Graph::NodeIt it(graph1); it != INVALID; ++it) { 156 156 for (Graph::EdgeIt jt(graph2); jt != INVALID; ++jt) { 157 int val = urandom(100);157 int val = rnd[100]; 158 158 matrix.set(it, jt, val); 159 159 check(matrix(it, jt) == val, "Wrong assign"); … … 199 199 for (Graph::NodeIt it(graph); it != INVALID; ++it) { 200 200 for (Graph::NodeIt jt(graph); jt != INVALID; ++jt) { 201 int val = urandom(100);201 int val = rnd[100]; 202 202 matrix.set(it, jt, val); 203 203 check(matrix(it, jt) == val, "Wrong assign");
Note: See TracChangeset
for help on using the changeset viewer.