1.1 --- a/lemon/concept/undir_graph.h	Thu Aug 18 12:22:44 2005 +0000
     1.2 +++ b/lemon/concept/undir_graph.h	Thu Aug 18 13:33:49 2005 +0000
     1.3 @@ -557,7 +557,7 @@
     1.4      
     1.5          /// This constructor sets the iterator to the first edge of \c g.
     1.6          ///@param g the graph
     1.7 -        EdgeIt(const UndirGraph &g) { }
     1.8 +        EdgeIt(const UndirGraph &g) { ignore_unused_variable_warning(g); }
     1.9          /// Edge -> EdgeIt conversion
    1.10  
    1.11          /// Sets the iterator to the value of the trivial iterator \c e.
    1.12 @@ -605,7 +605,10 @@
    1.13          /// the node.
    1.14          ///@param n the node
    1.15          ///@param g the graph
    1.16 -        OutEdgeIt(const UndirGraph& n, const Node& g) { }
    1.17 +        OutEdgeIt(const UndirGraph& n, const Node& g) {
    1.18 +	  ignore_unused_variable_warning(n);
    1.19 +	  ignore_unused_variable_warning(g);
    1.20 +	}
    1.21          /// Edge -> OutEdgeIt conversion
    1.22  
    1.23          /// Sets the iterator to the value of the trivial iterator.
    1.24 @@ -654,7 +657,10 @@
    1.25          /// the node.
    1.26          ///@param n the node
    1.27          ///@param g the graph
    1.28 -        InEdgeIt(const UndirGraph& g, const Node& n) { }
    1.29 +        InEdgeIt(const UndirGraph& g, const Node& n) { 
    1.30 +	  ignore_unused_variable_warning(n);
    1.31 +	  ignore_unused_variable_warning(g);
    1.32 +	}
    1.33          /// Edge -> InEdgeIt conversion
    1.34  
    1.35          /// Sets the iterator to the value of the trivial iterator \c e.