equal
deleted
inserted
replaced
397 Node aNode(const InEdgeIt&) const { return Node(); } |
397 Node aNode(const InEdgeIt&) const { return Node(); } |
398 Node bNode(const InEdgeIt&) const { return Node(); } |
398 Node bNode(const InEdgeIt&) const { return Node(); } |
399 }; |
399 }; |
400 |
400 |
401 |
401 |
402 /// \brief Node-eraseable graph concept. |
402 /// \brief Node-erasable graph concept. |
403 /// |
403 /// |
404 /// A graph class which provides a function to |
404 /// A graph class which provides a function to |
405 /// delete any of its nodes. |
405 /// delete any of its nodes. |
406 class NodeEraseableGraphConcept : virtual public GraphConcept |
406 class NodeErasableGraphConcept : virtual public GraphConcept |
407 { |
407 { |
408 public: |
408 public: |
409 /// Deletes a node. |
409 /// Deletes a node. |
410 void erase(const Node& n) { } |
410 void erase(const Node& n) { } |
411 }; |
411 }; |
412 |
412 |
413 |
413 |
414 /// \brief Edge-eraseable graph concept. |
414 /// \brief Edge-erasable graph concept. |
415 /// |
415 /// |
416 /// A graph class which provides a function to delete any |
416 /// A graph class which provides a function to delete any |
417 /// of its edges. |
417 /// of its edges. |
418 class EdgeEraseableGraphConcept : virtual public GraphConcept |
418 class EdgeErasableGraphConcept : virtual public GraphConcept |
419 { |
419 { |
420 public: |
420 public: |
421 /// Deletes a node. |
421 /// Deletes a node. |
422 void erase(const Edge& n) { } |
422 void erase(const Edge& n) { } |
423 }; |
423 }; |