# Changeset 584:33c6b6e755cd in lemon-1.2 for lemon/kruskal.h

Ignore:
Timestamp:
04/15/09 02:04:37 (11 years ago)
Branch:
default
Phase:
public
Message:

Small doc improvements (#263)

File:
1 edited

Unmodified
Added
Removed
• ## lemon/kruskal.h

 r440 /// \ingroup spantree /// /// \brief Kruskal algorithm to find a minimum cost spanning tree of /// \brief Kruskal's algorithm for finding a minimum cost spanning tree of /// a graph. /// /// This function runs Kruskal's algorithm to find a minimum cost /// spanning tree. /// spanning tree of a graph. /// Due to some C++ hacking, it accepts various input and output types. /// /// It can be one of the following choices. /// - An STL compatible 'Forward Container' with /// std::pair or /// std::pair as its value_type, where /// \c X is the type of the costs. The pairs indicates the arcs/edges /// std::pair or /// std::pair as its value_type, where /// \c C is the type of the costs. The pairs indicates the arcs/edges /// along with the assigned cost. They must be in a /// cost-ascending order. /// /// \retval out Here we also have a choice. /// - It can be a writable \c bool arc/edge map. After running the /// algorithm it will contain the found minimum cost spanning /// - It can be a writable arc/edge map with \c bool value type. After /// running the algorithm it will contain the found minimum cost spanning /// tree: the value of an arc/edge will be set to \c true if it belongs /// to the tree, otherwise it will be set to \c false. The value of #ifdef DOXYGEN template Value kruskal(GR const& g, const In& in, Out& out) template Value kruskal(const Graph& g, const In& in, Out& out) #else template template inline typename _kruskal_bits::KruskalValueSelector::Value
Note: See TracChangeset for help on using the changeset viewer.