1.1 --- a/lemon/circulation.h Sun Oct 04 10:15:32 2009 +0200
1.2 +++ b/lemon/circulation.h Wed Dec 09 11:14:06 2009 +0100
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 @@ -299,7 +306,7 @@
1.31 /// The Elevator should have standard constructor interface to be
1.32 /// able to automatically created by the algorithm (i.e. the
1.33 /// digraph and the maximum level should be passed to it).
1.34 - /// However an external elevator object could also be passed to the
1.35 + /// However, an external elevator object could also be passed to the
1.36 /// algorithm with the \ref elevator(Elevator&) "elevator()" function
1.37 /// before calling \ref run() or \ref init().
1.38 /// \sa SetElevator
1.39 @@ -469,8 +476,8 @@
1.40
1.41 /// \name Execution Control
1.42 /// The simplest way to execute the algorithm is to call \ref run().\n
1.43 - /// If you need more control on the initial solution or the execution,
1.44 - /// first you have to call one of the \ref init() functions, then
1.45 + /// If you need better control on the initial solution or the execution,
1.46 + /// you have to call one of the \ref init() functions first, then
1.47 /// the \ref start() function.
1.48
1.49 ///@{