namespace kgraph;
class KGraph {
public:
struct IndexInfo {
enum StopCondition {
ITERATION = 0,
DELTA,
RECALL
} stop_condition; # which condition leads to the stop of the iteration.
unsigned iterations; # number of iterations.
float cost; # number of distance computations divided by N(N-1)/2.
float recall; # average of recall @ K for the control points.
float accuracy; # average relative error of K-NN distances. Doesn't make much sense for negative distances.
float delta; # recall improvement of last iteration.
float M; # guideline for setting L -- L should be larger than returned M.
};
};
}