Changeset 1555:48769ac7ec32 in lemon0.x for lemon/kruskal.h
 Timestamp:
 07/13/05 21:49:36 (18 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2051
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/kruskal.h
r1547 r1555 46 46 47 47 /// This function runs Kruskal's algorithm to find a minimum cost tree. 48 /// \param g The graph the algorithm runs on. The algorithm considers the 49 /// graph to be undirected, the direction of the edges are not used. 48 /// \param g The graph the algorithm runs on. 49 /// It can be either \ref concept::StaticGraph "directed" or 50 /// \ref concept::UndirStaticGraph "undirected". 51 /// If the graph is directed, the algorithm consider it to be 52 /// undirected by disregarding the direction of the edges. 50 53 /// 51 54 /// \param in This object is used to describe the edge costs. It must
Note: See TracChangeset
for help on using the changeset viewer.