This repository contains the Python implementation of an agent-based model investigating how heterogeneous mobility and boundary-crossing dynamics generate large-scale connectivity in structured multi-attractor landscapes. A small fraction of higher-mobility agents explores the environment while the remaining agents stay locally constrained. The model compares pure random-walk exploration, interface-sensitive dynamics, novelty-biased exploration, and a flat-landscape control. The release includes the complete simulation framework, the experimental pipeline used in the associated paper, multi-K and population-scaling robustness analyses, network-snapshot and transition-slope analyses, and reproducibility documentation. Transition networks are analysed using graph density, connected components, and giant weakly connected components. The implementation is compatible with Python 3.11 and is released under the MIT License.