readme

来自「vpTrick algorithms code」· 代码 · 共 37 行

================================================================
 VP-tree  with tricky visiting order (version 1.0)  memory-based
================================================================


1. File description
	buildvptree.c	-->  main program for building vp-tree
	knnsearch.c	-->  main program for k-nn search with vp-tree
	vptree.c	-->  functions for building and searching
	vptree.h	-->  common data structure and global variables
	qsort.c		-->  qsort and bubble sort functions
	qsort.h
	standard.h
	Makefile	-->  compile buildvptree and knnsearch
	README		-->  this file


2. Compilation
	type:	make


3. Usage
	type: 	buildvptree	--> this will displays the usage of buildvptree
	type: 	knnsearch 	--> this will displays the usage of knnsearch 


4. Special variable setting
	You may need to change the following values for your experiments.

	_NUM_CAND_VP (vptree.h)		 --> no. of candidate VPs for the VP selection	
	_NUM_PT_RANDOM_SUBSET (vptree.h> --> min. no. of points in random subset for the VP selection
	_MAX_POINTS_NODE (vptree.h)      --> Maximum number of points in a node
	_MIN_POINTS_NODE (vptree.h>      --> Minimum number of points in a node