equal
deleted
inserted
replaced
240 /// This ordering can be different from the iterating order of edges. |
240 /// This ordering can be different from the iterating order of edges. |
241 /// \todo Possibly we don't need it. |
241 /// \todo Possibly we don't need it. |
242 bool operator<(const Edge&) const { return true;} |
242 bool operator<(const Edge&) const { return true;} |
243 }; |
243 }; |
244 |
244 |
245 ///Gives back the head node of an edge. |
245 ///Gives back the target node of an edge. |
246 |
246 |
247 ///Gives back the head node of an edge. |
247 ///Gives back the target node of an edge. |
248 /// |
248 /// |
249 Node head(const Edge&) const { return INVALID;} |
249 Node target(const Edge&) const { return INVALID;} |
250 |
250 |
251 ///Gives back the tail node of an edge. |
251 ///Gives back the source node of an edge. |
252 |
252 |
253 ///Gives back the tail node of an edge. |
253 ///Gives back the source node of an edge. |
254 /// |
254 /// |
255 Node tail(const Edge&) const { return INVALID;} |
255 Node source(const Edge&) const { return INVALID;} |
256 }; |
256 }; |
257 |
257 |
258 |
258 |
259 /// Concept check structure for BaseGraph. |
259 /// Concept check structure for BaseGraph. |
260 |
260 |
270 function_requires< GraphItemConcept<Node> >(); |
270 function_requires< GraphItemConcept<Node> >(); |
271 function_requires< GraphItemConcept<Edge> >(); |
271 function_requires< GraphItemConcept<Edge> >(); |
272 { |
272 { |
273 Node n; |
273 Node n; |
274 Edge e; |
274 Edge e; |
275 n = graph.tail(e); |
275 n = graph.source(e); |
276 n = graph.head(e); |
276 n = graph.target(e); |
277 } |
277 } |
278 } |
278 } |
279 |
279 |
280 const Graph& graph; |
280 const Graph& graph; |
281 }; |
281 }; |