1mlpack_emst(1) General Commands Manual mlpack_emst(1)
2
3
4
6 mlpack_emst - fast euclidean minimum spanning tree
7
9 mlpack_emst [-h] [-v]
10
12 This program can compute the Euclidean minimum spanning tree of a set
13 of input points using the dual-tree Boruvka algorithm.
14
15 The output is saved in a three-column matrix, where each row indicates
16 an edge. The first column corresponds to the lesser index of the edge;
17 the second column corresponds to the greater index of the edge; and the
18 third column corresponds to the distance between the two points.
19
21 --input_file (-i) [string]
22 Data input file.
23
25 --help (-h)
26 Default help info.
27
28 --info [string]
29 Get help on a specific module or option. Default value ''.
30
31 --leaf_size (-l) [int]
32 Leaf size in the kd-tree. One-element leaves give the empiri‐
33 cally best performance, but at the cost of greater memory
34 requirements. Default value 1.
35
36 --naive (-n)
37 Compute the MST using O(n^2) naive algorithm.
38
39 --verbose (-v)
40 Display informational messages and the full list of parameters
41 and timers at the end of execution.
42
43 --version (-V)
44 Display the version of mlpack.
45
47 --output_file (-o) [string]
48 Data output file. Stored as an edge list. Default value ''.
49
52 For further information, including relevant papers, citations, and the‐
53 ory, For further information, including relevant papers, citations, and
54 theory, consult the documentation found at http://www.mlpack.org or
55 included with your consult the documentation found at
56 http://www.mlpack.org or included with your DISTRIBUTION OF MLPACK.
57 DISTRIBUTION OF MLPACK.
58
59
60
61 mlpack_emst(1)