1.1 --- a/lemon/min_cost_arborescence.h	Wed Apr 15 07:05:32 2009 +0100
     1.2 +++ b/lemon/min_cost_arborescence.h	Wed Apr 15 07:07:25 2009 +0100
     1.3 @@ -90,10 +90,10 @@
     1.4  
     1.5    /// \ingroup spantree
     1.6    ///
     1.7 -  /// \brief %MinCostArborescence algorithm class.
     1.8 +  /// \brief Minimum Cost Arborescence algorithm class.
     1.9    ///
    1.10    /// This class provides an efficient implementation of
    1.11 -  /// %MinCostArborescence algorithm. The arborescence is a tree
    1.12 +  /// Minimum Cost Arborescence algorithm. The arborescence is a tree
    1.13    /// which is directed from a given source node of the digraph. One or
    1.14    /// more sources should be given for the algorithm and it will calculate
    1.15    /// the minimum cost subgraph which are union of arborescences with the
    1.16 @@ -390,7 +390,7 @@
    1.17  
    1.18    public:
    1.19  
    1.20 -    /// \name Named template parameters
    1.21 +    /// \name Named Template Parameters
    1.22  
    1.23      /// @{
    1.24  
    1.25 @@ -630,7 +630,7 @@
    1.26  
    1.27      /// @}
    1.28  
    1.29 -    /// \name Execution control
    1.30 +    /// \name Execution Control
    1.31      /// The simplest way to execute the algorithm is to use
    1.32      /// one of the member functions called \c run(...). \n
    1.33      /// If you need more control on the execution,