Applying novel connectivity networks to wood turtle populations to provide comprehensive conservation management strategies for species at risk
Fig 1
Illustration of the BRIDES algorithm and the selection process.
(A) Example of the six types of paths computed in BRIDES by comparing the shortest path between pairs of nodes in subgraph Xn (white nodes) and the shortest path between the same pairs of nodes in the complete graph Xall including all candidate nodes (blue nodes). In Xall, the shortest path between any pair of nodes from Xn must include at least one of these candidate nodes. (B) Each of the three nodes available for the selection process was iteratively added to Xn to create the subgraphs Xn+1 and corresponding scores were computed with respect to the complete graph Xall. The selection process selected node 11 as the best candidate (score = 1) to maximize network connectivity while minimizing the number of additional nodes. The weighted model used for the selection process was (1, 0, 0, 0, 1, 1).