1.1 --- a/lemon/connectivity.h	Thu Aug 08 22:56:10 2013 +0200
     1.2 +++ b/lemon/connectivity.h	Fri Aug 09 11:07:27 2013 +0200
     1.3 @@ -749,7 +749,13 @@
     1.4    /// node.
     1.5    ///
     1.6    /// \return \c true if the graph bi-node-connected.
     1.7 -  /// \note By definition, the empty graph is bi-node-connected.
     1.8 +  ///
     1.9 +  /// \note By definition,
    1.10 +  /// \li a graph consisting of zero or one node is bi-node-connected,
    1.11 +  /// \li a graph consisting of two isolated nodes
    1.12 +  /// is \e not bi-node-connected and
    1.13 +  /// \li a graph consisting of two nodes connected by an edge
    1.14 +  /// is bi-node-connected.
    1.15    ///
    1.16    /// \see countBiNodeConnectedComponents(), biNodeConnectedComponents()
    1.17    template <typename Graph>