equal
deleted
inserted
replaced
21 /// \ingroup topology |
21 /// \ingroup topology |
22 /// \file |
22 /// \file |
23 /// \brief Maximum cardinality search and min cut in undirected graphs. |
23 /// \brief Maximum cardinality search and min cut in undirected graphs. |
24 |
24 |
25 #include <lemon/list_graph.h> |
25 #include <lemon/list_graph.h> |
26 #include <lemon/list_ugraph.h> |
|
27 #include <lemon/bin_heap.h> |
26 #include <lemon/bin_heap.h> |
28 #include <lemon/bucket_heap.h> |
27 #include <lemon/bucket_heap.h> |
29 |
28 |
30 #include <lemon/bits/invalid.h> |
29 #include <lemon/bits/invalid.h> |
31 #include <lemon/error.h> |
30 #include <lemon/error.h> |
193 /// \author Balazs Dezso |
192 /// \author Balazs Dezso |
194 |
193 |
195 #ifdef DOXYGEN |
194 #ifdef DOXYGEN |
196 template <typename _Graph, typename _CapacityMap, typename _Traits> |
195 template <typename _Graph, typename _CapacityMap, typename _Traits> |
197 #else |
196 #else |
198 template <typename _Graph = ListGraph, |
197 template <typename _Graph = ListUGraph, |
199 typename _CapacityMap = typename _Graph::template EdgeMap<int>, |
198 typename _CapacityMap = typename _Graph::template EdgeMap<int>, |
200 typename _Traits = |
199 typename _Traits = |
201 MaxCardinalitySearchDefaultTraits<_Graph, _CapacityMap> > |
200 MaxCardinalitySearchDefaultTraits<_Graph, _CapacityMap> > |
202 #endif |
201 #endif |
203 class MaxCardinalitySearch { |
202 class MaxCardinalitySearch { |