1 // -*- c++ -*- |
1 // -*- c++ -*- |
2 #ifndef HUGO_MINCOSTFLOW_H |
2 #ifndef LEMON_MINCOSTFLOW_H |
3 #define HUGO_MINCOSTFLOW_H |
3 #define LEMON_MINCOSTFLOW_H |
4 |
4 |
5 ///\ingroup galgs |
5 ///\ingroup galgs |
6 ///\file |
6 ///\file |
7 ///\brief An algorithm for finding the minimum cost flow of given value in an uncapacitated network |
7 ///\brief An algorithm for finding the minimum cost flow of given value in an uncapacitated network |
8 |
8 |
9 #include <hugo/dijkstra.h> |
9 #include <lemon/dijkstra.h> |
10 #include <hugo/graph_wrapper.h> |
10 #include <lemon/graph_wrapper.h> |
11 #include <hugo/maps.h> |
11 #include <lemon/maps.h> |
12 #include <vector> |
12 #include <vector> |
13 #include <list> |
13 #include <list> |
14 #include <values.h> |
14 #include <values.h> |
15 #include <hugo/for_each_macros.h> |
15 #include <lemon/for_each_macros.h> |
16 #include <hugo/unionfind.h> |
16 #include <lemon/unionfind.h> |
17 #include <hugo/bin_heap.h> |
17 #include <lemon/bin_heap.h> |
18 #include <bfs_dfs.h> |
18 #include <bfs_dfs.h> |
19 |
19 |
20 namespace hugo { |
20 namespace lemon { |
21 |
21 |
22 /// \addtogroup galgs |
22 /// \addtogroup galgs |
23 /// @{ |
23 /// @{ |
24 |
24 |
25 ///\brief Implementation of an algorithm for solving the minimum cost general |
25 ///\brief Implementation of an algorithm for solving the minimum cost general |
26 /// flow problem in an uncapacitated network |
26 /// flow problem in an uncapacitated network |
27 /// |
27 /// |
28 /// |
28 /// |
29 /// The class \ref hugo::MinCostFlow "MinCostFlow" implements |
29 /// The class \ref lemon::MinCostFlow "MinCostFlow" implements |
30 /// an algorithm for solving the following general minimum cost flow problem> |
30 /// an algorithm for solving the following general minimum cost flow problem> |
31 /// |
31 /// |
32 /// |
32 /// |
33 /// |
33 /// |
34 /// \warning It is assumed here that the problem has a feasible solution |
34 /// \warning It is assumed here that the problem has a feasible solution |