equal
deleted
inserted
replaced
18 |
18 |
19 #ifndef LEMON_EDMONDS_KARP_H |
19 #ifndef LEMON_EDMONDS_KARP_H |
20 #define LEMON_EDMONDS_KARP_H |
20 #define LEMON_EDMONDS_KARP_H |
21 |
21 |
22 /// \file |
22 /// \file |
23 /// \ingroup flowalgs |
23 /// \ingroup max_flow |
24 /// \brief Implementation of the Edmonds-Karp algorithm. |
24 /// \brief Implementation of the Edmonds-Karp algorithm. |
25 |
25 |
26 #include <lemon/graph_adaptor.h> |
26 #include <lemon/graph_adaptor.h> |
27 #include <lemon/tolerance.h> |
27 #include <lemon/tolerance.h> |
28 #include <lemon/bfs.h> |
28 #include <lemon/bfs.h> |
29 |
29 |
30 namespace lemon { |
30 namespace lemon { |
31 |
31 |
32 /// \ingroup flowalgs |
32 /// \ingroup max_flow |
33 /// \brief Edmonds-Karp algorithms class. |
33 /// \brief Edmonds-Karp algorithms class. |
34 /// |
34 /// |
35 /// This class provides an implementation of the \e Edmonds-Karp \e |
35 /// This class provides an implementation of the \e Edmonds-Karp \e |
36 /// algorithm producing a flow of maximum value in a directed |
36 /// algorithm producing a flow of maximum value in a directed |
37 /// graph. The Edmonds-Karp algorithm is slower than the Preflow algorithm |
37 /// graph. The Edmonds-Karp algorithm is slower than the Preflow algorithm |