1.1 --- a/lemon/edge_set.h	Thu Nov 05 15:50:01 2009 +0100
     1.2 +++ b/lemon/edge_set.h	Sun Nov 15 19:57:02 2009 +0100
     1.3 @@ -255,13 +255,14 @@
     1.4    /// that node can be removed from the underlying graph, in this case
     1.5    /// all arcs incident to the given node is erased from the arc set.
     1.6    ///
     1.7 +  /// This class fully conforms to the \ref concepts::Digraph
     1.8 +  /// "Digraph" concept.
     1.9 +  /// It provides only linear time counting for nodes and arcs.
    1.10 +  ///
    1.11    /// \param GR The type of the graph which shares its node set with
    1.12    /// this class. Its interface must conform to the
    1.13    /// \ref concepts::Digraph "Digraph" or \ref concepts::Graph "Graph"
    1.14    /// concept.
    1.15 -  ///
    1.16 -  /// This class fully conforms to the \ref concepts::Digraph
    1.17 -  /// "Digraph" concept.
    1.18    template <typename GR>
    1.19    class ListArcSet : public ArcSetExtender<ListArcSetBase<GR> > {
    1.20      typedef ArcSetExtender<ListArcSetBase<GR> > Parent;
    1.21 @@ -685,13 +686,14 @@
    1.22    /// be removed from the underlying graph, in this case all edges
    1.23    /// incident to the given node is erased from the arc set.
    1.24    ///
    1.25 +  /// This class fully conforms to the \ref concepts::Graph "Graph"
    1.26 +  /// concept.
    1.27 +  /// It provides only linear time counting for nodes, edges and arcs.
    1.28 +  ///
    1.29    /// \param GR The type of the graph which shares its node set
    1.30    /// with this class. Its interface must conform to the
    1.31    /// \ref concepts::Digraph "Digraph" or \ref concepts::Graph "Graph"
    1.32    /// concept.
    1.33 -  ///
    1.34 -  /// This class fully conforms to the \ref concepts::Graph "Graph"
    1.35 -  /// concept.
    1.36    template <typename GR>
    1.37    class ListEdgeSet : public EdgeSetExtender<ListEdgeSetBase<GR> > {
    1.38      typedef EdgeSetExtender<ListEdgeSetBase<GR> > Parent;
    1.39 @@ -954,13 +956,14 @@
    1.40    /// single-linked lists for enumerate outgoing and incoming
    1.41    /// arcs. Therefore the arcs cannot be erased from the arc sets.
    1.42    ///
    1.43 +  /// This class fully conforms to the \ref concepts::Digraph "Digraph"
    1.44 +  /// concept.
    1.45 +  /// It provides only linear time counting for nodes and arcs.
    1.46 +  ///
    1.47    /// \warning If a node is erased from the underlying graph and this
    1.48    /// node is the source or target of one arc in the arc set, then
    1.49    /// the arc set is invalidated, and it cannot be used anymore. The
    1.50    /// validity can be checked with the \c valid() member function.
    1.51 -  ///
    1.52 -  /// This class fully conforms to the \ref concepts::Digraph
    1.53 -  /// "Digraph" concept.
    1.54    template <typename GR>
    1.55    class SmartArcSet : public ArcSetExtender<SmartArcSetBase<GR> > {
    1.56      typedef ArcSetExtender<SmartArcSetBase<GR> > Parent;
    1.57 @@ -1304,13 +1307,14 @@
    1.58    /// single-linked lists for enumerate incident edges. Therefore the
    1.59    /// edges cannot be erased from the edge sets.
    1.60    ///
    1.61 +  /// This class fully conforms to the \ref concepts::Graph "Graph"
    1.62 +  /// concept.
    1.63 +  /// It provides only linear time counting for nodes, edges and arcs.
    1.64 +  ///
    1.65    /// \warning If a node is erased from the underlying graph and this
    1.66    /// node is incident to one edge in the edge set, then the edge set
    1.67    /// is invalidated, and it cannot be used anymore. The validity can
    1.68    /// be checked with the \c valid() member function.
    1.69 -  ///
    1.70 -  /// This class fully conforms to the \ref concepts::Graph
    1.71 -  /// "Graph" concept.
    1.72    template <typename GR>
    1.73    class SmartEdgeSet : public EdgeSetExtender<SmartEdgeSetBase<GR> > {
    1.74      typedef EdgeSetExtender<SmartEdgeSetBase<GR> > Parent;