equal
deleted
inserted
replaced
17 */ |
17 */ |
18 |
18 |
19 #ifndef LEMON_MIN_COST_FLOW_H |
19 #ifndef LEMON_MIN_COST_FLOW_H |
20 #define LEMON_MIN_COST_FLOW_H |
20 #define LEMON_MIN_COST_FLOW_H |
21 |
21 |
22 ///\ingroup flowalgs |
22 ///\ingroup min_cost_flow |
23 /// |
23 /// |
24 ///\file |
24 ///\file |
25 ///\brief An algorithm for finding a flow of value \c k (for |
25 ///\brief An algorithm for finding a flow of value \c k (for |
26 ///small values of \c k) having minimal total cost |
26 ///small values of \c k) having minimal total cost |
27 |
27 |
31 #include <lemon/maps.h> |
31 #include <lemon/maps.h> |
32 #include <vector> |
32 #include <vector> |
33 |
33 |
34 namespace lemon { |
34 namespace lemon { |
35 |
35 |
36 /// \addtogroup flowalgs |
36 /// \addtogroup min_cost_flow |
37 /// @{ |
37 /// @{ |
38 |
38 |
39 /// \brief Implementation of an algorithm for finding a flow of |
39 /// \brief Implementation of an algorithm for finding a flow of |
40 /// value \c k (for small values of \c k) having minimal total cost |
40 /// value \c k (for small values of \c k) having minimal total cost |
41 /// between two nodes |
41 /// between two nodes |