1.1 --- a/lemon/graph_utils.h	Thu Mar 01 16:50:12 2007 +0000
     1.2 +++ b/lemon/graph_utils.h	Thu Mar 01 17:14:24 2007 +0000
     1.3 @@ -1873,7 +1873,7 @@
     1.4      /// Constructor for descriptor map.
     1.5      explicit DescriptorMap(const Graph& _graph) : Map(_graph) {
     1.6        Item it;
     1.7 -      const typename Map::Notifier* notifier = Map::getNotifier(); 
     1.8 +      const typename Map::Notifier* notifier = Map::notifier(); 
     1.9        for (notifier->first(it); it != INVALID; notifier->next(it)) {
    1.10  	Map::set(it, invMap.size());
    1.11  	invMap.push_back(it);	
    1.12 @@ -1935,7 +1935,7 @@
    1.13      virtual void build() {
    1.14        Map::build();
    1.15        Item it;
    1.16 -      const typename Map::Notifier* notifier = Map::getNotifier(); 
    1.17 +      const typename Map::Notifier* notifier = Map::notifier(); 
    1.18        for (notifier->first(it); it != INVALID; notifier->next(it)) {
    1.19  	Map::set(it, invMap.size());
    1.20  	invMap.push_back(it);	
    1.21 @@ -2292,7 +2292,7 @@
    1.22      ///
    1.23      /// Constructor for creating in-degree map.
    1.24      explicit InDegMap(const Graph& _graph) : graph(_graph), deg(_graph) {
    1.25 -      Parent::attach(graph.getNotifier(typename _Graph::Edge()));
    1.26 +      Parent::attach(graph.notifier(typename _Graph::Edge()));
    1.27        
    1.28        for(typename _Graph::NodeIt it(graph); it != INVALID; ++it) {
    1.29  	deg[it] = countInEdges(graph, it);
    1.30 @@ -2404,7 +2404,7 @@
    1.31      ///
    1.32      /// Constructor for creating out-degree map.
    1.33      explicit OutDegMap(const Graph& _graph) : graph(_graph), deg(_graph) {
    1.34 -      Parent::attach(graph.getNotifier(typename _Graph::Edge()));
    1.35 +      Parent::attach(graph.notifier(typename _Graph::Edge()));
    1.36        
    1.37        for(typename _Graph::NodeIt it(graph); it != INVALID; ++it) {
    1.38  	deg[it] = countOutEdges(graph, it);