1.1 --- a/lemon/list_graph.h Thu Mar 05 10:13:20 2009 +0000
1.2 +++ b/lemon/list_graph.h Sun Mar 29 23:08:20 2009 +0200
1.3 @@ -351,14 +351,14 @@
1.4 ///Add a new node to the digraph.
1.5
1.6 ///Add a new node to the digraph.
1.7 - ///\return the new node.
1.8 + ///\return The new node.
1.9 Node addNode() { return Parent::addNode(); }
1.10
1.11 ///Add a new arc to the digraph.
1.12
1.13 ///Add a new arc to the digraph with source node \c s
1.14 ///and target node \c t.
1.15 - ///\return the new arc.
1.16 + ///\return The new arc.
1.17 Arc addArc(const Node& s, const Node& t) {
1.18 return Parent::addArc(s, t);
1.19 }
1.20 @@ -1208,14 +1208,14 @@
1.21 /// \brief Add a new node to the graph.
1.22 ///
1.23 /// Add a new node to the graph.
1.24 - /// \return the new node.
1.25 + /// \return The new node.
1.26 Node addNode() { return Parent::addNode(); }
1.27
1.28 /// \brief Add a new edge to the graph.
1.29 ///
1.30 /// Add a new edge to the graph with source node \c s
1.31 /// and target node \c t.
1.32 - /// \return the new edge.
1.33 + /// \return The new edge.
1.34 Edge addEdge(const Node& s, const Node& t) {
1.35 return Parent::addEdge(s, t);
1.36 }