1.1 --- a/lemon/preflow.h	Sun Oct 04 10:15:32 2009 +0200
     1.2 +++ b/lemon/preflow.h	Wed Dec 09 11:14:06 2009 +0100
     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 @@ -95,7 +102,8 @@
    1.32    ///
    1.33    /// This class provides an implementation of Goldberg-Tarjan's \e preflow
    1.34    /// \e push-relabel algorithm producing a \ref max_flow
    1.35 -  /// "flow of maximum value" in a digraph.
    1.36 +  /// "flow of maximum value" in a digraph \ref clrs01algorithms,
    1.37 +  /// \ref amo93networkflows, \ref goldberg88newapproach.
    1.38    /// The preflow algorithms are the fastest known maximum
    1.39    /// flow algorithms. The current implementation uses a mixture of the
    1.40    /// \e "highest label" and the \e "bound decrease" heuristics.
    1.41 @@ -257,7 +265,7 @@
    1.42      /// The Elevator should have standard constructor interface to be
    1.43      /// able to automatically created by the algorithm (i.e. the
    1.44      /// digraph and the maximum level should be passed to it).
    1.45 -    /// However an external elevator object could also be passed to the
    1.46 +    /// However, an external elevator object could also be passed to the
    1.47      /// algorithm with the \ref elevator(Elevator&) "elevator()" function
    1.48      /// before calling \ref run() or \ref init().
    1.49      /// \sa SetElevator
    1.50 @@ -391,8 +399,8 @@
    1.51      /// \name Execution Control
    1.52      /// The simplest way to execute the preflow algorithm is to use
    1.53      /// \ref run() or \ref runMinCut().\n
    1.54 -    /// If you need more control on the initial solution or the execution,
    1.55 -    /// first you have to call one of the \ref init() functions, then
    1.56 +    /// If you need better control on the initial solution or the execution,
    1.57 +    /// you have to call one of the \ref init() functions first, then
    1.58      /// \ref startFirstPhase() and if you need it \ref startSecondPhase().
    1.59  
    1.60      ///@{