3 #include <lemon/list_graph.h>
4 #include <lemon/smart_graph.h>
5 #include <merge_node_graph_wrapper.h>
10 using namespace lemon;
12 class Graph3 : ListGraph {
14 class Node : public ListGraph::Node { };
19 typedef SmartGraph Graph1;
20 typedef ListGraph Graph2;
23 typedef MergeNodeGraphWrapper<Graph1, Graph2> GW;
25 Graph1::Node n1=g.addNode();
26 Graph1::Node n2=g.addNode();
27 Graph1::Node n3=g.addNode();
28 Graph2::Node n4=h.addNode();
29 Graph2::Node n5=h.addNode();
31 for (GW::NodeIt n(gw); n!=INVALID; ++n) {
32 cout << gw.id(n) << endl;
35 GW::NodeMap<int> nm(gw);
37 for (GW::NodeIt n(gw); n!=INVALID; ++n) {
41 for (Graph1::NodeIt n(g); n!=INVALID; ++n) {
42 cout << nm[n] << endl;
44 for (Graph2::NodeIt n(h); n!=INVALID; ++n) {
45 cout << nm[n] << endl;
51 // typedef SmartGraph Graph1;
52 typedef ListGraph Graph1;
53 typedef ListGraph Graph2;
56 typedef MergeNodeGraphWrapper<Graph1, Graph2> GW;
61 // typedef SmartGraph Graph1;
62 typedef Graph3 Graph1;
63 typedef ListGraph Graph2;
66 typedef MergeNodeGraphWrapper<Graph1, Graph2> GW;
71 // typedef SmartGraph Graph1;
72 typedef ListGraph Graph1;
73 typedef Graph3 Graph2;
76 typedef MergeNodeGraphWrapper<Graph1, Graph2> GW;