1.1 --- a/src/lemon/max_matching.h	Thu Feb 24 17:42:11 2005 +0000
     1.2 +++ b/src/lemon/max_matching.h	Thu Feb 24 17:48:25 2005 +0000
     1.3 @@ -59,6 +59,7 @@
     1.4  
     1.5      typedef typename Graph::Node Node;
     1.6      typedef typename Graph::Edge Edge;
     1.7 +    typedef typename Graph::UndirEdge UndirEdge;
     1.8      typedef typename Graph::UndirEdgeIt UndirEdgeIt;
     1.9      typedef typename Graph::NodeIt NodeIt;
    1.10      typedef typename Graph::IncEdgeIt IncEdgeIt;
    1.11 @@ -165,7 +166,7 @@
    1.12      template<typename NMapE>
    1.13      void readNMapEdge(NMapE& map) {
    1.14       for(NodeIt v(g); v!=INVALID; ++v) {
    1.15 -	UndirEdge e=map[v];
    1.16 +       UndirEdge e=map[v];
    1.17  	if ( e!=INVALID )
    1.18  	  _mate.set(v,g.oppositeNode(v,e));
    1.19        }