equal
deleted
inserted
replaced
6 |
6 |
7 using std::cout; |
7 using std::cout; |
8 using std::endl; |
8 using std::endl; |
9 |
9 |
10 using namespace lemon; |
10 using namespace lemon; |
|
11 |
|
12 class Graph3 : ListGraph { |
|
13 public: |
|
14 class Node : public ListGraph::Node { }; |
|
15 class Edge { }; |
|
16 }; |
11 |
17 |
12 int main() { |
18 int main() { |
13 typedef SmartGraph Graph1; |
19 typedef SmartGraph Graph1; |
14 typedef ListGraph Graph2; |
20 typedef ListGraph Graph2; |
15 Graph1 g; |
21 Graph1 g; |
36 cout << nm[n] << endl; |
42 cout << nm[n] << endl; |
37 } |
43 } |
38 for (Graph2::NodeIt n(h); n!=INVALID; ++n) { |
44 for (Graph2::NodeIt n(h); n!=INVALID; ++n) { |
39 cout << nm[n] << endl; |
45 cout << nm[n] << endl; |
40 } |
46 } |
|
47 |
|
48 gw.print(); |
|
49 |
|
50 { |
|
51 // typedef SmartGraph Graph1; |
|
52 typedef ListGraph Graph1; |
|
53 typedef ListGraph Graph2; |
|
54 Graph1 g; |
|
55 Graph2 h; |
|
56 typedef MergeNodeGraphWrapper<Graph1, Graph2> GW; |
|
57 GW gw(g, h); |
|
58 gw.print(); |
|
59 } |
|
60 { |
|
61 // typedef SmartGraph Graph1; |
|
62 typedef Graph3 Graph1; |
|
63 typedef ListGraph Graph2; |
|
64 Graph1 g; |
|
65 Graph2 h; |
|
66 typedef MergeNodeGraphWrapper<Graph1, Graph2> GW; |
|
67 GW gw(g, h); |
|
68 gw.print(); |
|
69 } |
|
70 { |
|
71 // typedef SmartGraph Graph1; |
|
72 typedef ListGraph Graph1; |
|
73 typedef Graph3 Graph2; |
|
74 Graph1 g; |
|
75 Graph2 h; |
|
76 typedef MergeNodeGraphWrapper<Graph1, Graph2> GW; |
|
77 GW gw(g, h); |
|
78 gw.print(); |
|
79 } |
41 } |
80 } |