annotate src/samer/mds/DistanceTask.java @ 8:5e3cbbf173aa tip

Reorganise some more
author samer
date Fri, 05 Apr 2019 22:41:58 +0100
parents bf79fb79ee13
children
rev   line source
samer@0 1 package samer.mds;
samer@0 2
samer@0 3 // import samer.core.*;
samer@0 4 import samer.maths.*;
samer@0 5 import samer.tools.*;
samer@0 6
samer@0 7 /**
samer@0 8 Transfer distances directly from a distance matrix to an MDS
samer@0 9 object's distance vector.
samer@0 10 */
samer@0 11 public class DistanceTask extends AnonymousTask
samer@0 12 {
samer@0 13 int N;
samer@0 14 double [] d; // linear array of distances
samer@0 15 double [][] _D; // matrix of source data
samer@0 16
samer@0 17 /** link each object to all the others using distances in matrix, returns a task
samer@0 18 that can be used to refresh distances from original matrix */
samer@0 19 public DistanceTask(MDSBase mds, Matrix D) {
samer@0 20 N = D.getRowDimension();
samer@0 21
samer@0 22 d=new double[N*(N - 1)/2];
samer@0 23 _D=D.getArray();
samer@0 24
samer@0 25 mds.clearLinks(d);
samer@0 26 for (int k=0, i=0; i<N; i++)
samer@0 27 for (int j=i+1; j<N; j++) mds.setLink(k++,i,j);
samer@0 28
samer@0 29 run();
samer@0 30 }
samer@0 31
samer@0 32 public Vec getDistances() { return new Vec.ForArray(d); }
samer@0 33 public void run() {
samer@0 34 for (int k=0, i=0; i<N; i++) {
samer@0 35 double [] Drow=_D[i];
samer@0 36 for (int j=i+1; j<N; j++) d[k++]=Drow[j];
samer@0 37 }
samer@0 38 }
samer@0 39 }