COIN-OR::LEMON - Graph Library

Changeset 584:33c6b6e755cd in lemon-1.2 for lemon/min_cost_arborescence.h


Ignore:
Timestamp:
04/15/09 02:04:37 (11 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Small doc improvements (#263)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/min_cost_arborescence.h

    r581 r584  
    9191  /// \ingroup spantree
    9292  ///
    93   /// \brief %MinCostArborescence algorithm class.
     93  /// \brief Minimum Cost Arborescence algorithm class.
    9494  ///
    9595  /// This class provides an efficient implementation of
    96   /// %MinCostArborescence algorithm. The arborescence is a tree
     96  /// Minimum Cost Arborescence algorithm. The arborescence is a tree
    9797  /// which is directed from a given source node of the digraph. One or
    9898  /// more sources should be given for the algorithm and it will calculate
     
    391391  public:
    392392
    393     /// \name Named template parameters
     393    /// \name Named Template Parameters
    394394
    395395    /// @{
     
    631631    /// @}
    632632
    633     /// \name Execution control
     633    /// \name Execution Control
    634634    /// The simplest way to execute the algorithm is to use
    635635    /// one of the member functions called \c run(...). \n
Note: See TracChangeset for help on using the changeset viewer.