1.1 --- a/lemon/smart_graph.h	Fri Oct 14 10:40:00 2005 +0000
     1.2 +++ b/lemon/smart_graph.h	Fri Oct 14 10:44:49 2005 +0000
     1.3 @@ -75,7 +75,8 @@
     1.4    public:
     1.5  
     1.6      SmartGraphBase() : nodes(), edges() { }
     1.7 -    SmartGraphBase(const SmartGraphBase &_g) : nodes(_g.nodes), edges(_g.edges) { }
     1.8 +    SmartGraphBase(const SmartGraphBase &_g) 
     1.9 +      : nodes(_g.nodes), edges(_g.edges) { }
    1.10      
    1.11      typedef True NodeNumTag;
    1.12      typedef True EdgeNumTag;
    1.13 @@ -314,7 +315,14 @@
    1.14      ///\todo It could be implemented in a bit faster way.
    1.15      Node split(Node n, bool connect = true) 
    1.16      {
    1.17 -      return _split(n,connect);
    1.18 +      for (OutEdgeIt it(*this, n); it != INVALID; ++it) {
    1.19 +	getNotifier(Edge()).signalChange(it);
    1.20 +      }
    1.21 +      Node b = _split(n,connect);
    1.22 +      for (OutEdgeIt it(*this, b); it != INVALID; ++it) {
    1.23 +	getNotifier(Edge()).commitChange(it);
    1.24 +      }
    1.25 +      return b;
    1.26      }
    1.27    
    1.28