diff -r 4cd528a30ec1 -r b6a68c15a6a3 lemon/min_cut.h
--- a/lemon/min_cut.h	Fri Jun 30 12:14:36 2006 +0000
+++ b/lemon/min_cut.h	Fri Jun 30 12:15:45 2006 +0000
@@ -23,7 +23,6 @@
 /// \brief Maximum cardinality search and min cut in undirected graphs.
 
 #include <lemon/list_graph.h>
-#include <lemon/list_ugraph.h>
 #include <lemon/bin_heap.h>
 #include <lemon/bucket_heap.h>
 
@@ -195,7 +194,7 @@
 #ifdef DOXYGEN
   template <typename _Graph, typename _CapacityMap, typename _Traits>
 #else
-  template <typename _Graph = ListGraph,
+  template <typename _Graph = ListUGraph,
 	    typename _CapacityMap = typename _Graph::template EdgeMap<int>,
 	    typename _Traits = 
             MaxCardinalitySearchDefaultTraits<_Graph, _CapacityMap> >