[mlpack] [mlpack/mlpack] EMST non-optimal for d = 2 sets of forests (#823)

[Matt Piekenbrock]

The goal is to calculate the minimum spanning tree of the dissimilarity matrix, where each row represents the set of these special distances from that point (indexed by row) to every other point in the database (indexed by column), yes. The diagonal is purposefully non-zero. You shouldn't need the original 100 points, except to verify the output of SciKit's implementation, which doesn't accept a pre-built dissimilarity matrix. 

-- 
You are receiving this because you are subscribed to this thread.
Reply to this email directly or view it on GitHub:
https://github.com/mlpack/mlpack/issues/823#issuecomment-264068932
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://knife.lugatgt.org/pipermail/mlpack/attachments/20161130/0ffd05f4/attachment.html>