equal
deleted
inserted
replaced
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 flowalgs |
23 /// |
23 /// |
24 ///\file \brief An algorithm for finding a flow of value \c k (for |
24 ///\file |
|
25 ///\brief An algorithm for finding a flow of value \c k (for |
25 ///small values of \c k) having minimal total cost |
26 ///small values of \c k) having minimal total cost |
26 |
27 |
27 |
28 |
28 #include <lemon/dijkstra.h> |
29 #include <lemon/dijkstra.h> |
29 #include <lemon/graph_adaptor.h> |
30 #include <lemon/graph_adaptor.h> |