COIN-OR::LEMON - Graph Library

Changeset 2259:da142c310d02 in lemon-0.x for lemon/kruskal.h


Ignore:
Timestamp:
10/24/06 18:49:41 (13 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3015
Message:

Spellcheck

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/kruskal.h

    r2206 r2259  
    6060  ///
    6161  /// \retval out Here we also have a choise.
    62   /// - Is can be a writable \c bool edge map.
     62  /// - It can be a writable \c bool edge map.
    6363  /// After running the algorithm
    6464  /// this will contain the found minimum cost spanning tree: the value of an
     
    7070  /// For example, if we know that the spanning tree of the graph \c g has
    7171  /// say 53 edges, then
    72   /// we can put its edges into a STL vector \c tree with a code like this.
     72  /// we can put its edges into an STL vector \c tree with a code like this.
    7373  ///\code
    7474  /// std::vector<Edge> tree(53);
     
    8383  /// \return The cost of the found tree.
    8484  ///
    85   /// \warning If kruskal is run on an
     85  /// \warning If kruskal runs on an
    8686  /// \ref lemon::concept::UGraph "undirected graph", be sure that the
    8787  /// map storing the tree is also undirected
     
    392392//   For example, if we know that the spanning tree of the graph \c g has
    393393//   say 53 edges, then
    394 //   we can put its edges into a STL vector \c tree with a code like this.
     394//   we can put its edges into an STL vector \c tree with a code like this.
    395395//\code
    396396//   std::vector<Edge> tree(53);
Note: See TracChangeset for help on using the changeset viewer.