[mlpack-svn] r16886 - mlpack/trunk/doc/tutorials/emst

[fastlab-svn at coffeetalk-1.cc.gatech.edu]

Author: rcurtin
Date: Mon Jul 28 10:32:06 2014
New Revision: 16886

Log:
Propagate documentation fixes to trunk.


Modified:
   mlpack/trunk/doc/tutorials/emst/emst.txt

Modified: mlpack/trunk/doc/tutorials/emst/emst.txt
==============================================================================
--- mlpack/trunk/doc/tutorials/emst/emst.txt	(original)
+++ mlpack/trunk/doc/tutorials/emst/emst.txt	Mon Jul 28 10:32:06 2014
@@ -17,9 +17,10 @@
 of data.  A <em>single-linkage clustering</em> can be obtained from the EMST by deleting
 all edges longer than a given cluster length.  This technique is also referred to as a <em>Friends-of-Friends</em> clustering in the astronomy literature.
 
-MLPACK includes an implementation of <b>Dual-Tree Boruvka</b> on \f$kd\f$-trees,
-the empirically and theoretically fastest EMST algorithm.  For more details,
-see the following paper:
+MLPACK includes an implementation of <b>Dual-Tree Boruvka</b> which uses
+\f$kd\f$-trees by default; this is the empirically and theoretically fastest
+EMST algorithm.  In addition, the implementation supports the use of different
+trees via templates.  For more details, see the following paper:
 
 @code
 @inproceedings{march2010fast,
@@ -118,7 +119,10 @@
 
 The 'DualTreeBoruvka' class contains our implementation of the Dual-Tree Boruvka algorithm.
 
-The class has two constructors: the first takes the data set, constructs the \f$kd\f$-tree, and computes the MST.  The second takes data set and an already constructed tree.
+The class has two constructors: the first takes the data set, constructs the
+tree (where the type of tree constructed is the TreeType template parameter),
+and computes the MST.  The second takes data set and an already constructed
+tree.
 
 The class provides one method that performs the MST computation:
 @code