Beyond the least-cost path: evaluating corridor redundancy using a graph-theoretic approach
- First Online:
- Cite this article as:
- Pinto, N. & Keitt, T.H. Landscape Ecol (2009) 24: 253. doi:10.1007/s10980-008-9303-y
- 1.3k Downloads
The impact of the landscape matrix on patterns of animal movement and population dynamics has been widely recognized by ecologists. However, few tools are available to model the matrix’s influence on the length, relative quality, and redundancy of dispersal routes connecting habitat patches. Many GIS software packages can use land use/land cover maps to identify the route of least resistance between two points—the least-cost path. The limitation of this type of analysis is that only a single path is identified, even though alternative paths with comparable costs might exist. In this paper, we implemented two graph theory methods that extend the least-cost path approach: the Conditional Minimum Transit Cost (CMTC) tool and the Multiple Shortest Paths (MSPs) tool. Both methods enable the visualization of multiple dispersal routes that, together, are assumed to form a corridor. We show that corridors containing alternative dispersal routes emerge when favorable habitat is randomly distributed in space. As clusters of favorable habitat start forming, corridors become less redundant and dispersal bottlenecks become visible. Our approach is illustrated using data from a real landscape in the Brazilian Atlantic forest. We explored the effect of small, localized disturbance on dispersal routes linking conservation units. Simulated habitat destruction caused the appearance of alternative dispersal routes, or caused existing corridors to become narrower. These changes were observed even in the absence of significant differences in the length or cost of least-cost paths. Last, we discuss applications to animal movement studies and conservation initiatives.