Ignore:
Timestamp:
07/28/05 21:04:43 (17 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2108
Message:

More docs

File:
1 edited

Unmodified
Removed
• ## lemon/kruskal.h

 r1570 /// The algorithm copies the elements of the found tree into this sequence. /// For example, if we know that the spanning tree of the graph \c g has /// say 53 edges then /// say 53 edges, then /// we can put its edges into a STL vector \c tree with a code like this. /// \code /// /// \return The cost of the found tree. /// /// \warning If kruskal is run on an \ref undirected graph, be sure that the /// map storing the tree is also undirected /// (e.g. UndirListGraph::UndirEdgeMap, otherwise the values of the /// half of the edges will not be set. /// /// \todo Discuss the case of undirected graphs: In this case the algorithm //   The algorithm copies the elements of the found tree into this sequence. //   For example, if we know that the spanning tree of the graph \c g has //   say 53 edges then //   say 53 edges, then //   we can put its edges into a STL vector \c tree with a code like this. //   \code
Note: See TracChangeset for help on using the changeset viewer.