e/Nearest neighbor graph

Information
has gloss	eng: The nearest neighbor graph (NNG) for a set of n objects P in a metric space (e.g., for a set of points in the plane with Euclidean distance) is a directed graph with P being its vertex set and with a directed edge from p to q whenever q is a nearest neighbor of p (i.e., the distance from p to q is no larger than from p to any other object from P).
lexicalization	eng: nearest neighbor graph
lexicalization	eng: Nearest-neighbor graph
instance of	c/Geometric graphs