equal
deleted
inserted
replaced
17 */ |
17 */ |
18 |
18 |
19 #ifndef LEMON_MIN_MEAN_CYCLE_H |
19 #ifndef LEMON_MIN_MEAN_CYCLE_H |
20 #define LEMON_MIN_MEAN_CYCLE_H |
20 #define LEMON_MIN_MEAN_CYCLE_H |
21 |
21 |
22 /// \ingroup min_cost_flow |
22 /// \ingroup shortest_path |
23 /// |
23 /// |
24 /// \file |
24 /// \file |
25 /// \brief Karp's algorithm for finding a minimum mean (directed) cycle. |
25 /// \brief Karp's algorithm for finding a minimum mean (directed) cycle. |
26 |
26 |
27 #include <vector> |
27 #include <vector> |
29 #include <lemon/topology.h> |
29 #include <lemon/topology.h> |
30 #include <lemon/path.h> |
30 #include <lemon/path.h> |
31 |
31 |
32 namespace lemon { |
32 namespace lemon { |
33 |
33 |
34 /// \addtogroup min_cost_flow |
34 /// \addtogroup shortest_path |
35 /// @{ |
35 /// @{ |
36 |
36 |
37 /// \brief Implementation of Karp's algorithm for finding a |
37 /// \brief Implementation of Karp's algorithm for finding a |
38 /// minimum mean (directed) cycle. |
38 /// minimum mean (directed) cycle. |
39 /// |
39 /// |