equal
deleted
inserted
replaced
29 |
29 |
30 namespace lemon { |
30 namespace lemon { |
31 namespace concept { |
31 namespace concept { |
32 |
32 |
33 |
33 |
34 /// \addtogroup graph_concepts |
|
35 /// @{ |
|
36 |
|
37 /**************** The full-featured graph concepts ****************/ |
34 /**************** The full-featured graph concepts ****************/ |
38 |
35 |
39 |
36 |
40 /// \brief Modular static graph class. |
37 /// \brief Modular static graph class. |
41 /// |
38 /// |
98 checkConcept<_ExtendableGraph, _Graph >(); |
95 checkConcept<_ExtendableGraph, _Graph >(); |
99 checkConcept<ErasableGraphComponent, _Graph >(); |
96 checkConcept<ErasableGraphComponent, _Graph >(); |
100 } |
97 } |
101 }; |
98 }; |
102 }; |
99 }; |
|
100 |
|
101 /// \addtogroup graph_concepts |
|
102 /// @{ |
103 |
103 |
104 /// An empty static graph class. |
104 /// An empty static graph class. |
105 |
105 |
106 /// This class provides all the common features of a graph structure, |
106 /// This class provides all the common features of a graph structure, |
107 /// however completely without implementations and real data structures |
107 /// however completely without implementations and real data structures |
250 /// Two iterators are equal if and only if they point to the |
250 /// Two iterators are equal if and only if they point to the |
251 /// same object or both are invalid. |
251 /// same object or both are invalid. |
252 bool operator==(Edge) const { return true; } |
252 bool operator==(Edge) const { return true; } |
253 /// Inequality operator |
253 /// Inequality operator |
254 |
254 |
255 /// \sa operator==(Node n) |
255 /// \sa operator==(Edge n) |
256 /// |
256 /// |
257 bool operator!=(Edge) const { return true; } |
257 bool operator!=(Edge) const { return true; } |
258 }; |
258 }; |
259 |
259 |
260 /// This iterator goes trough the outgoing edges of a node. |
260 /// This iterator goes trough the outgoing edges of a node. |