Assume you have two sets of points: say **βPβ** and **βCβ**. Further imagine you want to have a network that connects each point of the first set with a predefined number of its nearest neighbors in the second set (input **βNβ**) or to points in set two that lie within a given distance **βLDistβ**. In that case the βNearest Neighborβ-component will be the right choice (see fig. 3.8.2.1). It outputs at **βPβ** a data tree with branches containing the points of set **βCβ** which are closest to the **βPβ**-points. The order of branches corresponds to the points in **βPβ**. The output **βiβ** returns the indexes of the nodes in **βCβ**, and **βDβ** the distances.