- // private int[] findMinimalDistance() {
- // // if more than one minimal distances, always the first found is
- // // returned
- // // i could randomize this, so that any would be returned in a randomized
- // // fashion...
- // double minimum = Double.MAX_VALUE;
- // int otu_1 = -1;
- // int otu_2 = -1;
- // for( int j = 1; j < _n; ++j ) {
- // for( int i = 0; i < j; ++i ) {
- // if ( _m.getValue( i, j ) < minimum ) {
- // minimum = _m.getValue( i, j );
- // otu_1 = i;
- // otu_2 = j;
- // }
- // }
- // }
- // return new int[] { otu_1, otu_2 };
- // }