COIN-OR::LEMON - Graph Library

Changeset 1603:5ad84fbadf2b in lemon-0.x for lemon/kruskal.h


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

More docs

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/kruskal.h

    r1570 r1603  
    7575  /// The algorithm copies the elements of the found tree into this sequence.
    7676  /// For example, if we know that the spanning tree of the graph \c g has
    77   /// say 53 edges then
     77  /// say 53 edges, then
    7878  /// we can put its edges into a STL vector \c tree with a code like this.
    7979  /// \code
     
    8888  ///
    8989  /// \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.
    9095  ///
    9196  /// \todo Discuss the case of undirected graphs: In this case the algorithm
     
    388393//   The algorithm copies the elements of the found tree into this sequence.
    389394//   For example, if we know that the spanning tree of the graph \c g has
    390 //   say 53 edges then
     395//   say 53 edges, then
    391396//   we can put its edges into a STL vector \c tree with a code like this.
    392397//   \code
Note: See TracChangeset for help on using the changeset viewer.