equal
deleted
inserted
replaced
121 /// similar associative container we require this. |
121 /// similar associative container we require this. |
122 /// |
122 /// |
123 /// \note This operator only have to define some strict ordering of |
123 /// \note This operator only have to define some strict ordering of |
124 /// the items; this order has nothing to do with the iteration |
124 /// the items; this order has nothing to do with the iteration |
125 /// ordering of the items. |
125 /// ordering of the items. |
126 /// |
|
127 /// \bug This is a technical requirement. Do we really need this? |
|
128 bool operator<(Node) const { return false; } |
126 bool operator<(Node) const { return false; } |
129 |
127 |
130 }; |
128 }; |
131 |
129 |
132 /// This iterator goes through each node. |
130 /// This iterator goes through each node. |
213 /// similar associative container we require this. |
211 /// similar associative container we require this. |
214 /// |
212 /// |
215 /// \note This operator only have to define some strict ordering of |
213 /// \note This operator only have to define some strict ordering of |
216 /// the items; this order has nothing to do with the iteration |
214 /// the items; this order has nothing to do with the iteration |
217 /// ordering of the items. |
215 /// ordering of the items. |
218 /// |
|
219 /// \bug This is a technical requirement. Do we really need this? |
|
220 bool operator<(Edge) const { return false; } |
216 bool operator<(Edge) const { return false; } |
221 }; |
217 }; |
222 |
218 |
223 /// This iterator goes trough the outgoing edges of a node. |
219 /// This iterator goes trough the outgoing edges of a node. |
224 |
220 |