diff -r e5c0c5cc477f -r 17eb3eaad9f8 lemon/kruskal.h
--- a/lemon/kruskal.h	Thu Feb 02 17:09:09 2006 +0000
+++ b/lemon/kruskal.h	Thu Feb 02 17:43:24 2006 +0000
@@ -77,15 +77,15 @@
   /// For example, if we know that the spanning tree of the graph \c g has
   /// say 53 edges, then
   /// we can put its edges into a STL vector \c tree with a code like this.
-  /// \code
+  ///\code
   /// std::vector<Edge> tree(53);
   /// kruskal(g,cost,tree.begin());
-  /// \endcode
+  ///\endcode
   /// Or if we don't know in advance the size of the tree, we can write this.
-  /// \code
+  ///\code
   /// std::vector<Edge> tree;
   /// kruskal(g,cost,std::back_inserter(tree));
-  /// \endcode
+  ///\endcode
   ///
   /// \return The cost of the found tree.
   ///
@@ -300,10 +300,10 @@
   /// is added to sequence pointed by the iterator.
   ///
   /// A typical usage:
-  /// \code
+  ///\code
   /// std::vector<Graph::Edge> v;
   /// kruskal(g, input, makeKruskalSequenceOutput(back_inserter(v)));
-  /// \endcode
+  ///\endcode
   /// 
   /// For the most common case, when the input is given by a simple edge
   /// map and the output is a sequence of the tree edges, a special
@@ -396,15 +396,15 @@
 //   For example, if we know that the spanning tree of the graph \c g has
 //   say 53 edges, then
 //   we can put its edges into a STL vector \c tree with a code like this.
-//   \code
+//\code
 //   std::vector<Edge> tree(53);
 //   kruskal(g,cost,tree.begin());
-//   \endcode
+//\endcode
 //   Or if we don't know in advance the size of the tree, we can write this.
-//   \code
+//\code
 //   std::vector<Edge> tree;
 //   kruskal(g,cost,std::back_inserter(tree));
-//   \endcode
+//\endcode
 //  
 //   \return The cost of the found tree.
 //