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

#include <lemon/kruskal.h>

Inherits vector< std::pair< GR::Edge, Map::Value > >.

Inheritance diagram for KruskalMapInput:

Inheritance graph
[legend]
List of all members.

Detailed Description

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

Kruskal's input source.

In most cases you possibly want to use the kruskal() 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).


The documentation for this class was generated from the following file:
Generated on Sat Aug 27 14:15:38 2005 for LEMON by  doxygen 1.4.4