1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/lemon/bits/erasable_graph_extender.h	Mon May 23 04:48:14 2005 +0000
     1.3 @@ -0,0 +1,84 @@
     1.4 +// -*- c++ -*-
     1.5 +
     1.6 +#ifndef LEMON_ERASABLE_GRAPH_EXTENDER_H
     1.7 +#define LEMON_ERASABLE_GRAPH_EXTENDER_H
     1.8 +
     1.9 +#include <vector>
    1.10 +
    1.11 +#include <lemon/invalid.h>
    1.12 +
    1.13 +
    1.14 +namespace lemon {
    1.15 +
    1.16 +  template <typename _Base> 
    1.17 +  class ErasableGraphExtender : public _Base {
    1.18 +  public:
    1.19 +
    1.20 +    typedef ErasableGraphExtender Graph;
    1.21 +    typedef _Base Parent;
    1.22 +
    1.23 +    typedef typename Parent::Node Node;
    1.24 +    typedef typename Parent::Edge Edge;
    1.25 +
    1.26 +    void erase(const Node& node) {
    1.27 +      Edge edge;
    1.28 +      Parent::firstOut(edge, node);
    1.29 +      while (edge != INVALID ) {
    1.30 +	erase(edge);
    1.31 +	Parent::firstOut(edge, node);
    1.32 +      } 
    1.33 +
    1.34 +      Parent::firstIn(edge, node);
    1.35 +      while (edge != INVALID ) {
    1.36 +	erase(edge);
    1.37 +	Parent::firstIn(edge, node);
    1.38 +      }
    1.39 +
    1.40 +      Parent::getNotifier(Node()).erase(node);
    1.41 +      Parent::erase(node);
    1.42 +    }
    1.43 +    
    1.44 +    void erase(const Edge& edge) {
    1.45 +      Parent::getNotifier(Edge()).erase(edge);
    1.46 +      Parent::erase(edge);
    1.47 +    }
    1.48 +
    1.49 +  };
    1.50 +
    1.51 +  template <typename _Base> 
    1.52 +  class ErasableUndirGraphExtender : public _Base {
    1.53 +  public:
    1.54 +
    1.55 +    typedef ErasableUndirGraphExtender Graph;
    1.56 +    typedef _Base Parent;
    1.57 +
    1.58 +    typedef typename Parent::Node Node;
    1.59 +    typedef typename Parent::UndirEdge UndirEdge;
    1.60 +    typedef typename Parent::Edge Edge;
    1.61 +
    1.62 +    void erase(const Node& node) {
    1.63 +      Edge edge;
    1.64 +      Parent::firstOut(edge, node);
    1.65 +      while (edge != INVALID ) {
    1.66 +	erase(edge);
    1.67 +	Parent::firstOut(edge, node);
    1.68 +      } 
    1.69 +
    1.70 +      Parent::getNotifier(Node()).erase(node);
    1.71 +      Parent::erase(node);
    1.72 +    }
    1.73 +    
    1.74 +    void erase(const UndirEdge& uedge) {
    1.75 +      std::vector<Edge> edges;
    1.76 +      edges.push_back(Edge(uedge,true));
    1.77 +      edges.push_back(Edge(uedge,false));
    1.78 +      Parent::getNotifier(Edge()).erase(edges);
    1.79 +      Parent::getNotifier(UndirEdge()).erase(uedge);
    1.80 +      Parent::erase(uedge);
    1.81 +    }
    1.82 +
    1.83 +  };
    1.84 +
    1.85 +}
    1.86 +
    1.87 +#endif