📄 compute_nn_graph.m
字号:
function [D,A] = compute_nn_graph(X,options)
% compute_nn_graph - compute nearest neighbor graph
%
% [D,A] = compute_nn_graph(X,options);
%
% X is an array of points, size must be (dimension x nbr_points)
% X(:,i) is the ith point.
%
% D is the graph matrix : D(i,j)==Inf if point i and j are not connected,
% D(i,j)=|X(:,i)-X(:,j)| otherwise
%
% The graph can be computed using two modes:
% options.nn_epsilon=dist_between_NN ==> use epsilon-based NN mode
% options.nn_nbr=#NN ==> use k-based NN mode.
% options.nn_automatic=#NN ==> evaluate epsilon to match the
% k-NN (tends to prune outliers.
%
% Copyright (c) 2005 Gabriel Peyr
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -