kd tree python_Python 实现 KD-Tree 最近邻算法

这里将写了一个KDTree类，仅实现了最近邻，K近邻之后若有时间再更新：

from collections import namedtuple

from operator import itemgetter

from pprint import pformat

import numpy as np

class Node(namedtuple('Node', 'location left_child right_child')):

def __repr__(self):

return pformat(tuple(self))

class KDTree():

def __init__(self, points):

self.tree = self._make_kdtree(points)

if len(points) > 0:

self.k = len(points[0])

else:

self.k = None

def _make_kdtree(self, points, depth=0):

if not points:

return None

k = len(points[0])

axis = depth % k

points.sort(key=itemgetter(axis))

median = len(points) // 2

return Node(

location=points[median],

left_child=self._make_kdtree(points[:median], depth +