diff -r d00b85f8be45 -r a490662291b9 src/lemon/concept/path.h
--- a/src/lemon/concept/path.h	Mon Apr 18 14:18:12 2005 +0000
+++ b/src/lemon/concept/path.h	Mon Apr 18 14:59:24 2005 +0000
@@ -54,7 +54,7 @@
 
       /// \param _G The graph in which the path is.
       ///
-      Path(const Graph &_G) {}
+      Path(const Graph &) {}
 
       /// Length of the path.
       int length() const {return 0;}
@@ -86,13 +86,13 @@
       ///
       /// Returns node iterator pointing to the target node of the
       /// given edge iterator.
-      NodeIt target(const EdgeIt& e) const {return INVALID;}
+      NodeIt target(const EdgeIt&) const {return INVALID;}
 
       /// \brief The source of an edge.
       ///
       /// Returns node iterator pointing to the source node of the
       /// given edge iterator.
-      NodeIt source(const EdgeIt& e) const {return INVALID;}
+      NodeIt source(const EdgeIt&) const {return INVALID;}
 
 
       /* Iterator classes */
@@ -112,7 +112,7 @@
 	/// Invalid constructor
 	EdgeIt(Invalid) {}
 	/// Constructor with starting point
-	EdgeIt(const Path &_p) {}
+	EdgeIt(const Path &) {}
 
 	operator GraphEdge () const {}
 
@@ -120,9 +120,9 @@
 	EdgeIt& operator++() {return *this;}
 
 	/// Comparison operator
-	bool operator==(const EdgeIt& e) const {return true;}
+	bool operator==(const EdgeIt&) const {return true;}
 	/// Comparison operator
-	bool operator!=(const EdgeIt& e) const {return true;}
+	bool operator!=(const EdgeIt&) const {return true;}
 // 	/// Comparison operator
 //      /// \todo It is not clear what is the "natural" ordering.
 // 	bool operator<(const EdgeIt& e) const {}
@@ -144,7 +144,7 @@
 	/// Invalid constructor
 	NodeIt(Invalid) {}
 	/// Constructor with starting point
-	NodeIt(const Path &_p) {}
+	NodeIt(const Path &) {}
 
 	///Conversion to Graph::Node
 	operator const GraphNode& () const {}
@@ -152,9 +152,9 @@
 	NodeIt& operator++() {return *this;}
 
 	/// Comparison operator
-	bool operator==(const NodeIt& e) const {return true;}
+	bool operator==(const NodeIt&) const {return true;}
 	/// Comparison operator
-	bool operator!=(const NodeIt& e) const {return true;}
+	bool operator!=(const NodeIt&) const {return true;}
 // 	/// Comparison operator
 //      /// \todo It is not clear what is the "natural" ordering.
 // 	bool operator<(const NodeIt& e) const {}
@@ -201,14 +201,14 @@
 	///Push a new edge to the front of the path.
 	///If the path is empty, you \em must call \ref setStartNode() before
 	///the first use of \ref pushFront().
-	void pushFront(const GraphEdge& e) {}
+	void pushFront(const GraphEdge&) {}
 
 	///Push a new edge to the back of the path
 
 	///Push a new edge to the back of the path.
 	///If the path is empty, you \em must call \ref setStartNode() before
 	///the first use of \ref pushBack().
-	void pushBack(const GraphEdge& e) {}
+	void pushBack(const GraphEdge&) {}
 
 	///Commit the changes to the path.
 	void commit() {}
@@ -218,13 +218,13 @@
 	///If you know a reasonable upper bound on the number of the edges
 	///to add to the front of the path,
 	///using this function you may speed up the building.
-	void reserveFront(size_t r) {}
+	void reserveFront(size_t) {}
 	///Reserve (back) storage for the builder in advance.
 
 	///If you know a reasonable upper bound on the number of the edges
 	///to add to the back of the path,
 	///using this function you may speed up the building.
-	void reserveBack(size_t r) {}
+	void reserveBack(size_t) {}
       };
     };