1.1 --- a/lemon/bits/graph_extender.h	Tue Oct 31 14:27:58 2006 +0000
     1.2 +++ b/lemon/bits/graph_extender.h	Tue Oct 31 14:28:27 2006 +0000
     1.3 @@ -673,8 +673,10 @@
     1.4      UEdge addEdge(const Node& from, const Node& to) {
     1.5        UEdge uedge = Parent::addEdge(from, to);
     1.6        getNotifier(UEdge()).add(uedge);
     1.7 -      getNotifier(Edge()).add(Parent::direct(uedge, true));
     1.8 -      getNotifier(Edge()).add(Parent::direct(uedge, false));
     1.9 +      std::vector<Edge> edges;
    1.10 +      edges.push_back(Parent::direct(uedge, true));
    1.11 +      edges.push_back(Parent::direct(uedge, false));      
    1.12 +      getNotifier(Edge()).add(edges);
    1.13        return uedge;
    1.14      }
    1.15      
    1.16 @@ -704,8 +706,10 @@
    1.17      }
    1.18  
    1.19      void erase(const UEdge& uedge) {
    1.20 -      getNotifier(Edge()).erase(Parent::direct(uedge, true));
    1.21 -      getNotifier(Edge()).erase(Parent::direct(uedge, false));
    1.22 +      std::vector<Edge> edges;
    1.23 +      edges.push_back(Parent::direct(uedge, true));
    1.24 +      edges.push_back(Parent::direct(uedge, false));      
    1.25 +      getNotifier(Edge()).erase(edges);
    1.26        getNotifier(UEdge()).erase(uedge);
    1.27        Parent::erase(uedge);
    1.28      }