1.1 --- a/lemon/circulation.h	Thu Jun 11 23:13:24 2009 +0200
     1.2 +++ b/lemon/circulation.h	Fri Jul 24 10:27:40 2009 +0200
     1.3 @@ -72,7 +72,11 @@
     1.4      /// The type of the map that stores the flow values.
     1.5      /// It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap"
     1.6      /// concept.
     1.7 +#ifdef DOXYGEN
     1.8 +    typedef GR::ArcMap<Value> FlowMap;
     1.9 +#else
    1.10      typedef typename Digraph::template ArcMap<Value> FlowMap;
    1.11 +#endif
    1.12  
    1.13      /// \brief Instantiates a FlowMap.
    1.14      ///
    1.15 @@ -87,9 +91,12 @@
    1.16      ///
    1.17      /// The elevator type used by the algorithm.
    1.18      ///
    1.19 -    /// \sa Elevator
    1.20 -    /// \sa LinkedElevator
    1.21 +    /// \sa Elevator, LinkedElevator
    1.22 +#ifdef DOXYGEN
    1.23 +    typedef lemon::Elevator<GR, GR::Node> Elevator;
    1.24 +#else
    1.25      typedef lemon::Elevator<Digraph, typename Digraph::Node> Elevator;
    1.26 +#endif
    1.27  
    1.28      /// \brief Instantiates an Elevator.
    1.29      ///
    1.30 @@ -467,8 +474,8 @@
    1.31  
    1.32      /// \name Execution Control
    1.33      /// The simplest way to execute the algorithm is to call \ref run().\n
    1.34 -    /// If you need more control on the initial solution or the execution,
    1.35 -    /// first you have to call one of the \ref init() functions, then
    1.36 +    /// If you need better control on the initial solution or the execution,
    1.37 +    /// you have to call one of the \ref init() functions first, then
    1.38      /// the \ref start() function.
    1.39  
    1.40      ///@{