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,...

The newest version!

package info.debatty.java.graphs;

import java.io.Serializable;

/**
 *
 * @author tibo
 * @param 
 */
public interface SimilarityInterface extends Serializable {

    /**
     * Compute the similarity between two nodes.
     * @param node1
     * @param node2
     * @return
     */
    double similarity(final T node1, final T node2);
}