Changeset 977:48962802d168 in lemon-0.x for src/test

Timestamp:

11/10/04 21:14:32 (20 years ago)

Author:

Mihaly Barasz

Branch:

default

Phase:

public

Convert:

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

Message:

• enable_if imported from BOOST
• count{Nodes,Edges} implemented via graph tags
• some #include bugs fixed

Location:

src/test

Files:

• graph_utils_test.cc (modified) (2 diffs)
• graph_utils_test.h (modified) (1 diff)

src/test/graph_utils_test.cc

@@ -3 +3 @@
 #include <iostream>
 #include <vector>
+
+#include <lemon/graph_utils.h>
 
 #include <lemon/list_graph.h>
@@ -23 +25 @@
     checkGraphCounters<SmartGraph>();
   }
+  {
+    int num = 5;
+    FullGraph fg(num);
+    check(countNodes(fg) == num, "FullGraph: wrong node number.");
+    check(countEdges(fg) == num*num, "FullGraph: wrong edge number.");    
+  }
 
   std::cout << __FILE__ ": All tests passed.\n";

src/test/graph_utils_test.h

@@ -31 +31 @@
     addPetersen(graph, num);
     bidirGraph(graph);
-    check(countNodes(graph) == 2*num, "Wrong node counter.");
-    check(countEdges(graph) == 6*num, "Wrong edge counter.");    
+    check(countNodes(graph) == 2*num, "Wrong node number.");
+    check(countEdges(graph) == 6*num, "Wrong edge number.");    
     for (typename Graph::NodeIt it(graph); it != INVALID; ++it) {
-      check(countOutEdges(graph, it) == 3, "Wrong out degree counter.");
-      check(countInEdges(graph, it) == 3, "Wrong in degree counter.");
+      check(countOutEdges(graph, it) == 3, "Wrong out degree number.");
+      check(countInEdges(graph, it) == 3, "Wrong in degree number.");
     }
   }