equal
deleted
inserted
replaced
29 /// \ingroup flowalgs |
29 /// \ingroup flowalgs |
30 /// \brief Implementation of the preflow algorithm. |
30 /// \brief Implementation of the preflow algorithm. |
31 |
31 |
32 namespace lemon { |
32 namespace lemon { |
33 |
33 |
34 /// \addtogroup flowalgs |
34 ///\ingroup flowalgs |
35 /// @{ |
35 ///\brief %Preflow algorithms class. |
36 |
36 /// |
37 ///%Preflow algorithms class. |
|
38 |
|
39 ///This class provides an implementation of the \e preflow \e |
37 ///This class provides an implementation of the \e preflow \e |
40 ///algorithm producing a flow of maximum value in a directed |
38 ///algorithm producing a flow of maximum value in a directed |
41 ///graph. The preflow algorithms are the fastest known max flow algorithms |
39 ///graph. The preflow algorithms are the fastest known max flow algorithms |
42 ///up to now. The \e source node, the \e target node, the \e |
40 ///up to now. The \e source node, the \e target node, the \e |
43 ///capacity of the edges and the \e starting \e flow value of the |
41 ///capacity of the edges and the \e starting \e flow value of the |
861 } |
859 } |
862 } //relabel |
860 } //relabel |
863 |
861 |
864 }; |
862 }; |
865 |
863 |
866 ///Function type interface for Preflow algorithm. |
864 ///\ingroup flowalgs |
867 |
865 ///\brief Function type interface for Preflow algorithm. |
868 /// \ingroup flowalgs |
866 /// |
869 ///Function type interface for Preflow algorithm. |
867 ///Function type interface for Preflow algorithm. |
870 ///\sa Preflow |
868 ///\sa Preflow |
871 template<class GR, class CM, class FM> |
869 template<class GR, class CM, class FM> |
872 Preflow<GR,typename CM::Value,CM,FM> preflow(const GR &g, |
870 Preflow<GR,typename CM::Value,CM,FM> preflow(const GR &g, |
873 typename GR::Node source, |
871 typename GR::Node source, |