lemon/capacity_scaling.h
changeset 844 a6eb9698c321
parent 830 75c97c3786d6
parent 825 75e6020b19b1
child 840 2914b6f0fde0
equal deleted inserted replaced
9:75edaad91bde 10:fdd9b3f7adaf
    75   /// executed using the \ref run() function. If some parameters are not
    75   /// executed using the \ref run() function. If some parameters are not
    76   /// specified, then default values will be used.
    76   /// specified, then default values will be used.
    77   ///
    77   ///
    78   /// \tparam GR The digraph type the algorithm runs on.
    78   /// \tparam GR The digraph type the algorithm runs on.
    79   /// \tparam V The number type used for flow amounts, capacity bounds
    79   /// \tparam V The number type used for flow amounts, capacity bounds
    80   /// and supply values in the algorithm. By default it is \c int.
    80   /// and supply values in the algorithm. By default, it is \c int.
    81   /// \tparam C The number type used for costs and potentials in the
    81   /// \tparam C The number type used for costs and potentials in the
    82   /// algorithm. By default it is the same as \c V.
    82   /// algorithm. By default, it is the same as \c V.
       
    83   /// \tparam TR The traits class that defines various types used by the
       
    84   /// algorithm. By default, it is \ref CapacityScalingDefaultTraits
       
    85   /// "CapacityScalingDefaultTraits<GR, V, C>".
       
    86   /// In most cases, this parameter should not be set directly,
       
    87   /// consider to use the named template parameters instead.
    83   ///
    88   ///
    84   /// \warning Both number types must be signed and all input data must
    89   /// \warning Both number types must be signed and all input data must
    85   /// be integer.
    90   /// be integer.
    86   /// \warning This algorithm does not support negative costs for such
    91   /// \warning This algorithm does not support negative costs for such
    87   /// arcs that have infinite upper bound.
    92   /// arcs that have infinite upper bound.