diff -r 4b8153513f34 -r ea1fa1bc3f6d lemon/min_cut.h
--- a/lemon/min_cut.h	Mon Jun 26 15:40:35 2006 +0000
+++ b/lemon/min_cut.h	Wed Jun 28 15:06:24 2006 +0000
@@ -179,7 +179,7 @@
   /// the edges. It is read once for each edge, so the map may involve in
   /// relatively time consuming process to compute the edge capacity if
   /// it is necessary. The default map type is \ref
-  /// concept::StaticGraph::EdgeMap "Graph::EdgeMap<int>".  The value
+  /// concept::Graph::EdgeMap "Graph::EdgeMap<int>".  The value
   /// of CapacityMap is not used directly by search algorithm, it is only 
   /// passed to \ref MaxCardinalitySearchDefaultTraits.  
   /// \param _Traits Traits class to set various data types used by the 
@@ -701,7 +701,7 @@
     /// The graph type the algorithm runs on. 
     typedef _Graph Graph;
 
-    /// The AuxGraph type which is an ErasableGraph
+    /// The AuxGraph type which is an Graph
     typedef ListUGraph AuxGraph;
 
     /// \brief Instantiates a AuxGraph.