Habitat connectivity analysis
in your browser

Upload habitat patch polygons, set dispersal parameters, and compute PC, IIC and dPC importance metrics — without installing software or writing code. Built for ecologists, conservation planners, and environmental consultants.

PC IIC EC(PC) dPC dPCintra dPCflux dPCconnector NL NC H CCP LCP dIIC dBC(PC)

How it works

Step 1
Upload your habitat patches
Import polygon data as GeoPackage (.gpkg) or by drawing patches directly on the map. Define edge weights manually or from existing GIS layers.
Step 2
Set dispersal parameters
Enter one or more distance thresholds and a species-specific dispersal probability. The tool models dispersal as an exponential kernel: p = e−θd.
Step 3
Run the analysis
Results arrive in seconds to minutes depending on network size. Patch importance scores (dPC, dPCintra, dPCflux, dPCconnector) are shown in both table and map view.
Step 4
Compare and export
Edit the network, run a second analysis, and compare connectivity metrics side by side. Export results to Excel or a structured PDF report.

Built for field ecologists and planners

Conservation planning
Identify critical patches
Rank habitat patches by their contribution to landscape connectivity. Prioritise protection or restoration where it matters most.
Environmental assessment
Quantify connectivity loss
Compare before and after scenarios for infrastructure projects. Report EC(PC) and dPC change in a format ready for EIA documentation.
Habitat restoration
Prioritise corridor locations
Add candidate stepping stones or corridors to the network and immediately see their effect on overall connectivity.
Landscape ecology research
Species dispersal modelling
Model dispersal across fragmented landscapes using species-specific kernels. Compare multiple dispersal distances in a single analysis run.

Academic-grade connectivity metrics

PC (Probability of Connectivity) and IIC (Integral Index of Connectivity) are the standard graph-theoretic metrics for habitat connectivity analysis (Pascual-Hortal & Saura, 2006; Saura & Pascual-Hortal, 2007). ekokrati implements both, together with the dPC importance decomposition (intra-patch, flux, and connector components) that identifies which individual patches drive landscape connectivity.

Dispersal is modelled as an exponential distance kernel: p = exp(−θd), where θ is fitted from a species-specific dispersal distance and reference probability. All metrics are computed on an exact graph — no approximations or heuristic path pruning.

Pascual-Hortal & Saura (2006). Comparison and development of new graph-based landscape connectivity indices. Landscape Ecology 21, 959–967. · Saura & Pascual-Hortal (2007). A new habitat availability index to integrate connectivity in landscape conservation planning. Landscape and Urban Planning 83, 91–103.

Request access

ekokrati is currently available as an invitation-only trial. Fill in the form below and we will be in touch — typically within a few working days. Academic and non-commercial use is free.

Request received.
We'll be in touch at the email address you provided. Thank you for your interest in ekokrati.