Description Usage Arguments Details Value References Examples

Calculates the minimum spanning tree distance, in kilometers, using Prim's Algorithm [1]

1 | ```
MSTDist(longs, lats)
``` |

`longs` |
- Longitudinal occurrences in decimal degrees |

`lats` |
- Latitudinal occurrences in decimal degrees |

Uses Prim's algorithm for finding the minimum spanning tree, time-consuming calculation as the number of locations increases past 1000

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

[1] Prim, R.C. 1957. Shortest Connection Networks and Some Generalizations. The Bell System Technical Journal 36:1389-1401.

1 2 3 |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.