spatgraphs-rmst_graph {spatgraphs} | R Documentation |
rmst_graph
Description
Compute the adjacency matrix for point pattern X using the minimum spanning tree rule. That is, compute the spanning tree of the point pattern such that the sum of the resulting edges is minimal. Computed using Prim's algorithm. See e.g.
http://en.wikipedia.org/wiki/Prim's_algorithm
.
Arguments
pp |
Point pattern with (at least) members x,y,n |
Details
Date: | 2007-03-01 |
License: | GPL v2 or later |
[Package
spatgraphs version 0.2
Index]