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