1.1 --- a/src/lemon/concept/undir_graph.h	Mon Apr 18 14:18:12 2005 +0000
     1.2 +++ b/src/lemon/concept/undir_graph.h	Mon Apr 18 14:59:24 2005 +0000
     1.3 @@ -46,7 +46,7 @@
     1.4        UndirGraphEdge() {}
     1.5  
     1.6        /// \e
     1.7 -      UndirGraphEdge(const UndirGraphEdge&) {}
     1.8 +      UndirGraphEdge(const UndirGraphEdge& e) : UndirGraph::UndirEdge(e) {}
     1.9  
    1.10        /// \e
    1.11        UndirGraphEdge(Invalid) {}
    1.12 @@ -469,13 +469,13 @@
    1.13        /// Base node of the iterator
    1.14        ///
    1.15        /// Returns the base node of the iterator
    1.16 -      Node baseNode(IncEdgeIt e) const {
    1.17 +      Node baseNode(IncEdgeIt) const {
    1.18  	return INVALID;
    1.19        }
    1.20        /// Running node of the iterator
    1.21        ///
    1.22        /// Returns the running node of the iterator
    1.23 -      Node runningNode(IncEdgeIt e) const {
    1.24 +      Node runningNode(IncEdgeIt) const {
    1.25  	return INVALID;
    1.26        }
    1.27