# Changeset 1580:a9e4208cf4e3 in lemon-0.x for doc/quicktour.dox

Ignore:
Timestamp:
07/22/05 11:41:20 (16 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2082
Message:

Some changes to kruskal stuff.

File:
1 edited

Unmodified
Added
Removed
• ## doc/quicktour.dox

 r1578 \page quicktour Quick Tour to LEMON Let us first answer the question "What do I want to use LEMON for?" . Let us first answer the question "What do I want to use LEMON for?". LEMON is a C++ library, so you can use it if you want to write C++ programs. What kind of tasks does the library LEMON help to solve? algorithm: the function \ref lemon::kruskal "LEMON Kruskal " does this job for you.  After we had a graph \c g and a cost map \c edge_cost_map , the following code fragment shows an example how to get weight of the minmum spanning tree, if the costs are uniform: 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): \dontinclude kruskal_demo.cc \until kruskal It gives back a edge bool map, which contains the edges of the tree. In the variable \c tree_map the function gives back an edge bool map, which contains the edges of the found tree. If the costs are non-uniform, for example  the cost is given by \c edge_cost_map_2 , or the edges of the tree are have to be given in a edge_cost_map_2 , or the edges of the tree have to be given in a vector, then we can give to the kruskal a vector \c tree_edge_vec , instead of an edge bool map:
Note: See TracChangeset for help on using the changeset viewer.