Nearest neighbor graph
id:
nearest-neighbor-graph-273-16152363
title:
Nearest neighbor graph
text:
The nearest neighbor graph (NNG) is a directed graph defined for a set of points in a metric space, such as the Euclidean distance in the plane. The NNG has a vertex for each point, and a directed edge from p to q whenever q is a nearest neighbor of p, a point whose distance from p is minimum among all the given points other than p itself. In many uses of these graphs, the directions of the edges are ignored and the NNG is defined instead as an undirected graph. However, the nearest neighbor rel
brand slug:
wiki
category slug:
encyclopedia
description:
Type of directed graph
original url:
https://en.wikipedia.org/wiki/Nearest_neighbor_graph
date created:
date modified:
2024-04-04T01:06:36Z
main entity:
{"identifier":"Q2855103","url":"https://www.wikidata.org/entity/Q2855103"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/22/Nearest_neighbor_graph.svg","width":145,"height":143}
fields total:
13
integrity:
15