diff -r 104aab6e5d86 -r 9b6f8c3587f0 lemon/concept/graph.h
--- a/lemon/concept/graph.h	Fri Jun 10 12:11:50 2005 +0000
+++ b/lemon/concept/graph.h	Fri Jun 10 12:16:25 2005 +0000
@@ -211,11 +211,11 @@
         NodeIt(const StaticGraph&) { }
         /// Node -> NodeIt conversion.
 
-        /// Sets the iterator to the node of \c g pointed by the trivial 
-        /// iterator n.
+        /// Sets the iterator to the node of \c the graph pointed by 
+	/// the trivial iterator.
         /// This feature necessitates that each time we 
         /// iterate the edge-set, the iteration order is the same.
-        NodeIt(const StaticGraph& g, const Node& n) { }
+        NodeIt(const StaticGraph&, const Node&) { }
         /// Next node.
 
         /// Assign the iterator to the next node.
@@ -295,10 +295,10 @@
         OutEdgeIt(const StaticGraph&, const Node&) { }
         /// Edge -> OutEdgeIt conversion
 
-        /// Sets the iterator to the value of the trivial iterator \c e.
-        /// This feature necessitates that each time we 
+        /// Sets the iterator to the value of the trivial iterator.
+	/// This feature necessitates that each time we 
         /// iterate the edge-set, the iteration order is the same.
-        OutEdgeIt(const StaticGraph& g, const Edge& e) { }
+        OutEdgeIt(const StaticGraph&, const Edge&) { }
         ///Next outgoing edge
         
         /// Assign the iterator to the next