Changeset 1580:a9e4208cf4e3 in lemon0.x for doc/quicktour.dox
 Timestamp:
 07/22/05 11:41:20 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2082
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

doc/quicktour.dox
r1578 r1580 3 3 \page quicktour Quick Tour to LEMON 4 4 5 Let us first answer the question <b>"What do I want to use LEMON for?" 6 </b>. 5 Let us first answer the question <b>"What do I want to use LEMON for?"</b>. 7 6 LEMON is a C++ library, so you can use it if you want to write C++ 8 7 programs. What kind of tasks does the library LEMON help to solve? … … 147 146 algorithm: the function \ref lemon::kruskal "LEMON Kruskal " does 148 147 this job for you. After we had a graph \c g and a cost map \c 149 edge_cost_map , the following code fragment shows an example how to get weight of the minmum spanning tree , if the costs are uniform:148 edge_cost_map , the following code fragment shows an example how to get weight of the minmum spanning tree (in this first example the costs are uniform; this is of course not the case in real life applications): 150 149 151 150 \dontinclude kruskal_demo.cc … … 153 152 \until kruskal 154 153 155 It gives back a edge bool map, which contains the edges of the tree. 154 In the variable \c tree_map the function gives back an edge bool map, which contains the edges of the found tree. 155 156 156 If the costs are nonuniform, for example the cost is given by \c 157 edge_cost_map_2 , or the edges of the tree arehave to be given in a157 edge_cost_map_2 , or the edges of the tree have to be given in a 158 158 vector, then we can give to the kruskal a vector \c tree_edge_vec , instead of 159 159 an edge bool map:
Note: See TracChangeset
for help on using the changeset viewer.