MSTDist: Calculates the minimum spanning tree distance, in kilometers, using Prim's Algorithm [1]
Description
Calculates the minimum spanning tree distance, in kilometers, using Prim's Algorithm [1]
Usage
MSTDist(longs, lats)
Arguments
longs
- Longitudinal occurrences in decimal degrees
lats
- Latitudinal occurrences in decimal degrees
Value
Returns the minimum spanning tree distance in kilometers, the pairwise distance matrix of occurrences, the order points were connected in, and a 2-column array of coordinates
Details
Uses Prim's algorithm for finding the minimum spanning tree, time-consuming calculation as the number of locations increases past 1000
References
[1] Prim, R.C. 1957. Shortest Connection Networks and Some Generalizations. The Bell System Technical Journal 36:1389-1401.