equal
deleted
inserted
replaced
20 namespace hugo { |
20 namespace hugo { |
21 |
21 |
22 // @defgroup empty_graph The LedaGraphWrapper class |
22 // @defgroup empty_graph The LedaGraphWrapper class |
23 // @{ |
23 // @{ |
24 |
24 |
25 /// An empty graph class. |
25 /// A graph wrapperstructure for wrapping LEDA graphs in HUGO. |
26 |
26 |
|
27 /// This graph wrapper class wraps LEDA graph and LEDA parametrized graph |
|
28 /// and then the generic algorithms and wrappers of HUGO can be used |
|
29 /// with LEDA graphs. |
27 /// This class provides all the common features of a grapf structure, |
30 /// This class provides all the common features of a grapf structure, |
28 /// however completely without implementations or real data structures |
31 /// however completely without implementations or real data structures |
29 /// behind the interface. |
32 /// behind the interface. |
30 /// All graph algorithms should compile with this class, but it will not |
33 /// All graph algorithms should compile with this class, but it will not |
31 /// run properly, of course. |
34 /// run properly, of course. |
192 EdgeIt &next(EdgeIt &i) const { |
195 EdgeIt &next(EdgeIt &i) const { |
193 i._e=_graph->succ_edge(i._e); |
196 i._e=_graph->succ_edge(i._e); |
194 return i; |
197 return i; |
195 } |
198 } |
196 |
199 |
197 template< typename It > |
200 // template< typename It > |
198 It first() const { |
201 // It first() const { |
199 It e; |
202 // It e; |
200 first(e); |
203 // first(e); |
201 return e; |
204 // return e; |
202 } |
205 // } |
203 |
206 |
204 template< typename It > |
207 // template< typename It > |
205 It first(Node v) const { |
208 // It first(Node v) const { |
206 It e; |
209 // It e; |
207 first(e, v); |
210 // first(e, v); |
208 return e; |
211 // return e; |
209 } |
212 // } |
210 |
213 |
211 ///Gives back the head node of an edge. |
214 ///Gives back the head node of an edge. |
212 Node head(Edge e) const { |
215 Node head(Edge e) const { |
213 return Node(_graph->target(e._e)); |
216 return Node(_graph->target(e._e)); |
214 } |
217 } |