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
Show all versions of java-graphs Show documentation
Algorithms that build k-nearest neighbors graph (k-nn graph): Brute-force, NN-Descent,...
package info.debatty.java.graphs;
import java.io.Serializable;
/**
*
* @author tibo
* @param
*/
public interface SimilarityInterface extends Serializable {
public double similarity(T node1, T node2);
}