# Changeset 2259:da142c310d02 in lemon-0.x for lemon

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

Spellcheck

Location:
lemon
Files:
2 edited

Unmodified
Added
Removed
• ## lemon/kruskal.h

 r2206 /// /// \retval out Here we also have a choise. /// - Is can be a writable \c bool edge map. /// - It can be a writable \c bool edge map. /// After running the algorithm /// this will contain the found minimum cost spanning tree: the value of an /// For example, if we know that the spanning tree of the graph \c g has /// say 53 edges, then /// we can put its edges into a STL vector \c tree with a code like this. /// we can put its edges into an STL vector \c tree with a code like this. ///\code /// std::vector tree(53); /// \return The cost of the found tree. /// /// \warning If kruskal is run on an /// \warning If kruskal runs on an /// \ref lemon::concept::UGraph "undirected graph", be sure that the /// map storing the tree is also undirected //   For example, if we know that the spanning tree of the graph \c g has //   say 53 edges, then //   we can put its edges into a STL vector \c tree with a code like this. //   we can put its edges into an STL vector \c tree with a code like this. //\code //   std::vector tree(53);
• ## lemon/min_cost_arborescence.h

 r2151 /// The type of the map that stores which edges are in the arborescence. /// It must meet the \ref concept::WriteMap "WriteMap" concept. /// Initially it will be setted to false on each edge. After it /// Initially it will be set to false on each edge. After it /// will set all arborescence edges once. typedef typename Graph::template EdgeMap ArborescenceMap;
Note: See TracChangeset for help on using the changeset viewer.