.\"Text automatically generated by txt2man
.TH emst  "1" "" ""
.SH NAME
\fBemst \fP- fast euclidean minimum spanning tree
.SH SYNOPSIS
.nf
.fam C
 \fBemst\fP [\fB-h\fP] [\fB-v\fP] \fB-i\fP \fIstring\fP [\fB-l\fP \fIint\fP] [\fB-n\fP] [\fB-o\fP \fIstring\fP] \fB-V\fP 
.fam T
.fi
.fam T
.fi
.SH DESCRIPTION


This program can compute the Euclidean minimum spanning tree of a set of input
points using the dual-tree Boruvka algorithm.
.PP
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.
.SH REQUIRED OPTIONS 

.TP
.B
\fB--input_file\fP (\fB-i\fP) [\fIstring\fP]
Data input file.  
.SH OPTIONS 

.TP
.B
\fB--help\fP (\fB-h\fP)
Default help info. 
.TP
.B
\fB--info\fP [\fIstring\fP]
Get help on a specific module or option.  Default value ''. 
.TP
.B
\fB--leaf_size\fP (\fB-l\fP) [\fIint\fP]
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. 
.TP
.B
\fB--naive\fP (\fB-n\fP)
Compute the MST using \fBO\fP(n^2) naive algorithm. 
.TP
.B
\fB--output_file\fP (\fB-o\fP) [\fIstring\fP]
Data output file. Stored as an edge list.  Default value 'emst_output.csv'. 
.TP
.B
\fB--verbose\fP (\fB-v\fP)
Display informational messages and the full list of parameters and timers at the end of execution. 
.TP
.B
\fB--version\fP (\fB-V\fP)
Display the version of mlpack.
.SH ADDITIONAL INFORMATION

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