Assertion: neighbor graph | /r/HasProperty | connected by edge
Facets:
Source sentences:
text: The k-nearest neighbor graph (k-NNG) is a graph in which two vertices p and q are connected by an edge, if the distance between p and q is among the k-th smallest distances from p to other objects from P.