1.1 --- a/src/lemon/concept/graph_component.h	Mon Apr 18 14:18:12 2005 +0000
     1.2 +++ b/src/lemon/concept/graph_component.h	Mon Apr 18 14:59:24 2005 +0000
     1.3 @@ -304,7 +304,7 @@
     1.4        /// Gives back the node by the unique id.
     1.5        /// If the graph does not contain node with the given id
     1.6        /// then the result of the function is undetermined. 
     1.7 -      Node fromId(int id, Node) const { return INVALID;}
     1.8 +      Node fromId(int , Node) const { return INVALID;}
     1.9  
    1.10        /// \brief Gives back an unique integer id for the Edge. 
    1.11        ///
    1.12 @@ -317,7 +317,7 @@
    1.13        /// Gives back the edge by the unique id.
    1.14        /// If the graph does not contain edge with the given id
    1.15        /// then the result of the function is undetermined. 
    1.16 -      Edge fromId(int id, Edge) const { return INVALID;}
    1.17 +      Edge fromId(int, Edge) const { return INVALID;}
    1.18  
    1.19        template <typename _Graph>
    1.20        struct Constraints {
    1.21 @@ -398,7 +398,7 @@
    1.22  
    1.23        /// Adds a new Edge connects the two Nodes to the graph.
    1.24        ///
    1.25 -      Edge addEdge(const Node& from, const Node& to) {
    1.26 +      Edge addEdge(const Node&, const Node&) {
    1.27  	return INVALID;
    1.28        }
    1.29  
    1.30 @@ -745,7 +745,7 @@
    1.31        /// \brief Copy constructor.
    1.32        ///
    1.33        /// Copy Constructor.
    1.34 -      GraphMap(const GraphMap&) {}
    1.35 +      GraphMap(const GraphMap& gm) :ReadWriteMap<Item, _Value>(gm) {}
    1.36        
    1.37        /// \brief Assign operator.
    1.38        ///
    1.39 @@ -809,7 +809,7 @@
    1.40  	/// \brief Copy constructor.
    1.41  	///
    1.42  	/// Copy Constructor.
    1.43 -	NodeMap(const NodeMap&) {}
    1.44 +	NodeMap(const NodeMap& nm) : GraphMap<Graph, Node, _Value>(nm) {}
    1.45  
    1.46  	/// \brief Assign operator.
    1.47  	///
    1.48 @@ -839,7 +839,7 @@
    1.49  	/// \brief Copy constructor.
    1.50  	///
    1.51  	/// Copy Constructor.
    1.52 -	EdgeMap(const EdgeMap&) {}
    1.53 +	EdgeMap(const EdgeMap& em) :GraphMap<Graph, Edge, _Value>(em) {}
    1.54  
    1.55  	/// \brief Assign operator.
    1.56  	///
    1.57 @@ -917,7 +917,7 @@
    1.58        /// \brief Add an edge to the graph.
    1.59        ///
    1.60        /// Add an edge to the graph and notify the observers.
    1.61 -      Edge addEdge(const Node& from, const Node& to) {
    1.62 +      Edge addEdge(const Node&, const Node&) {
    1.63  	return INVALID;
    1.64        }
    1.65