lemon/capacity_scaling.h
changeset 1057 6a8a688eacf6
parent 1049 7bf489cf624e
child 1071 879fcb781086
equal deleted inserted replaced
21:98a2a0f76c76 22:f6b3c11c1ab4
    64   /// \brief Implementation of the Capacity Scaling algorithm for
    64   /// \brief Implementation of the Capacity Scaling algorithm for
    65   /// finding a \ref min_cost_flow "minimum cost flow".
    65   /// finding a \ref min_cost_flow "minimum cost flow".
    66   ///
    66   ///
    67   /// \ref CapacityScaling implements the capacity scaling version
    67   /// \ref CapacityScaling implements the capacity scaling version
    68   /// of the successive shortest path algorithm for finding a
    68   /// of the successive shortest path algorithm for finding a
    69   /// \ref min_cost_flow "minimum cost flow" \ref amo93networkflows,
    69   /// \ref min_cost_flow "minimum cost flow" \cite amo93networkflows,
    70   /// \ref edmondskarp72theoretical. It is an efficient dual
    70   /// \cite edmondskarp72theoretical. It is an efficient dual
    71   /// solution method, which runs in polynomial time
    71   /// solution method, which runs in polynomial time
    72   /// \f$O(e\log U (n+e)\log n)\f$, where <i>U</i> denotes the maximum
    72   /// \f$O(e\log U (n+e)\log n)\f$, where <i>U</i> denotes the maximum
    73   /// of node supply and arc capacity values.
    73   /// of node supply and arc capacity values.
    74   ///
    74   ///
    75   /// This algorithm is typically slower than \ref CostScaling and
    75   /// This algorithm is typically slower than \ref CostScaling and