/usr/share/octave/packages/geometry-1.7.0/graphs/knnGraph.m is in octave-geometry 1.7.0-1build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 | ## Copyright (C) 2004-2011 David Legland <david.legland@grignon.inra.fr>
## Copyright (C) 2004-2011 INRA - CEPIA Nantes - MIAJ (Jouy-en-Josas)
## Copyright (C) 2012 Adapted to Octave by Juan Pablo Carbajal <carbajal@ifi.uzh.ch>
## All rights reserved.
##
## Redistribution and use in source and binary forms, with or without
## modification, are permitted provided that the following conditions are met:
##
## 1 Redistributions of source code must retain the above copyright notice,
## this list of conditions and the following disclaimer.
## 2 Redistributions in binary form must reproduce the above copyright
## notice, this list of conditions and the following disclaimer in the
## documentation and/or other materials provided with the distribution.
##
## THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ''AS IS''
## AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
## IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
## ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
## ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
## DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
## SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
## CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
## OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
## OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
## -*- texinfo -*-
## @deftypefn {Function File} {@var{edges} = } knnGrpah (@var{nodes})
## Create the k-nearest neighbors graph of a set of points
##
## EDGES = knnGraph(NODES)
##
## Example
## @example
##
## nodes = rand(10, 2);
## edges = knnGraph(nodes);
## drawGraph(nodes, edges);
##
## @end example
##
## @end deftypefn
function edges = knnGraph(nodes, varargin)
# get number of neighbors for each node
k = 2;
if ~isempty(varargin)
k = varargin{1};
end
# init size of arrays
n = size(nodes, 1);
edges = zeros(k*n, 2);
# iterate on nodes
for i = 1:n
dists = distancePoints(nodes(i,:), nodes);
[dists inds] = sort(dists); ##ok<ASGLU>
for j = 1:k
edges(k*(i-1)+j, :) = [i inds(j+1)];
end
end
# remove double edges
edges = unique(sort(edges, 2), 'rows');
endfunction
%!demo
%! nodes = rand(10, 2);
%! edges = knnGraph(nodes);
%! drawGraph(nodes, edges);
%! axis tight
|