Changeset 1603:5ad84fbadf2b in lemon0.x for lemon/kruskal.h
 Timestamp:
 07/28/05 21:04:43 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2108
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/kruskal.h
r1570 r1603 75 75 /// The algorithm copies the elements of the found tree into this sequence. 76 76 /// For example, if we know that the spanning tree of the graph \c g has 77 /// say 53 edges then77 /// say 53 edges, then 78 78 /// we can put its edges into a STL vector \c tree with a code like this. 79 79 /// \code … … 88 88 /// 89 89 /// \return The cost of the found tree. 90 /// 91 /// \warning If kruskal is run on an \ref undirected graph, be sure that the 92 /// map storing the tree is also undirected 93 /// (e.g. UndirListGraph::UndirEdgeMap<bool>, otherwise the values of the 94 /// half of the edges will not be set. 90 95 /// 91 96 /// \todo Discuss the case of undirected graphs: In this case the algorithm … … 388 393 // The algorithm copies the elements of the found tree into this sequence. 389 394 // For example, if we know that the spanning tree of the graph \c g has 390 // say 53 edges then395 // say 53 edges, then 391 396 // we can put its edges into a STL vector \c tree with a code like this. 392 397 // \code
Note: See TracChangeset
for help on using the changeset viewer.