lemon/edmonds_karp.h
changeset 1079 5958cc5c0a98
parent 1061 473c71baff72
child 1092 dceba191c00d
equal deleted inserted replaced
5:0f8e5616faba 6:22cb54844c63
    78   ///
    78   ///
    79   /// \brief Edmonds-Karp algorithms class.
    79   /// \brief Edmonds-Karp algorithms class.
    80   ///
    80   ///
    81   /// This class provides an implementation of the \e Edmonds-Karp \e
    81   /// This class provides an implementation of the \e Edmonds-Karp \e
    82   /// algorithm producing a \ref max_flow "flow of maximum value" in a
    82   /// algorithm producing a \ref max_flow "flow of maximum value" in a
    83   /// digraph \ref clrs01algorithms, \ref amo93networkflows,
    83   /// digraph \cite clrs01algorithms, \cite amo93networkflows,
    84   /// \ref edmondskarp72theoretical.
    84   /// \cite edmondskarp72theoretical.
    85   /// The Edmonds-Karp algorithm is slower than the Preflow
    85   /// The Edmonds-Karp algorithm is slower than the Preflow
    86   /// algorithm, but it has an advantage of the step-by-step execution
    86   /// algorithm, but it has an advantage of the step-by-step execution
    87   /// control with feasible flow solutions. The \e source node, the \e
    87   /// control with feasible flow solutions. The \e source node, the \e
    88   /// target node, the \e capacity of the arcs and the \e starting \e
    88   /// target node, the \e capacity of the arcs and the \e starting \e
    89   /// flow value of the arcs should be passed to the algorithm
    89   /// flow value of the arcs should be passed to the algorithm
   110             typename TR = EdmondsKarpDefaultTraits<GR, CAP> >
   110             typename TR = EdmondsKarpDefaultTraits<GR, CAP> >
   111 #endif
   111 #endif
   112   class EdmondsKarp {
   112   class EdmondsKarp {
   113   public:
   113   public:
   114 
   114 
   115     /// The \ref EdmondsKarpDefaultTraits "traits class" of the algorithm.
   115     /// \brief The \ref lemon::EdmondsKarpDefaultTraits "traits class"
       
   116     /// of the algorithm.
   116     typedef TR Traits;
   117     typedef TR Traits;
   117     /// The type of the digraph the algorithm runs on.
   118     /// The type of the digraph the algorithm runs on.
   118     typedef typename Traits::Digraph Digraph;
   119     typedef typename Traits::Digraph Digraph;
   119     /// The type of the capacity map.
   120     /// The type of the capacity map.
   120     typedef typename Traits::CapacityMap CapacityMap;
   121     typedef typename Traits::CapacityMap CapacityMap;