1.1 --- a/lemon/network_simplex.h	Sat Jan 08 15:52:07 2011 +0100
     1.2 +++ b/lemon/network_simplex.h	Sun Jan 09 16:51:14 2011 +0100
     1.3 @@ -47,10 +47,10 @@
     1.4    /// linear programming simplex method directly for the minimum cost
     1.5    /// flow problem.
     1.6    ///
     1.7 -  /// In general, %NetworkSimplex is the fastest implementation available
     1.8 -  /// in LEMON for this problem.
     1.9 -  /// Moreover, it supports both directions of the supply/demand inequality
    1.10 -  /// constraints. For more information, see \ref SupplyType.
    1.11 +  /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest
    1.12 +  /// implementations available in LEMON for this problem.
    1.13 +  /// Furthermore, this class supports both directions of the supply/demand
    1.14 +  /// inequality constraints. For more information, see \ref SupplyType.
    1.15    ///
    1.16    /// Most of the parameters of the problem (except for the digraph)
    1.17    /// can be given using separate functions, and the algorithm can be
    1.18 @@ -125,7 +125,7 @@
    1.19      /// implementations that significantly affect the running time
    1.20      /// of the algorithm.
    1.21      /// By default, \ref BLOCK_SEARCH "Block Search" is used, which
    1.22 -    /// proved to be the most efficient and the most robust on various
    1.23 +    /// turend out to be the most efficient and the most robust on various
    1.24      /// test inputs.
    1.25      /// However, another pivot rule can be selected using the \ref run()
    1.26      /// function with the proper parameter.
    1.27 @@ -167,7 +167,7 @@
    1.28      typedef std::vector<Value> ValueVector;
    1.29      typedef std::vector<Cost> CostVector;
    1.30      typedef std::vector<signed char> CharVector;
    1.31 -    // Note: vector<signed char> is used instead of vector<ArcState> and 
    1.32 +    // Note: vector<signed char> is used instead of vector<ArcState> and
    1.33      // vector<ArcDirection> for efficiency reasons
    1.34  
    1.35      // State constants for arcs
    1.36 @@ -734,6 +734,8 @@
    1.37      /// of the algorithm.
    1.38      ///
    1.39      /// \return <tt>(*this)</tt>
    1.40 +    ///
    1.41 +    /// \sa supplyType()
    1.42      template<typename SupplyMap>
    1.43      NetworkSimplex& supplyMap(const SupplyMap& map) {
    1.44        for (NodeIt n(_graph); n != INVALID; ++n) {
    1.45 @@ -750,7 +752,7 @@
    1.46      /// calling \ref run(), the supply of each node will be set to zero.
    1.47      ///
    1.48      /// Using this function has the same effect as using \ref supplyMap()
    1.49 -    /// with such a map in which \c k is assigned to \c s, \c -k is
    1.50 +    /// with a map in which \c k is assigned to \c s, \c -k is
    1.51      /// assigned to \c t and all other nodes have zero supply value.
    1.52      ///
    1.53      /// \param s The source node.