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

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

Author: rcurtin
Date: Wed Sep 11 14:19:17 2013
New Revision: 15757

Log:
Update documentation for new output; squared length is not given.


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	Wed Sep 11 14:19:17 2013
@@ -57,7 +57,7 @@
 [INFO ] Tree built, running algorithm.
 [INFO ] 4 edges found so far.
 [INFO ] 5 edges found so far.
-[INFO ] Total squared length: 1002.45
+[INFO ] Total spanning tree length: 1002.45
 [INFO ] Saving CSV data to 'edge_list.csv'.
 [INFO ]
 [INFO ] Execution parameters:
@@ -96,7 +96,7 @@
 2.0000000000e+00,4.0000000000e+00,9.9700451353e+02
 @endcode
 
-The input points are labeled 0-5.  The output tells us that the MST connects point 0 to point 3, point 4 to point 5, point 1 to point 3, point 1 to point 2, and point 2 to point 4, with the corresponding edge weights given in the third column.  The total squared length of the MST is also given in the verbose output.
+The input points are labeled 0-5.  The output tells us that the MST connects point 0 to point 3, point 4 to point 5, point 1 to point 3, point 1 to point 2, and point 2 to point 4, with the corresponding edge weights given in the third column.  The total length of the MST is also given in the verbose output.
 
 Note that it is also possible to compute the EMST using a naive (\f$O(N^2)\f$) algorithm for timing and comparison purposes.