1.1 --- a/lemon/preflow.h	Thu Jun 11 23:13:24 2009 +0200
     1.2 +++ b/lemon/preflow.h	Fri Jul 24 10:27:40 2009 +0200
     1.3 @@ -52,7 +52,11 @@
     1.4      ///
     1.5      /// The type of the map that stores the flow values.
     1.6      /// It must meet the \ref concepts::ReadWriteMap "ReadWriteMap" 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 @@ -67,9 +71,12 @@
    1.16      ///
    1.17      /// The elevator type used by Preflow algorithm.
    1.18      ///
    1.19 -    /// \sa Elevator
    1.20 -    /// \sa LinkedElevator
    1.21 -    typedef LinkedElevator<Digraph, typename Digraph::Node> Elevator;
    1.22 +    /// \sa Elevator, LinkedElevator
    1.23 +#ifdef DOXYGEN
    1.24 +    typedef lemon::Elevator<GR, GR::Node> Elevator;
    1.25 +#else
    1.26 +    typedef lemon::Elevator<Digraph, typename Digraph::Node> Elevator;
    1.27 +#endif
    1.28  
    1.29      /// \brief Instantiates an Elevator.
    1.30      ///
    1.31 @@ -389,8 +396,8 @@
    1.32      /// \name Execution Control
    1.33      /// The simplest way to execute the preflow algorithm is to use
    1.34      /// \ref run() or \ref runMinCut().\n
    1.35 -    /// If you need more control on the initial solution or the execution,
    1.36 -    /// first you have to call one of the \ref init() functions, then
    1.37 +    /// If you need better control on the initial solution or the execution,
    1.38 +    /// you have to call one of the \ref init() functions first, then
    1.39      /// \ref startFirstPhase() and if you need it \ref startSecondPhase().
    1.40  
    1.41      ///@{