Changeset 1555:48769ac7ec32 in lemon-0.x for lemon/kruskal.h

Timestamp:

07/13/05 21:49:36 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

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

Message:

Doc improvement

File:

• lemon/kruskal.h (modified) (1 diff)

lemon/kruskal.h

@@ -46 +46 @@
 
   /// This function runs Kruskal's algorithm to find a minimum cost tree.
-  /// \param g The graph the algorithm runs on. The algorithm considers the
-  /// graph to be undirected, the direction of the edges are not used.
+  /// \param g The graph the algorithm runs on.
+  /// It can be either \ref concept::StaticGraph "directed" or 
+  /// \ref concept::UndirStaticGraph "undirected".
+  /// If the graph is directed, the algorithm consider it to be 
+  /// undirected by disregarding the direction of the edges.
   ///
   /// \param in This object is used to describe the edge costs. It must