362 void update() {} |
362 void update() {} |
363 void update(T a) {} //FIXME: Is it necessary |
363 void update(T a) {} //FIXME: Is it necessary |
364 }; |
364 }; |
365 }; |
365 }; |
366 |
366 |
367 /// An empty eraseable graph class. |
367 /// An empty erasable graph class. |
368 |
368 |
369 /// This class provides all the common features of an \e eraseable graph |
369 /// This class provides all the common features of an \e erasable graph |
370 /// structure, |
370 /// structure, |
371 /// however completely without implementations and real data structures |
371 /// however completely without implementations and real data structures |
372 /// behind the interface. |
372 /// behind the interface. |
373 /// All graph algorithms should compile with this class, but it will not |
373 /// All graph algorithms should compile with this class, but it will not |
374 /// run properly, of course. |
374 /// run properly, of course. |
382 /// Also, you will find here the full documentation of a certain graph |
382 /// Also, you will find here the full documentation of a certain graph |
383 /// feature, the documentation of a real graph imlementation |
383 /// feature, the documentation of a real graph imlementation |
384 /// like @ref ListGraph or |
384 /// like @ref ListGraph or |
385 /// @ref SmartGraph will just refer to this structure. |
385 /// @ref SmartGraph will just refer to this structure. |
386 template <typename P, typename Gact, typename Gsub> |
386 template <typename P, typename Gact, typename Gsub> |
387 class EraseableEdgePathGraph : public EdgePathGraph<P, Gact, Gsub> |
387 class ErasableEdgePathGraph : public EdgePathGraph<P, Gact, Gsub> |
388 { |
388 { |
389 public: |
389 public: |
390 /// Deletes a node. |
390 /// Deletes a node. |
391 void erase(typename Gact::Node n) {actuallayer.erase(n);} |
391 void erase(typename Gact::Node n) {actuallayer.erase(n);} |
392 /// Deletes an edge. |
392 /// Deletes an edge. |
393 void erase(typename Gact::Edge e) {actuallayer.erase(e);} |
393 void erase(typename Gact::Edge e) {actuallayer.erase(e);} |
394 |
394 |
395 /// Defalult constructor. |
395 /// Defalult constructor. |
396 EraseableEdgePathGraph() {} |
396 ErasableEdgePathGraph() {} |
397 ///Copy consructor. |
397 ///Copy consructor. |
398 EraseableEdgePathGraph(const EdgePathGraph<P, Gact, Gsub> &EPG) {} |
398 ErasableEdgePathGraph(const EdgePathGraph<P, Gact, Gsub> &EPG) {} |
399 }; |
399 }; |
400 |
400 |
401 |
401 |
402 // @} |
402 // @} |
403 |
403 |