equal
deleted
inserted
replaced
1 // -*- c++ -*- |
1 // -*- c++ -*- |
2 #ifndef HUGO_MINCOSTFLOWS_H |
2 #ifndef HUGO_MINCOSTFLOWS_H |
3 #define HUGO_MINCOSTFLOWS_H |
3 #define HUGO_MINCOSTFLOWS_H |
4 |
4 |
5 ///\ingroup galgs |
5 ///\ingroup flowalgs |
6 ///\file |
6 ///\file |
7 ///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost |
7 ///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost |
8 |
8 |
9 |
9 |
10 #include <hugo/dijkstra.h> |
10 #include <hugo/dijkstra.h> |
13 #include <vector> |
13 #include <vector> |
14 #include <hugo/for_each_macros.h> |
14 #include <hugo/for_each_macros.h> |
15 |
15 |
16 namespace hugo { |
16 namespace hugo { |
17 |
17 |
18 /// \addtogroup galgs |
18 /// \addtogroup flowalgs |
19 /// @{ |
19 /// @{ |
20 |
20 |
21 ///\brief Implementation of an algorithm for finding a flow of value \c k |
21 ///\brief Implementation of an algorithm for finding a flow of value \c k |
22 ///(for small values of \c k) having minimal total cost between 2 nodes |
22 ///(for small values of \c k) having minimal total cost between 2 nodes |
23 /// |
23 /// |