The first was my childhood neighbor in Greensboro, n.

第一个是我童年时在北卡罗来纳州格林斯·伯勒的邻居。

youdao

Let G be a graph and let V(G) be the vertex set of G. Define the neighborhood complex N(G) as the simplicial complex whose simplices are those subsets of V(G) which have a common neighbor.

一个图G的邻域复形是以G的顶点为顶点，以G的具有公共邻接顶点的顶点子集为单形的抽象复形。

youdao

However, in such clustering algorithms, the search for nearest neighbor in the construction of minimum spanning trees is the main source of computation and the standard solutions take o (N-2) time.

然而，在这样的聚类算法，对最近在最小生成树建设邻居搜索是计算的主要来源和标准的解决方案采取的O (N - 2)的时间。

youdao