1.1 --- a/lemon/concept/graph.h Fri Jun 10 12:11:50 2005 +0000
1.2 +++ b/lemon/concept/graph.h Fri Jun 10 12:16:25 2005 +0000
1.3 @@ -211,11 +211,11 @@
1.4 NodeIt(const StaticGraph&) { }
1.5 /// Node -> NodeIt conversion.
1.6
1.7 - /// Sets the iterator to the node of \c g pointed by the trivial
1.8 - /// iterator n.
1.9 + /// Sets the iterator to the node of \c the graph pointed by
1.10 + /// the trivial iterator.
1.11 /// This feature necessitates that each time we
1.12 /// iterate the edge-set, the iteration order is the same.
1.13 - NodeIt(const StaticGraph& g, const Node& n) { }
1.14 + NodeIt(const StaticGraph&, const Node&) { }
1.15 /// Next node.
1.16
1.17 /// Assign the iterator to the next node.
1.18 @@ -295,10 +295,10 @@
1.19 OutEdgeIt(const StaticGraph&, const Node&) { }
1.20 /// Edge -> OutEdgeIt conversion
1.21
1.22 - /// Sets the iterator to the value of the trivial iterator \c e.
1.23 - /// This feature necessitates that each time we
1.24 + /// Sets the iterator to the value of the trivial iterator.
1.25 + /// This feature necessitates that each time we
1.26 /// iterate the edge-set, the iteration order is the same.
1.27 - OutEdgeIt(const StaticGraph& g, const Edge& e) { }
1.28 + OutEdgeIt(const StaticGraph&, const Edge&) { }
1.29 ///Next outgoing edge
1.30
1.31 /// Assign the iterator to the next