info.debatty.java.graphs.CallbackInterface 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.util.HashMap;

/**
 *
 * @author Thibault Debatty
 */
public interface CallbackInterface {

    /**
     *
     * @param data hashmap containing info about current state of algorithm
     */
    void call(HashMap data);
}