Changeset 1053:90f8696360b2 in lemon-0.x for src/test

Timestamp:

01/05/05 15:34:00 (20 years ago)

Author:

Mihaly Barasz

Branch:

default

Phase:

public

Convert:

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

Message:

UndirGraphs?: invalid edge bug

File:

• src/test/undir_graph_test.cc (modified) (3 diffs)

src/test/undir_graph_test.cc

@@ -7 +7 @@
 #include <lemon/full_graph.h>
 
+#include <lemon/graph_utils.h>
+
 #include "test_tools.h"
 
@@ -13 +15 @@
 using namespace lemon::concept;
 
-
-int main() {
+void check_concepts() {
   typedef UndirGraphExtender<ListGraphBase> UndirListGraphBase;
 
@@ -41 +42 @@
 
   checkConcept<UndirGraph, UndirGraph>();
+}
+
+typedef UndirListGraph Graph;
+typedef Graph::Node Node;
+typedef Graph::UndirEdge UEdge;
+typedef Graph::Edge Edge;
+typedef Graph::NodeIt NodeIt;
+typedef Graph::UndirEdgeIt UEdgeIt;
+typedef Graph::EdgeIt EdgeIt;
+
+void check_item_counts(Graph &g, int n, int e) {
+  check(countNodes(g)==n, "Wrong node number.");
+  check(countEdges(g)==2*e, "Wrong edge number.");
+}
+
+void print_items(Graph &g) {
+  cout << "Nodes" << endl;
+  int i=0;
+  for(NodeIt it(g); it!=INVALID; ++it, ++i) {
+    cout << "  " << i << ": " << g.id(it) << endl;
+  }
+
+  cout << "UndirEdge" << endl;
+  i=0;
+  for(UEdgeIt it(g); it!=INVALID; ++it, ++i) {
+    cout << "  " << i << ": " << g.id(it) 
+         << " (" << g.id(g.source(it)) << ", " << g.id(g.target(it)) 
+         << ")" << endl;
+  }
+
+  cout << "Edge" << endl;
+  i=0;
+  for(EdgeIt it(g); it!=INVALID; ++it, ++i) {
+    cout << "  " << i << ": " << g.id(it)
+         << " (" << g.id(g.source(it)) << ", " << g.id(g.target(it)) 
+         << ")" << endl;
+  }
+
+}
+
+int main() {
+  check_concepts();
+
+
+  Graph g;
+
+  check_item_counts(g,0,0);
+
+  Node
+    n1 = g.addNode(),
+    n2 = g.addNode(),
+    n3 = g.addNode();
+
+  UEdge
+    e1 = g.addEdge(n1, n2),
+    e2 = g.addEdge(n2, n3);
+
+  // print_items(g);
+
+  check_item_counts(g,3,2);
 
   return 0;