Out of many approaches to landscape connectivity, we choose patch-mosaic, flow-neutral framework for modelling. Our new software system GraphScape transforms a vector mosaic map into landscape graph, finds shortest paths and combines them into minimum spanning tree. The result is an optimal network of connections for a given set of patches. To capture mobile agent properties, we use two types of resistance assigned to patches and transfer resistance assigned to combinations of patch classes. Another alternative is step-model, when transfers occur as if on unweighted graph. Resulting MST is rendered by linear skeleton (binary), Transit Density measure assignable to patches (continuous), and summary statistics. A novelty is compete workflow from vector-based map to complex graph structures. We describe concepts and operation of software. GraphScape can be used for ecological corridors planning, identification of key areas of corridors overlap, identification of the role of particular mobility factors, assessment of patch isolation.

在许多用于景观连通性的方法中，我们选择贴片马赛克，流量中性的框架进行建模。我们的新软件系统GraphScape将矢量镶嵌图转换为景观图，找到最短路径并将其组合为最小生成树。结果是给定补丁集的最佳连接网络。为了捕获移动代理属性，我们使用分配给补丁的两种类型的电阻和分配给补丁类组合的转移电阻。另一种选择是步模型，当发生转移时就像在未加权图上一样。生成的MST由线性骨架（二进制），可分配给补丁的“运输密度”度量（连续）以及摘要统计信息呈现。从基于矢量的地图到复杂的图形结构的竞争工作流程是一种新颖。我们描述软件的概念和操作。