# mlpack_emst

## NAME

mlpack_emst - fast euclidean minimum spanning tree

## SYNOPSIS

mlpack_emst [-h] [-v]

## DESCRIPTION

This program can compute the Euclidean minimum spanning tree of a set of input points using the dual-tree Boruvka algorithm.

The output is saved in a three-column matrix, where each row indicates an edge. The first column corresponds to the lesser index of the edge; the second column corresponds to the greater index of the edge; and the third column corresponds to the distance between the two points.

## REQUIRED INPUT OPTIONS

--input_file (-i) [string]

Input data matrix.

## OPTIONAL INPUT OPTIONS

--help (-h) [bool]

Default help info. Default value 0.

--info [string]

Get help on a specific module or option. Default value ’’.

--leaf_size (-l) [int]

Leaf size in the kd-tree. One-element leaves give the empirically best performance, but at the cost of greater memory requirements. Default value 1.

--naive (-n) [bool]

Compute the MST using O(n^2) naive algorithm. Default value 0.

--verbose (-v) [bool]

Display informational messages and the full list of parameters and timers at the end of execution. Default value 0.

--version (-V) [bool]

Display the version of mlpack. Default value

0. |

## OPTIONAL OUTPUT OPTIONS

--output_file (-o) [string]

Output data. Stored as an edge list. Default value ’’.

## ADDITIONAL INFORMATION

## ADDITIONAL INFORMATION

For further information, including relevant papers, citations, and theory, For further information, including relevant papers, citations, and theory, consult the documentation found at http://www.mlpack.org or included with your consult the documentation found at http://www.mlpack.org or included with your DISTRIBUTION OF MLPACK. DISTRIBUTION OF MLPACK.