Description: In data mining, artificial intelligence and other areas, it is commonly used to KD tree to find K nearest neighbor. This procedure is K neighbor Finder C++ they used to achieve a KD tree to carry out, including achievements and search. File with the test file.
To Search:
File list (Check if you may need any files):
findKN\Debug\findKN.exe
......\.....\findKN.ilk
......\.....\findKN.pdb
......\findKN\Debug\CL.read.1.tlog
......\......\.....\CL.write.1.tlog
......\......\.....\findKN.Build.CppClean.log
......\......\.....\findKN.exe.intermediate.manifest
......\......\.....\findKN.lastbuildstate
......\......\.....\findKN.log
......\......\.....\findKN.write.1.tlog
......\......\.....\KDTree.obj
......\......\.....\link.read.1.tlog
......\......\.....\link.write.1.tlog
......\......\.....\main.obj
......\......\.....\mt.read.1.tlog
......\......\.....\mt.write.1.tlog
......\......\.....\vc100.idb
......\......\.....\vc100.pdb
......\......\findKN.vcxproj
......\......\findKN.vcxproj.filters
......\......\findKN.vcxproj.user
......\......\KDTree.cpp
......\......\KDTree.h
......\......\main.cpp
......\......\maomi.txt
......\......\myfile2.txt
......\findKN.sdf
......\findKN.sln
......\findKN.suo
......\ipch\findkn-ee3a0928\findkn-bef53c66.ipch
......\findKN\Debug
......\ipch\findkn-ee3a0928
......\Debug
......\findKN
......\ipch
findKN
Download