findShortestChains

Find the shortest paths between arrays

internal

Designed for studies where animals tagged with acoustic tags are expected
to move through receiver arrays. This package combines the advantages of automatic sorting and checking
of animal movements with the possibility for user intervention on tags that deviate from expected
behaviour. The three analysis functions (explore(), migration() and residency())
allow the users to analyse their data in a systematic way, making it easy to compare results from
different studies.
CJS calculations are based on Perry et al. (2012) <https://www.researchgate.net/publication/256443823_Using_mark-recapture_models_to_estimate_survival_from_telemetry_data>.

Hugo Fl<c3><a1>vio

actel

Acoustic Telemetry Data Analysis

Hugo Flávio

findShortestChains function

<dl><dt>input</dt>
<dd>An array list</dd></dl>

Arguments

Find the shortest paths between arrays — findShortestChains

<dl>

<dt>input</dt>
<dd>An array list</dd>

</dl>

findShortestChains: Find the shortest paths between arrays

Description

Usage

Value

Arguments