Changeset 2259:da142c310d02 in lemon0.x
 Timestamp:
 10/24/06 18:49:41 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3015
 Location:
 lemon
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

lemon/kruskal.h
r2206 r2259 60 60 /// 61 61 /// \retval out Here we also have a choise. 62 ///  I scan be a writable \c bool edge map.62 ///  It can be a writable \c bool edge map. 63 63 /// After running the algorithm 64 64 /// this will contain the found minimum cost spanning tree: the value of an … … 70 70 /// For example, if we know that the spanning tree of the graph \c g has 71 71 /// 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. 73 73 ///\code 74 74 /// std::vector<Edge> tree(53); … … 83 83 /// \return The cost of the found tree. 84 84 /// 85 /// \warning If kruskal is runon an85 /// \warning If kruskal runs on an 86 86 /// \ref lemon::concept::UGraph "undirected graph", be sure that the 87 87 /// map storing the tree is also undirected … … 392 392 // For example, if we know that the spanning tree of the graph \c g has 393 393 // 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. 395 395 //\code 396 396 // std::vector<Edge> tree(53); 
lemon/min_cost_arborescence.h
r2151 r2259 59 59 /// The type of the map that stores which edges are in the arborescence. 60 60 /// It must meet the \ref concept::WriteMap "WriteMap" concept. 61 /// Initially it will be set tedto false on each edge. After it61 /// Initially it will be set to false on each edge. After it 62 62 /// will set all arborescence edges once. 63 63 typedef typename Graph::template EdgeMap<bool> ArborescenceMap;
Note: See TracChangeset
for help on using the changeset viewer.