1.1 --- a/lemon/smart_graph.h	Sun Nov 14 20:06:23 2010 +0100
     1.2 +++ b/lemon/smart_graph.h	Sun Nov 14 22:48:32 2010 +0100
     1.3 @@ -925,9 +925,6 @@
     1.4      Node redNode(Edge e) const { return Node(arcs[2 * e._id].target); }
     1.5      Node blueNode(Edge e) const { return Node(arcs[2 * e._id + 1].target); }
     1.6  
     1.7 -    Node u(Edge e) const { return redNode(e); }
     1.8 -    Node v(Edge e) const { return blueNode(e); }
     1.9 -
    1.10      static bool direction(Arc a) {
    1.11        return (a._id & 1) == 1;
    1.12      }
    1.13 @@ -1101,22 +1098,22 @@
    1.14  
    1.15    /// \ingroup graphs
    1.16    ///
    1.17 -  /// \brief A smart undirected graph class.
    1.18 +  /// \brief A smart undirected bipartite graph class.
    1.19    ///
    1.20 -  /// \ref SmartBpGraph is a simple and fast graph implementation.
    1.21 +  /// \ref SmartBpGraph is a simple and fast bipartite graph implementation.
    1.22    /// It is also quite memory efficient but at the price
    1.23    /// that it does not support node and edge deletion
    1.24    /// (except for the Snapshot feature).
    1.25    ///
    1.26 -  /// This type fully conforms to the \ref concepts::Graph "Graph concept"
    1.27 +  /// This type fully conforms to the \ref concepts::BpGraph "BpGraph concept"
    1.28    /// and it also provides some additional functionalities.
    1.29    /// Most of its member functions and nested classes are documented
    1.30    /// only in the concept class.
    1.31    ///
    1.32    /// This class provides constant time counting for nodes, edges and arcs.
    1.33    ///
    1.34 -  /// \sa concepts::Graph
    1.35 -  /// \sa SmartDigraph
    1.36 +  /// \sa concepts::BpGraph
    1.37 +  /// \sa SmartGraph
    1.38    class SmartBpGraph : public ExtendedSmartBpGraphBase {
    1.39      typedef ExtendedSmartBpGraphBase Parent;
    1.40