Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

KruskalMapInput Class Template Reference
[Minimum Cost Spanning Tree Algorithms]

#include <lemon/kruskal.h>

List of all members.


Detailed Description

template<class GR, class Map>
class lemon::KruskalMapInput< GR, Map >

Kruskal input source.

In most cases you possibly want to use the kruskalEdgeMap() instead.

See also:
makeKruskalMapInput()
Parameters:
GR The type of the graph the algorithm runs on.
Map An edge map containing the cost of the edges.
The cost type can be any type satisfying the STL 'LessThan comparable' concept if it also has an operator+() implemented. (It is necessary for computing the total cost of the tree).

Definition at line 151 of file kruskal.h.


The documentation for this class was generated from the following file:
Generated on Sat Mar 19 10:58:52 2005 for LEMON by  doxygen 1.4.1