LANDSCAPE CONNECTIVITY STATION

Corridor Current

Open wildlife crossings. Spread the migration. A fast route is only useful if it does not become a bottleneck.

Restore up to four crossings

DifficultyPeak flowBudget
Gold = restoredRed = over capacityLine width = flow share

The crossing ledger

Tap a crossing to triple its permeability. Tap again to undo. All route flows recalculate together; restore alternate paths to relieve crowded ones.

Compare the baseline routes, then restore crossings with room to share the flow.

Field notes · model & source

The network treats habitat crossings as conductances. A unit migration flow is injected at the western reserve and removed at the eastern reserve. A grounded graph-Laplacian solve distributes it over every connected path. Difficulty is the resulting effective resistance; lower is better. Crossings must all stay under the displayed flow cap.

Restoration triples a crossing’s conductance. The dry-season scenario reduces one route’s permeability, while fragile crossings use a tighter crowding limit. New landscape changes baseline conductances, targets and the dry-season crossing. These are synthetic game landscapes, not wildlife forecasts.

Model adapted from Circuitscape.jl network build_graph and core solve_pairs! (MIT, Ranjan Anantharaman, Viral B. Shah, Julia Computing). Original small dense browser solver, levels and interface; locally bundled GPT habitat artwork. See LICENSE.txt.