1.1 --- a/lemon/edge_set.h Thu Mar 05 10:13:20 2009 +0000
1.2 +++ b/lemon/edge_set.h Sun Mar 29 23:08:20 2009 +0200
1.3 @@ -255,7 +255,7 @@
1.4 /// \ref concepts::Digraph "Digraph" or \ref concepts::Graph "Graph"
1.5 /// concept.
1.6 ///
1.7 - /// This class is fully conform to the \ref concepts::Digraph
1.8 + /// This class fully conforms to the \ref concepts::Digraph
1.9 /// "Digraph" concept.
1.10 template <typename GR>
1.11 class ListArcSet : public ArcSetExtender<ListArcSetBase<GR> > {
1.12 @@ -336,7 +336,7 @@
1.13 ///
1.14 /// Add a new arc to the digraph with source node \c s
1.15 /// and target node \c t.
1.16 - /// \return the new arc.
1.17 + /// \return The new arc.
1.18 Arc addArc(const Node& s, const Node& t) {
1.19 return Parent::addArc(s, t);
1.20 }
1.21 @@ -684,7 +684,7 @@
1.22 /// \ref concepts::Digraph "Digraph" or \ref concepts::Graph "Graph"
1.23 /// concept.
1.24 ///
1.25 - /// This class is fully conform to the \ref concepts::Graph "Graph"
1.26 + /// This class fully conforms to the \ref concepts::Graph "Graph"
1.27 /// concept.
1.28 template <typename GR>
1.29 class ListEdgeSet : public EdgeSetExtender<ListEdgeSetBase<GR> > {
1.30 @@ -761,7 +761,7 @@
1.31 ///
1.32 /// Add a new edge to the graph with node \c u
1.33 /// and node \c v endpoints.
1.34 - /// \return the new edge.
1.35 + /// \return The new edge.
1.36 Edge addEdge(const Node& u, const Node& v) {
1.37 return Parent::addEdge(u, v);
1.38 }
1.39 @@ -952,7 +952,7 @@
1.40 /// the arc set is invalidated, and it cannot be used anymore. The
1.41 /// validity can be checked with the \c valid() member function.
1.42 ///
1.43 - /// This class is fully conform to the \ref concepts::Digraph
1.44 + /// This class fully conforms to the \ref concepts::Digraph
1.45 /// "Digraph" concept.
1.46 template <typename GR>
1.47 class SmartArcSet : public ArcSetExtender<SmartArcSetBase<GR> > {
1.48 @@ -1041,7 +1041,7 @@
1.49 ///
1.50 /// Add a new arc to the digraph with source node \c s
1.51 /// and target node \c t.
1.52 - /// \return the new arc.
1.53 + /// \return The new arc.
1.54 Arc addArc(const Node& s, const Node& t) {
1.55 return Parent::addArc(s, t);
1.56 }
1.57 @@ -1300,7 +1300,7 @@
1.58 /// is invalidated, and it cannot be used anymore. The validity can
1.59 /// be checked with the \c valid() member function.
1.60 ///
1.61 - /// This class is fully conform to the \ref concepts::Graph
1.62 + /// This class fully conforms to the \ref concepts::Graph
1.63 /// "Graph" concept.
1.64 template <typename GR>
1.65 class SmartEdgeSet : public EdgeSetExtender<SmartEdgeSetBase<GR> > {
1.66 @@ -1389,7 +1389,7 @@
1.67 ///
1.68 /// Add a new edge to the graph with node \c u
1.69 /// and node \c v endpoints.
1.70 - /// \return the new edge.
1.71 + /// \return The new edge.
1.72 Edge addEdge(const Node& u, const Node& v) {
1.73 return Parent::addEdge(u, v);
1.74 }