1.1 --- a/lemon/prim.h	Fri Apr 07 09:52:30 2006 +0000
     1.2 +++ b/lemon/prim.h	Fri Apr 07 09:54:35 2006 +0000
     1.3 @@ -136,7 +136,7 @@
     1.4    /// \ingroup spantree
     1.5    ///This class provides an efficient implementation of %Prim algorithm.
     1.6    ///
     1.7 -  ///The running time is O(e*log n) where e is the number of edges and
     1.8 +  ///The running time is \f$ O(e\log(n)) \f$ where e is the number of edges and
     1.9    ///n is the number of nodes in the graph.
    1.10    ///
    1.11    ///The edge costs are passed to the algorithm using a