Changeset 1008:3fef334f5f37 in lemon-0.x for src/work/marci/merge_node_graph_wrapper_test.cc

Timestamp:

11/18/04 23:31:21 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

RoadMap? to MergeGraphWrapper? and STGraphWrapper,
NewEdgeSetGraphWrapper? which is similar to the old EdgeSet?

File:

• src/work/marci/merge_node_graph_wrapper_test.cc (modified) (3 diffs)

src/work/marci/merge_node_graph_wrapper_test.cc

@@ -5 +5 @@
 #include <merge_node_graph_wrapper.h>
 
+#include<lemon/concept_check.h>
+#include<lemon/concept/graph.h>
+
 using std::cout;
 using std::endl;
 
 using namespace lemon;
+using namespace lemon::concept;
 
 class Graph3 : ListGraph {
@@ -19 +23 @@
   typedef SmartGraph Graph1;
   typedef ListGraph Graph2;
+  
+//   {
+//     checkConcept<StaticGraph, NewEdgeSetGraphWrapper<Graph1, Graph2> >(); 
+//   }
+  {
   Graph1 g;
   Graph2 h;
@@ -78 +87 @@
     gw.print();
   }
+  }
+  {
+    Graph1 g;
+    Graph2 h;
+    typedef Graph1::Node Node1;
+    typedef Graph2::Node Node2;
+    typedef NewEdgeSetGraphWrapper<Graph1, Graph2> GW;
+    Graph1::NodeMap<Graph2::Node> e_node(g);
+    Graph2::NodeMap<Graph1::Node> n_node(h);
+    GW gw(g, h, e_node, n_node);
+    for (int i=0; i<4; ++i) { 
+      Node1 n=g.addNode();
+      e_node.set(n, INVALID);
+    }
+    for (int i=0; i<4; ++i) {
+      Graph1::Node n1=g.addNode();
+      Graph2::Node n2=h.addNode();
+      e_node.set(n1, n2);
+      n_node.set(n2, n1);
+    }
+    for (Graph2::NodeIt n(h); n!=INVALID; ++n)
+      for (Graph2::NodeIt m(h); m!=INVALID; ++m)
+        if ((h.id(n)+h.id(m))%3==0) h.addEdge(n, m);
+//     Graph1::NodeIt n(g);
+//     Node1 n1=n;
+//     Node1 n2=++n;
+//     Node1 n3=++n;
+//     Node1 n4=n;
+//     gw.addEdge(n1, n2);
+//     gw.addEdge(n1, n2);
+//     for (EdgeIt(e))
+//   Graph1::Node n1=g.addNode();
+//   Graph1::Node n2=g.addNode();
+//   Graph1::Node n3=g.addNode();
+//   Graph2::Node n4=h.addNode();
+//   Graph2::Node n5=h.addNode();
+    for (GW::EdgeIt e(gw); e!=INVALID; ++e) 
+      cout << gw.id(e) << endl;
+    for (GW::NodeIt n(gw); n!=INVALID; ++n) {
+      if (e_node[n]==INVALID) {
+        cout<<gw.id(n)<<" INVALID"<<endl;
+      } else {
+        cout <<gw.id(n)<<" "<<h.id(e_node[n])<<" out_edges: ";
+        //      cout << &e_node << endl;
+        //cout << &n_node << endl;
+        for (GW::OutEdgeIt e(gw, n); e!=INVALID; ++e) {
+          cout<<gw.id(e)<<" ";
+        }
+        cout<< endl;
+      }
+    }
+  }
 }