1.1 --- a/src/lemon/concept/graph.h Mon Apr 18 14:18:12 2005 +0000
1.2 +++ b/src/lemon/concept/graph.h Mon Apr 18 14:59:24 2005 +0000
1.3 @@ -185,7 +185,7 @@
1.4
1.5 /// Copy constructor.
1.6 ///
1.7 - NodeIt(const NodeIt&) { }
1.8 + NodeIt(const NodeIt& n) : Node(n) { }
1.9 /// Invalid constructor \& conversion.
1.10
1.11 /// Initialize the iterator to be invalid.
1.12 @@ -195,7 +195,7 @@
1.13
1.14 /// Sets the iterator to the first node of \c g.
1.15 ///
1.16 - NodeIt(const StaticGraph& g) { }
1.17 + NodeIt(const StaticGraph&) { }
1.18 /// Node -> NodeIt conversion.
1.19
1.20 /// Sets the iterator to the node of \c g pointed by the trivial
1.21 @@ -267,7 +267,7 @@
1.22
1.23 /// Copy constructor.
1.24 ///
1.25 - OutEdgeIt(const OutEdgeIt&) { }
1.26 + OutEdgeIt(const OutEdgeIt& e) : Edge(e) { }
1.27 /// Initialize the iterator to be invalid.
1.28
1.29 /// Initialize the iterator to be invalid.
1.30 @@ -279,7 +279,7 @@
1.31 /// node
1.32 ///@param n the node
1.33 ///@param g the graph
1.34 - OutEdgeIt(const StaticGraph& g, const Node& n) { }
1.35 + OutEdgeIt(const StaticGraph&, const Node&) { }
1.36 /// Edge -> OutEdgeIt conversion
1.37
1.38 /// Sets the iterator to the value of the trivial iterator \c e.
1.39 @@ -316,7 +316,7 @@
1.40
1.41 /// Copy constructor.
1.42 ///
1.43 - InEdgeIt(const InEdgeIt&) { }
1.44 + InEdgeIt(const InEdgeIt& e) : Edge(e) { }
1.45 /// Initialize the iterator to be invalid.
1.46
1.47 /// Initialize the iterator to be invalid.
1.48 @@ -328,13 +328,13 @@
1.49 /// node
1.50 ///@param n the node
1.51 ///@param g the graph
1.52 - InEdgeIt(const StaticGraph& g, const Node& n) { }
1.53 + InEdgeIt(const StaticGraph&, const Node&) { }
1.54 /// Edge -> InEdgeIt conversion
1.55
1.56 /// Sets the iterator to the value of the trivial iterator \c e.
1.57 /// This feature necessitates that each time we
1.58 /// iterate the edge-set, the iteration order is the same.
1.59 - InEdgeIt(const StaticGraph& g, const Edge& n) { }
1.60 + InEdgeIt(const StaticGraph&, const Edge&) { }
1.61 /// Next incoming edge
1.62
1.63 /// Assign the iterator to the next inedge of the corresponding node.
1.64 @@ -361,7 +361,7 @@
1.65
1.66 /// Copy constructor.
1.67 ///
1.68 - EdgeIt(const EdgeIt&) { }
1.69 + EdgeIt(const EdgeIt& e) : Edge(e) { }
1.70 /// Initialize the iterator to be invalid.
1.71
1.72 /// Initialize the iterator to be invalid.
1.73 @@ -372,7 +372,7 @@
1.74 /// This constructor set the iterator to the first edge of
1.75 /// node
1.76 ///@param g the graph
1.77 - EdgeIt(const StaticGraph& g) { }
1.78 + EdgeIt(const StaticGraph&) { }
1.79 /// Edge -> EdgeIt conversion
1.80
1.81 /// Sets the iterator to the value of the trivial iterator \c e.
1.82 @@ -413,7 +413,7 @@
1.83 NodeMap(const StaticGraph&, T) { }
1.84
1.85 ///Copy constructor
1.86 - NodeMap(const NodeMap&) { }
1.87 + NodeMap(const NodeMap& nm) : ReadWriteMap< Node, T >(nm) { }
1.88 ///Assignment operator
1.89 NodeMap& operator=(const NodeMap&) { return *this; }
1.90 // \todo fix this concept
1.91 @@ -436,7 +436,7 @@
1.92 ///\e
1.93 EdgeMap(const StaticGraph&, T) { }
1.94 ///Copy constructor
1.95 - EdgeMap(const EdgeMap&) { }
1.96 + EdgeMap(const EdgeMap& em) : ReadWriteMap<Edge,T>(em) { }
1.97 ///Assignment operator
1.98 EdgeMap& operator=(const EdgeMap&) { return *this; }
1.99 // \todo fix this concept
1.100 @@ -470,7 +470,7 @@
1.101 ///Add a new edge to the graph with source node \c s
1.102 ///and target node \c t.
1.103 ///\return the new edge.
1.104 - Edge addEdge(Node s, Node t) { return INVALID; }
1.105 + Edge addEdge(Node, Node) { return INVALID; }
1.106
1.107 /// Resets the graph.
1.108
1.109 @@ -500,12 +500,12 @@
1.110
1.111 /// Deletes node \c n node.
1.112 ///
1.113 - void erase(Node n) { }
1.114 + void erase(Node) { }
1.115 /// Deletes an edge.
1.116
1.117 /// Deletes edge \c e edge.
1.118 ///
1.119 - void erase(Edge e) { }
1.120 + void erase(Edge) { }
1.121
1.122 template <typename _Graph>
1.123 struct Constraints : public _ErasableGraph::Constraints<_Graph> {};