diff -r 189760a7cdd0 -r c01a98ce01fd lemon/matching.h
--- a/lemon/matching.h	Thu May 07 02:05:12 2009 +0200
+++ b/lemon/matching.h	Tue May 12 12:09:55 2009 +0100
@@ -499,7 +499,7 @@
     ///
     /// This function runs the original Edmonds' algorithm.
     ///
-    /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be
+    /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be
     /// called before using this function.
     void startSparse() {
       for(NodeIt n(_graph); n != INVALID; ++n) {
@@ -518,7 +518,7 @@
     /// This function runs Edmonds' algorithm with a heuristic of postponing
     /// shrinks, therefore resulting in a faster algorithm for dense graphs.
     ///
-    /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be
+    /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be
     /// called before using this function.
     void startDense() {
       for(NodeIt n(_graph); n != INVALID; ++n) {