1.1 --- a/lemon/min_cut.h	Tue Apr 04 10:40:02 2006 +0000
     1.2 +++ b/lemon/min_cut.h	Tue Apr 04 17:43:23 2006 +0000
     1.3 @@ -120,7 +120,7 @@
     1.4      /// \brief Instantiates a ProcessedMap.
     1.5      ///
     1.6      /// This function instantiates a \ref ProcessedMap. 
     1.7 -    /// \param g is the graph, to which
     1.8 +    /// \param graph is the graph, to which
     1.9      /// we would like to define the \ref ProcessedMap
    1.10  #ifdef DOXYGEN
    1.11      static ProcessedMap *createProcessedMap(const Graph &graph)
    1.12 @@ -362,8 +362,8 @@
    1.13      
    1.14      /// \brief Constructor.
    1.15      ///
    1.16 -    ///\param _graph the graph the algorithm will run on.
    1.17 -    ///\param _capacity the capacity map used by the algorithm.
    1.18 +    ///\param graph the graph the algorithm will run on.
    1.19 +    ///\param capacity the capacity map used by the algorithm.
    1.20      MaxCardinalitySearch(const Graph& graph, const CapacityMap& capacity) :
    1.21        _graph(&graph), _capacity(&capacity),
    1.22        _cardinality(0), local_cardinality(false),