普里姆算法（Prim算法），图论中的一种算法，可在加权连通图里搜索最小生成树。意即由此算法搜索到的边子集所构成的树中，不但包括了连通图里的所有顶点（英语：Vertex (graph theory)），且其所有边的权值之和亦为最小。该算法于1930年由捷克数学家沃伊捷赫·亚尔尼克（英语：Vojtěch Jarník）发现；并在1957年由美国计算机科学家罗伯特·普里姆（英语：Robert C. Prim）独立发现；1959年，艾兹格·迪科斯彻再次发现了该算法。因此，在某些场合，普里姆算法又被称为DJP算法、亚尔尼克算法或普里姆－亚尔尼克算法。
Prim algorithm, an algorithm in graph theory, searches for the smallest spanning tree in a weighted connected graph. That is to say, the tree formed by the edge subset searched by the algorithm not only includes all vertices in the connected graph (English: Vertex (graph theory), but also the sum of the weights of all the edges is the smallest. The algorithm was discovered by the Czech mathematician Vojtch Jarnk in 1930; by the American computer scientist Robert C. Prim in 1957; and by Ezger Dikorsch in 1959. Therefore, in some cases, Prim algorithm is also known as DJP algorithm, Arnick algorithm or Prim-Arnick algorithm. (2018-10-03, matlab, 1KB, 下载0次)
实现kdtree算法，k-d树（k-dimensional树的简称），是一种分割k维数据空间的数据结构。主要应用于多维空间关键数据的搜索（如：范围搜索和最近邻搜索）。
To implement kdtree algorithm, k-d tree (abbreviation of k-dimensional tree) is a data structure that partitioned K dimension data space. It is mainly applied to search for key data in multidimensional space (such as range search and nearest neighbor search). (2018-06-18, matlab, 211KB, 下载6次)