mlpack::emst Namespace Reference

Euclidean Minimum Spanning Trees. More...

Classes
class	DTBRules
class	DTBStat
	A statistic for use with mlpack trees, which stores the upper bound on distance to nearest neighbors and the component which this node belongs to. More...
class	DualTreeBoruvka
	Performs the MST calculation using the Dual-Tree Boruvka algorithm, using any type of tree. More...
class	EdgePair
	An edge pair is simply two indices and a distance. More...
class	UnionFind
	A Union-Find data structure. More...

Functions
template<typename TreeType , typename MatType >
TreeType *	BuildTree (MatType &&dataset, std::vector< size_t > &oldFromNew, const typename std::enable_if< tree::TreeTraits< TreeType >::RearrangesDataset >::type *=0)
	Call the tree constructor that does mapping.
template<typename TreeType , typename MatType >
TreeType *	BuildTree (MatType &&dataset, const std::vector< size_t > &, const typename std::enable_if< !tree::TreeTraits< TreeType >::RearrangesDataset >::type *=0)
	Call the tree constructor that does not do mapping.

Detailed Description

Euclidean Minimum Spanning Trees.