Changeset 1946:17eb3eaad9f8 in lemon-0.x for lemon/kruskal.h

Timestamp:

02/02/06 18:43:24 (18 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2521

Message:

• workaround for a Doxygen 1.4.6 bug
• other doc fixes

File:

• lemon/kruskal.h (modified) (3 diffs)

lemon/kruskal.h

@@ -78 +78 @@
   /// 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.
@@ -301 +301 @@
   ///
   /// 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
@@ -397 +397 @@
 //   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.