equal
deleted
inserted
replaced
5 #include <invalid.h> |
5 #include <invalid.h> |
6 #include <iter_map.h> |
6 #include <iter_map.h> |
7 |
7 |
8 namespace hugo { |
8 namespace hugo { |
9 |
9 |
|
10 // Graph wrappers |
|
11 |
10 /// \addtogroup gwrappers |
12 /// \addtogroup gwrappers |
11 /// @{ |
|
12 |
|
13 /// Graph wrappers |
|
14 |
|
15 /// A main parts of HUGOlib are the different graph structures, |
13 /// A main parts of HUGOlib are the different graph structures, |
16 /// generic graph algorithms, graph concepts which couple these, and |
14 /// generic graph algorithms, graph concepts which couple these, and |
17 /// graph wrappers. While the previous ones are more or less clear, the |
15 /// graph wrappers. While the previous ones are more or less clear, the |
18 /// latter notion needs further explanation. |
16 /// latter notion needs further explanation. |
19 /// Graph wrappers are graph classes which serve for considering graph |
17 /// Graph wrappers are graph classes which serve for considering graph |
65 /// int algorithm1(const ListGraph& g) { |
63 /// int algorithm1(const ListGraph& g) { |
66 /// RevGraphWrapper<const ListGraph> rgw(g); |
64 /// RevGraphWrapper<const ListGraph> rgw(g); |
67 /// return algorithm2(rgw); |
65 /// return algorithm2(rgw); |
68 /// } |
66 /// } |
69 /// \endcode |
67 /// \endcode |
|
68 |
|
69 /// \addtogroup gwrappers |
|
70 /// @{ |
|
71 |
|
72 ///Base type for the Graph Wrappers |
|
73 |
|
74 ///This is the base type for the Graph Wrappers. |
|
75 ///\todo Some more docs... |
|
76 |
70 template<typename Graph> |
77 template<typename Graph> |
71 class GraphWrapper { |
78 class GraphWrapper { |
72 protected: |
79 protected: |
73 Graph* graph; |
80 Graph* graph; |
74 |
81 |