1.1 --- a/lemon/connectivity.h	Fri Aug 09 11:07:27 2013 +0200
     1.2 +++ b/lemon/connectivity.h	Sun Aug 11 15:28:12 2013 +0200
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2009
     1.8 + * Copyright (C) 2003-2010
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -258,7 +258,7 @@
    1.13    ///
    1.14    /// \return \c true if the digraph is strongly connected.
    1.15    /// \note By definition, the empty digraph is strongly connected.
    1.16 -  /// 
    1.17 +  ///
    1.18    /// \see countStronglyConnectedComponents(), stronglyConnectedComponents()
    1.19    /// \see connected()
    1.20    template <typename Digraph>
    1.21 @@ -310,7 +310,7 @@
    1.22  
    1.23    /// \ingroup graph_properties
    1.24    ///
    1.25 -  /// \brief Count the number of strongly connected components of a 
    1.26 +  /// \brief Count the number of strongly connected components of a
    1.27    /// directed graph
    1.28    ///
    1.29    /// This function counts the number of strongly connected components of
    1.30 @@ -781,7 +781,7 @@
    1.31  
    1.32    /// \ingroup graph_properties
    1.33    ///
    1.34 -  /// \brief Count the number of bi-node-connected components of an 
    1.35 +  /// \brief Count the number of bi-node-connected components of an
    1.36    /// undirected graph.
    1.37    ///
    1.38    /// This function counts the number of bi-node-connected components of
    1.39 @@ -835,7 +835,7 @@
    1.40    /// \param graph The undirected graph.
    1.41    /// \retval compMap A writable edge map. The values will be set from 0
    1.42    /// to the number of the bi-node-connected components minus one. Each
    1.43 -  /// value of the map will be set exactly once, and the values of a 
    1.44 +  /// value of the map will be set exactly once, and the values of a
    1.45    /// certain component will be set continuously.
    1.46    /// \return The number of bi-node-connected components.
    1.47    ///
    1.48 @@ -881,7 +881,7 @@
    1.49    /// the components.
    1.50    ///
    1.51    /// \param graph The undirected graph.
    1.52 -  /// \retval cutMap A writable node map. The values will be set to 
    1.53 +  /// \retval cutMap A writable node map. The values will be set to
    1.54    /// \c true for the nodes that separate two or more components
    1.55    /// (exactly once for each cut node), and will not be changed for
    1.56    /// other nodes.
    1.57 @@ -1108,7 +1108,7 @@
    1.58    ///
    1.59    /// \brief Check whether an undirected graph is bi-edge-connected.
    1.60    ///
    1.61 -  /// This function checks whether the given undirected graph is 
    1.62 +  /// This function checks whether the given undirected graph is
    1.63    /// bi-edge-connected, i.e. any two nodes are connected with at least
    1.64    /// two edge-disjoint paths.
    1.65    ///
    1.66 @@ -1215,7 +1215,7 @@
    1.67    /// \brief Find the bi-edge-connected cut edges in an undirected graph.
    1.68    ///
    1.69    /// This function finds the bi-edge-connected cut edges in the given
    1.70 -  /// undirected graph. 
    1.71 +  /// undirected graph.
    1.72    ///
    1.73    /// The bi-edge-connected components are the classes of an equivalence
    1.74    /// relation on the nodes of an undirected graph. Two nodes are in the
    1.75 @@ -1372,7 +1372,7 @@
    1.76    ///
    1.77    /// \param digraph The digraph.
    1.78    /// \retval order A readable and writable node map. The values will be
    1.79 -  /// set from 0 to the number of the nodes in the digraph minus one. 
    1.80 +  /// set from 0 to the number of the nodes in the digraph minus one.
    1.81    /// Each value of the map will be set exactly once, and the values will
    1.82    /// be set descending order.
    1.83    /// \return \c false if the digraph is not DAG.