info.debatty.java.graphs.SimilarityInterface Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of java-graphs Show documentation

Algorithms that build k-nearest neighbors graph (k-nn graph): Brute-force, NN-Descent,...

There is a newer version: 0.41

package info.debatty.java.graphs;

import java.io.Serializable;

/**
 *
 * @author tibo
 * @param 
 */
public interface SimilarityInterface extends Serializable {
    public double similarity(t value1, t value2);
}