private <T> LinkedList<ClusterPair> createLinkages(double[][] distances, List<Cluster<T>> clusters) { LinkedList<ClusterPair> linkages = new LinkedList<ClusterPair>(); for (int col = 0; col < clusters.size(); col++) { Cluster cluster_col = clusters.get(col); for (int row = col + 1; row < clusters.size(); row++) { ClusterPair link = new ClusterPair(); link.setLinkageDistance(distances[0][accessFunction(row, col, clusters.size())]); link.setlCluster(cluster_col); link.setrCluster(clusters.get(row)); linkages.add(link); } } return linkages; }
private DistanceMap createLinkages(double[][] distances, List<Cluster> clusters) { DistanceMap linkages = new DistanceMap(); for (int col = 0; col < clusters.size(); col++) { Cluster cluster_col = clusters.get(col); for (int row = col + 1; row < clusters.size(); row++) { ClusterPair link = new ClusterPair(); Double d = distances[0][accessFunction(row, col, clusters.size())]; link.setLinkageDistance(d); link.setlCluster(cluster_col); link.setrCluster(clusters.get(row)); linkages.add(link); } } return linkages; }
private DistanceMap createLinkages(double[][] distances, List<Cluster> clusters) { DistanceMap linkages = new DistanceMap(); for (int col = 0; col < clusters.size(); col++) { Cluster cluster_col = clusters.get(col); for (int row = col + 1; row < clusters.size(); row++) { ClusterPair link = new ClusterPair(); Double d = distances[0][accessFunction(row, col, clusters.size())]; link.setLinkageDistance(d); link.setlCluster(cluster_col); link.setrCluster(clusters.get(row)); linkages.add(link); } } return linkages; }