diff -r d00b85f8be45 -r a490662291b9 src/lemon/concept/graph.h
--- a/src/lemon/concept/graph.h	Mon Apr 18 14:18:12 2005 +0000
+++ b/src/lemon/concept/graph.h	Mon Apr 18 14:59:24 2005 +0000
@@ -185,7 +185,7 @@
 	
 	/// Copy constructor.
 	///
-	NodeIt(const NodeIt&) { }
+	NodeIt(const NodeIt& n) : Node(n) { }
 	/// Invalid constructor \& conversion.
 
 	/// Initialize the iterator to be invalid.
@@ -195,7 +195,7 @@
 
 	/// Sets the iterator to the first node of \c g.
 	///
-	NodeIt(const StaticGraph& g) { }
+	NodeIt(const StaticGraph&) { }
 	/// Node -> NodeIt conversion.
 
 	/// Sets the iterator to the node of \c g pointed by the trivial 
@@ -267,7 +267,7 @@
 
 	/// Copy constructor.
 	///
-	OutEdgeIt(const OutEdgeIt&) { }
+	OutEdgeIt(const OutEdgeIt& e) : Edge(e) { }
 	/// Initialize the iterator to be invalid.
 
 	/// Initialize the iterator to be invalid.
@@ -279,7 +279,7 @@
 	/// node
 	///@param n the node
 	///@param g the graph
-	OutEdgeIt(const StaticGraph& g, const Node& n) { }
+	OutEdgeIt(const StaticGraph&, const Node&) { }
 	/// Edge -> OutEdgeIt conversion
 
 	/// Sets the iterator to the value of the trivial iterator \c e.
@@ -316,7 +316,7 @@
 
 	/// Copy constructor.
 	///
-	InEdgeIt(const InEdgeIt&) { }
+	InEdgeIt(const InEdgeIt& e) : Edge(e) { }
 	/// Initialize the iterator to be invalid.
 
 	/// Initialize the iterator to be invalid.
@@ -328,13 +328,13 @@
 	/// node
 	///@param n the node
 	///@param g the graph
-	InEdgeIt(const StaticGraph& g, const Node& n) { }
+	InEdgeIt(const StaticGraph&, const Node&) { }
 	/// Edge -> InEdgeIt conversion
 
 	/// Sets the iterator to the value of the trivial iterator \c e.
 	/// This feature necessitates that each time we 
 	/// iterate the edge-set, the iteration order is the same.
-	InEdgeIt(const StaticGraph& g, const Edge& n) { }
+	InEdgeIt(const StaticGraph&, const Edge&) { }
 	/// Next incoming edge
 
 	/// Assign the iterator to the next inedge of the corresponding node.
@@ -361,7 +361,7 @@
 
 	/// Copy constructor.
 	///
-	EdgeIt(const EdgeIt&) { }
+	EdgeIt(const EdgeIt& e) : Edge(e) { }
 	/// Initialize the iterator to be invalid.
 
 	/// Initialize the iterator to be invalid.
@@ -372,7 +372,7 @@
 	/// This constructor set the iterator to the first edge of
 	/// node
 	///@param g the graph
-	EdgeIt(const StaticGraph& g) { }
+	EdgeIt(const StaticGraph&) { }
 	/// Edge -> EdgeIt conversion
 
 	/// Sets the iterator to the value of the trivial iterator \c e.
@@ -413,7 +413,7 @@
 	NodeMap(const StaticGraph&, T) { }
 
 	///Copy constructor
-	NodeMap(const NodeMap&) { }
+	NodeMap(const NodeMap& nm) : ReadWriteMap< Node, T >(nm) { }
 	///Assignment operator
 	NodeMap& operator=(const NodeMap&) { return *this; }
 	// \todo fix this concept
@@ -436,7 +436,7 @@
 	///\e
 	EdgeMap(const StaticGraph&, T) { }
 	///Copy constructor
-	EdgeMap(const EdgeMap&) { }
+	EdgeMap(const EdgeMap& em) : ReadWriteMap<Edge,T>(em) { }
 	///Assignment operator
 	EdgeMap& operator=(const EdgeMap&) { return *this; }
 	// \todo fix this concept    
@@ -470,7 +470,7 @@
       ///Add a new edge to the graph with source node \c s
       ///and target node \c t.
       ///\return the new edge.
-      Edge addEdge(Node s, Node t) { return INVALID; }
+      Edge addEdge(Node, Node) { return INVALID; }
     
       /// Resets the graph.
 
@@ -500,12 +500,12 @@
 
       /// Deletes node \c n node.
       ///
-      void erase(Node n) { }
+      void erase(Node) { }
       /// Deletes an edge.
 
       /// Deletes edge \c e edge.
       ///
-      void erase(Edge e) { }
+      void erase(Edge) { }
 
       template <typename _Graph>
       struct Constraints : public _ErasableGraph::Constraints<_Graph> {};