equal
deleted
inserted
replaced
16 |
16 |
17 #ifndef LEMON_NAGAMOCHI_IBARAKI_H |
17 #ifndef LEMON_NAGAMOCHI_IBARAKI_H |
18 #define LEMON_NAGAMOCHI_IBARAKI_H |
18 #define LEMON_NAGAMOCHI_IBARAKI_H |
19 |
19 |
20 |
20 |
21 /// \ingroup topology |
21 /// \ingroup min_cut |
22 /// \file |
22 /// \file |
23 /// \brief Maximum cardinality search and minimum cut in undirected |
23 /// \brief Maximum cardinality search and minimum cut in undirected |
24 /// graphs. |
24 /// graphs. |
25 |
25 |
26 #include <lemon/list_graph.h> |
26 #include <lemon/list_graph.h> |
154 } |
154 } |
155 |
155 |
156 |
156 |
157 }; |
157 }; |
158 |
158 |
159 /// \ingroup topology |
159 /// \ingroup search |
160 /// |
160 /// |
161 /// \brief Maximum Cardinality Search algorithm class. |
161 /// \brief Maximum Cardinality Search algorithm class. |
162 /// |
162 /// |
163 /// This class provides an efficient implementation of Maximum Cardinality |
163 /// This class provides an efficient implementation of Maximum Cardinality |
164 /// Search algorithm. The maximum cardinality search chooses first time any |
164 /// Search algorithm. The maximum cardinality search chooses first time any |
830 } |
830 } |
831 |
831 |
832 |
832 |
833 }; |
833 }; |
834 |
834 |
835 /// \ingroup topology |
835 /// \ingroup min_cut |
836 /// |
836 /// |
837 /// \brief Calculates the minimum cut in an undirected graph. |
837 /// \brief Calculates the minimum cut in an undirected graph. |
838 /// |
838 /// |
839 /// Calculates the minimum cut in an undirected graph with the |
839 /// Calculates the minimum cut in an undirected graph with the |
840 /// Nagamochi-Ibaraki algorithm. The algorithm separates the graph's |
840 /// Nagamochi-Ibaraki algorithm. The algorithm separates the graph's |