Changeset 1728:eb8bb91ba9e2 in lemon-0.x for test/graph_utils_test.cc

Timestamp:

10/14/05 13:03:40 (18 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2255

Message:

Updating tests

File:

• test/graph_utils_test.cc (modified) (1 diff)

test/graph_utils_test.cc

@@ -78 +78 @@
   checkSnapDeg<SmartGraph>();
   
+  {
+    const int nodeNum = 10;
+    const int edgeNum = 100;
+    ListGraph graph;
+    InDegMap<ListGraph> inDeg(graph);
+    std::vector<ListGraph::Node> nodes(nodeNum);
+    for (int i = 0; i < nodeNum; ++i) {
+      nodes[i] = graph.addNode();
+    }
+    std::vector<ListGraph::Edge> edges(edgeNum);
+    for (int i = 0; i < edgeNum; ++i) {
+      edges[i] = 
+        graph.addEdge(nodes[urandom(nodeNum)], nodes[urandom(nodeNum)]);
+    }
+    for (int i = 0; i < nodeNum; ++i) {
+      check(inDeg[nodes[i]] == countInEdges(graph, nodes[i]), 
+            "Wrong in degree map");
+    }
+    for (int i = 0; i < edgeNum; ++i) {
+      graph.changeTarget(edges[i], nodes[urandom(nodeNum)]);
+    }
+    for (int i = 0; i < nodeNum; ++i) {
+      check(inDeg[nodes[i]] == countInEdges(graph, nodes[i]),
+            "Wrong in degree map");
+    }
+    for (int i = 0; i < edgeNum; ++i) {
+      graph.changeSource(edges[i], nodes[urandom(nodeNum)]);
+    }
+    for (int i = 0; i < nodeNum; ++i) {
+      check(inDeg[nodes[i]] == countInEdges(graph, nodes[i]), 
+            "Wrong in degree map");
+    }
+    for (int i = 0; i < edgeNum; ++i) {
+      graph.reverseEdge(edges[i]);
+    }
+    for (int i = 0; i < nodeNum; ++i) {
+      check(inDeg[nodes[i]] == countInEdges(graph, nodes[i]), 
+            "Wrong in degree map");
+    }
+  }
 
   ///Everything is OK