COIN-OR::LEMON - Graph Library

Changeset 1580:a9e4208cf4e3 in lemon-0.x for doc


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

Some changes to kruskal stuff.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/quicktour.dox

    r1578 r1580  
    33\page quicktour Quick Tour to LEMON
    44
    5 Let us first answer the question <b>"What do I want to use LEMON for?"
    6 </b>.
     5Let us first answer the question <b>"What do I want to use LEMON for?"</b>.
    76LEMON is a C++ library, so you can use it if you want to write C++
    87programs. What kind of tasks does the library LEMON help to solve?
     
    147146algorithm: the function \ref lemon::kruskal "LEMON Kruskal " does
    148147this 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:
     148edge_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):
    150149
    151150\dontinclude kruskal_demo.cc
     
    153152\until kruskal
    154153
    155 It gives back a edge bool map, which contains the edges of the tree.
     154In the variable \c tree_map the function gives back an edge bool map, which contains the edges of the found tree.
     155
    156156If the costs are non-uniform, for example  the cost is given by \c
    157 edge_cost_map_2 , or the edges of the tree are have to be given in a
     157edge_cost_map_2 , or the edges of the tree have to be given in a
    158158vector, then we can give to the kruskal a vector \c tree_edge_vec , instead of
    159159an edge bool map:
Note: See TracChangeset for help on using the changeset viewer.