k近邻法的C++实现：kd树(四)
?
315 int main()
316 {
317 ? ? vector > train(6, vector(2, 0));
318 ? ? for (unsigned i = 0; i < 6; ++i)
319 ? ? ? ? for (unsigned j = 0; j < 2; ++j)
320 ? ? ? ? ? ? train[i][j] = data[i][j];
321?
322 ? ? KdTree* kdTree = new KdTree;
323 ? ? buildKdTree(kdTree, train, 0);
324?
325 ? ? printKdTree(kdTree, 0);
326?
328 ? ? goal.push_back(3);
329 ? ? goal.push_back(4.5);
330 ? ? vector nearestNeighbor = searchNearestNeighbor(goal, kdTree);
331 ? ? vector::iterator beg = nearestNeighbor.begin();
332 ? ? cout << "The nearest neighbor is: ";
333 ? ? while(beg != nearestNeighbor.end()) cout << *beg++ << ",";
334 ? ? cout << endl;
335 ? ? return 0;
336 }