1.1 --- a/lemon/matching.h	Wed Apr 29 19:22:14 2009 +0100
     1.2 +++ b/lemon/matching.h	Thu May 07 02:07:59 2009 +0200
     1.3 @@ -499,7 +499,7 @@
     1.4      ///
     1.5      /// This function runs the original Edmonds' algorithm.
     1.6      ///
     1.7 -    /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be
     1.8 +    /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be
     1.9      /// called before using this function.
    1.10      void startSparse() {
    1.11        for(NodeIt n(_graph); n != INVALID; ++n) {
    1.12 @@ -518,7 +518,7 @@
    1.13      /// This function runs Edmonds' algorithm with a heuristic of postponing
    1.14      /// shrinks, therefore resulting in a faster algorithm for dense graphs.
    1.15      ///
    1.16 -    /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be
    1.17 +    /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be
    1.18      /// called before using this function.
    1.19      void startDense() {
    1.20        for(NodeIt n(_graph); n != INVALID; ++n) {