1.1 --- a/lemon/min_cut.h	Fri Jun 30 12:14:36 2006 +0000
     1.2 +++ b/lemon/min_cut.h	Fri Jun 30 12:15:45 2006 +0000
     1.3 @@ -23,7 +23,6 @@
     1.4  /// \brief Maximum cardinality search and min cut in undirected graphs.
     1.5  
     1.6  #include <lemon/list_graph.h>
     1.7 -#include <lemon/list_ugraph.h>
     1.8  #include <lemon/bin_heap.h>
     1.9  #include <lemon/bucket_heap.h>
    1.10  
    1.11 @@ -195,7 +194,7 @@
    1.12  #ifdef DOXYGEN
    1.13    template <typename _Graph, typename _CapacityMap, typename _Traits>
    1.14  #else
    1.15 -  template <typename _Graph = ListGraph,
    1.16 +  template <typename _Graph = ListUGraph,
    1.17  	    typename _CapacityMap = typename _Graph::template EdgeMap<int>,
    1.18  	    typename _Traits = 
    1.19              MaxCardinalitySearchDefaultTraits<_Graph, _CapacityMap> >