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