1.1 --- a/lemon/topology.h	Wed Nov 28 18:05:49 2007 +0000
     1.2 +++ b/lemon/topology.h	Fri Nov 30 09:22:38 2007 +0000
     1.3 @@ -715,7 +715,6 @@
     1.4    ///
     1.5    /// \param graph The graph.
     1.6    /// \return %True when the graph bi-node-connected.
     1.7 -  /// \todo Make it faster.
     1.8    template <typename UGraph>
     1.9    bool biNodeConnected(const UGraph& graph) {
    1.10      return countBiNodeConnectedComponents(graph) == 1;
    1.11 @@ -1042,7 +1041,6 @@
    1.12    ///
    1.13    /// \param graph The undirected graph.
    1.14    /// \return The number of components.
    1.15 -  /// \todo Make it faster.
    1.16    template <typename UGraph>
    1.17    bool biEdgeConnected(const UGraph& graph) { 
    1.18      return countBiEdgeConnectedComponents(graph) == 1;