Changeset 2260:4274224f8a7d in lemon0.x for lemon/kruskal.h
 Timestamp:
 10/24/06 19:19:16 (13 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3016
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/kruskal.h
r2259 r2260 45 45 /// 46 46 /// \param g The graph the algorithm runs on. 47 /// It can be either \ref concept ::Graph "directed" or48 /// \ref concept ::UGraph "undirected".47 /// It can be either \ref concepts::Graph "directed" or 48 /// \ref concepts::UGraph "undirected". 49 49 /// If the graph is directed, the algorithm consider it to be 50 50 /// undirected by disregarding the direction of the edges. … … 84 84 /// 85 85 /// \warning If kruskal runs on an 86 /// \ref lemon::concept ::UGraph "undirected graph", be sure that the86 /// \ref lemon::concepts::UGraph "undirected graph", be sure that the 87 87 /// map storing the tree is also undirected 88 88 /// (e.g. ListUGraph::UEdgeMap<bool>, otherwise the values of the
Note: See TracChangeset
for help on using the changeset viewer.