46 MergeEdgeGraphWrapper<Graph1, Graph2>::printNode(); |
46 MergeEdgeGraphWrapper<Graph1, Graph2>::printNode(); |
47 MergeEdgeGraphWrapper<Graph1, Graph2>::printEdge(); |
47 MergeEdgeGraphWrapper<Graph1, Graph2>::printEdge(); |
48 checkConcept<StaticGraph, MergeEdgeGraphWrapper<Graph1, Graph1> >(); |
48 checkConcept<StaticGraph, MergeEdgeGraphWrapper<Graph1, Graph1> >(); |
49 MergeEdgeGraphWrapper<Graph1, Graph1>::printNode(); |
49 MergeEdgeGraphWrapper<Graph1, Graph1>::printNode(); |
50 MergeEdgeGraphWrapper<Graph1, Graph1>::printEdge(); |
50 MergeEdgeGraphWrapper<Graph1, Graph1>::printEdge(); |
|
51 typedef ResGraphWrapper<Graph1, int, |
|
52 ConstMap<Graph1, int>, ConstMap<Graph1, int> > Graph4; |
|
53 checkConcept<StaticGraph, MergeEdgeGraphWrapper<Graph1, Graph4> >(); |
|
54 MergeEdgeGraphWrapper<Graph1, Graph4>::printNode(); |
|
55 MergeEdgeGraphWrapper<Graph1, Graph4>::printEdge(); |
|
56 checkConcept<StaticGraph, MergeEdgeGraphWrapper<Graph4, Graph1> >(); |
|
57 MergeEdgeGraphWrapper<Graph4, Graph1>::printNode(); |
|
58 MergeEdgeGraphWrapper<Graph4, Graph1>::printEdge(); |
51 } |
59 } |
52 |
60 |
53 Graph1 g1; |
61 Graph1 g1; |
54 Graph2 g2; |
62 Graph2 g2; |
55 typedef MergeEdgeGraphWrapper<Graph1, Graph2> GW; |
63 typedef MergeEdgeGraphWrapper<Graph1, Graph2> GW; |
116 |
124 |
117 cout << "merged graph" << endl; |
125 cout << "merged graph" << endl; |
118 printGraph(gw); |
126 printGraph(gw); |
119 |
127 |
120 typedef ListGraph Graph3; |
128 typedef ListGraph Graph3; |
|
129 //typedef SmartGraph Graph3; |
121 Graph3 g3; |
130 Graph3 g3; |
122 GW::NodeMap<Graph3::Node> gwn(gw); |
131 GW::NodeMap<Graph3::Node> gwn(gw); |
123 Graph3::NodeMap<GW::Node> g3n(g3); |
132 Graph3::NodeMap<GW::Node> g3n(g3); |
124 for (GW::NodeIt n(gw); n!=INVALID; ++n) { |
133 for (GW::NodeIt n(gw); n!=INVALID; ++n) { |
125 Graph3::Node m=g3.addNode(); |
134 Graph3::Node m=g3.addNode(); |