We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b45e9b3 commit b4b94cbCopy full SHA for b4b94cb
README.md
@@ -9,7 +9,7 @@ If D is the matrix with the distances. Then
9
10
G2, W2 = TreeRep.metric_to_structure_no_recursion(D,undef,undef)
11
12
-will return the tree structure G2 and the Weights W2. Now if D is n by n, then W2 will be 2n by 2n (unless changed as described above). Running
+will return the tree structure G2 and the Weights W2. Now if D is n by n, then W2 will be 2n by 2n (unless changed as described below). Running
13
14
B = W2[1:nv(G2),1:nv(G2)];
15
B = sparse(B);
0 commit comments