1.1 --- a/lemon/kruskal.h	Thu Feb 02 17:09:09 2006 +0000
     1.2 +++ b/lemon/kruskal.h	Thu Feb 02 17:43:24 2006 +0000
     1.3 @@ -77,15 +77,15 @@
     1.4    /// For example, if we know that the spanning tree of the graph \c g has
     1.5    /// say 53 edges, then
     1.6    /// we can put its edges into a STL vector \c tree with a code like this.
     1.7 -  /// \code
     1.8 +  ///\code
     1.9    /// std::vector<Edge> tree(53);
    1.10    /// kruskal(g,cost,tree.begin());
    1.11 -  /// \endcode
    1.12 +  ///\endcode
    1.13    /// Or if we don't know in advance the size of the tree, we can write this.
    1.14 -  /// \code
    1.15 +  ///\code
    1.16    /// std::vector<Edge> tree;
    1.17    /// kruskal(g,cost,std::back_inserter(tree));
    1.18 -  /// \endcode
    1.19 +  ///\endcode
    1.20    ///
    1.21    /// \return The cost of the found tree.
    1.22    ///
    1.23 @@ -300,10 +300,10 @@
    1.24    /// is added to sequence pointed by the iterator.
    1.25    ///
    1.26    /// A typical usage:
    1.27 -  /// \code
    1.28 +  ///\code
    1.29    /// std::vector<Graph::Edge> v;
    1.30    /// kruskal(g, input, makeKruskalSequenceOutput(back_inserter(v)));
    1.31 -  /// \endcode
    1.32 +  ///\endcode
    1.33    /// 
    1.34    /// For the most common case, when the input is given by a simple edge
    1.35    /// map and the output is a sequence of the tree edges, a special
    1.36 @@ -396,15 +396,15 @@
    1.37  //   For example, if we know that the spanning tree of the graph \c g has
    1.38  //   say 53 edges, then
    1.39  //   we can put its edges into a STL vector \c tree with a code like this.
    1.40 -//   \code
    1.41 +//\code
    1.42  //   std::vector<Edge> tree(53);
    1.43  //   kruskal(g,cost,tree.begin());
    1.44 -//   \endcode
    1.45 +//\endcode
    1.46  //   Or if we don't know in advance the size of the tree, we can write this.
    1.47 -//   \code
    1.48 +//\code
    1.49  //   std::vector<Edge> tree;
    1.50  //   kruskal(g,cost,std::back_inserter(tree));
    1.51 -//   \endcode
    1.52 +//\endcode
    1.53  //  
    1.54  //   \return The cost of the found tree.
    1.55  //