equal
deleted
inserted
replaced
32 #include <lemon/graph_utils.h> |
32 #include <lemon/graph_utils.h> |
33 #include <lemon/graph_adaptor.h> |
33 #include <lemon/graph_adaptor.h> |
34 #include <lemon/iterable_maps.h> |
34 #include <lemon/iterable_maps.h> |
35 |
35 |
36 /// \file |
36 /// \file |
37 /// \ingroup flowalgs |
37 /// \ingroup min_cut |
38 /// \brief Implementation of the Hao-Orlin algorithm. |
38 /// \brief Implementation of the Hao-Orlin algorithm. |
39 /// |
39 /// |
40 /// Implementation of the HaoOrlin algorithms class for testing network |
40 /// Implementation of the HaoOrlin algorithms class for testing network |
41 /// reliability. |
41 /// reliability. |
42 |
42 |
43 namespace lemon { |
43 namespace lemon { |
44 |
44 |
45 /// \ingroup flowalgs |
45 /// \ingroup min_cut |
46 /// |
46 /// |
47 /// \brief %Hao-Orlin algorithm to find a minimum cut in directed graphs. |
47 /// \brief %Hao-Orlin algorithm to find a minimum cut in directed graphs. |
48 /// |
48 /// |
49 /// Hao-Orlin calculates a minimum cut in a directed graph |
49 /// Hao-Orlin calculates a minimum cut in a directed graph |
50 /// \f$ D=(V,A) \f$. It takes a fixed node \f$ source \in V \f$ and consists |
50 /// \f$ D=(V,A) \f$. It takes a fixed node \f$ source \in V \f$ and consists |