1.1 --- a/lemon/graph_utils.h	Wed Nov 16 13:39:29 2005 +0000
     1.2 +++ b/lemon/graph_utils.h	Wed Nov 16 14:46:22 2005 +0000
     1.3 @@ -60,12 +60,12 @@
     1.4      typedef Graph::   EdgeIt    EdgeIt;			\
     1.5      typedef Graph:: InEdgeIt  InEdgeIt;			\
     1.6      typedef Graph::OutEdgeIt OutEdgeIt;			\
     1.7 -    typedef Graph::Nodemap<bool> BoolNodeMap;		\
     1.8 -    typedef Graph::Nodemap<int> IntNodeMap;		\
     1.9 -    typedef Graph::Nodemap<double> DoubleNodeMap;	\
    1.10 -    typedef Graph::Edgemap<bool> BoolEdgeMap;		\
    1.11 -    typedef Graph::Edgemap<int> IntEdgeMap;		\
    1.12 -    typedef Graph::Edgemap<double> DoubleEdgeMap;
    1.13 +    typedef Graph::NodeMap<bool> BoolNodeMap;		\
    1.14 +    typedef Graph::NodeMap<int> IntNodeMap;		\
    1.15 +    typedef Graph::NodeMap<double> DoubleNodeMap;	\
    1.16 +    typedef Graph::EdgeMap<bool> BoolEdgeMap;		\
    1.17 +    typedef Graph::EdgeMap<int> IntEdgeMap;		\
    1.18 +    typedef Graph::EdgeMap<double> DoubleEdgeMap;
    1.19    
    1.20    ///Creates convenience typedefs for the undirected graph types and iterators
    1.21  
    1.22 @@ -86,9 +86,9 @@
    1.23      typedef Graph:: UndirEdge   UndirEdge;			\
    1.24      typedef Graph:: UndirEdgeIt UndirEdgeIt;			\
    1.25      typedef Graph:: IncEdgeIt   IncEdgeIt;			\
    1.26 -    typedef Graph::UndirEdgemap<bool> BoolUndirEdgeMap;		\
    1.27 -    typedef Graph::UndirEdgemap<int> IntUndirEdgeMap;		\
    1.28 -    typedef Graph::UndirEdgemap<double> DoubleUndirEdgeMap;
    1.29 +    typedef Graph::UndirEdgeMap<bool> BoolUndirEdgeMap;		\
    1.30 +    typedef Graph::UndirEdgeMap<int> IntUndirEdgeMap;		\
    1.31 +    typedef Graph::UndirEdgeMap<double> DoubleUndirEdgeMap;
    1.32    
    1.33  
    1.34