1.1 --- a/test/graph_utils_test.cc	Fri Oct 13 15:10:50 2006 +0000
     1.2 +++ b/test/graph_utils_test.cc	Sat Oct 14 15:26:05 2006 +0000
     1.3 @@ -116,7 +116,7 @@
     1.4      std::vector<ListGraph::Edge> edges(edgeNum);
     1.5      for (int i = 0; i < edgeNum; ++i) {
     1.6        edges[i] = 
     1.7 -	graph.addEdge(nodes[urandom(nodeNum)], nodes[urandom(nodeNum)]);
     1.8 +	graph.addEdge(nodes[rnd[nodeNum]], nodes[rnd[nodeNum]]);
     1.9      }
    1.10      for (int i = 0; i < nodeNum; ++i) {
    1.11        check(inDeg[nodes[i]] == countInEdges(graph, nodes[i]),