Search for: [Abstract = %22GraphScape is a stand%5C-alone software that exploit vector maps of landscape mosaics. It identifies the shortest path between chosen patches. The shortest path is defined as the path with the minimal sum of resistances for patches and borders to be crossed. Three categories of resistances are incorporated to modify the minimum spanning tree%5C: %5C(a%5C) Patch class resistance %5C(based on the patch suitability for a given species and%5C%2For process%5C)%5C%3B %5C(b%5C) Resistance of a patch%5C-to%5C-patch transfer %5C(based on structural%5C%2Fecological similarity of adjacent patches%5C)%5C%3B %5C(c%5C) Resistance of the patch size and shape %5C(based on a preferred patch size%5C%2Fshape metrics%2C e.g. the radius of gyration%5C). When all the resistances are not determined %5C(and equal one by convention%5C) then the shortest path is defined as the path with the minimal number of borders to be crossed. On the basis of the identified paths some new landscape metrics are proposed for the Patch and Class levels%2C e.g.%5C: %5C%5BMean%5C%5D Number of Steps%2C %5C%5BTransfer%5C%2FPatch_Type%5C%2FPatch_Size%5C%5D Weighted Number of Steps%2C Path Elongation %5C(%3DWeighted Number of Steps %5C%2F Number of Steps%5C)%2C Path Sum of Resistance%2C Mean Path Sum of Resistance. Depending on the way of patches choice and resistance defining%2C the results are useful for identifying%2C describing and illustrating%5C: %5C(a%5C) Patch and Patch class isolation%5C%3B %5C(b%5C) Paths in the landscape%5C%3B %5C(c%5C) Critical patches %5C(nodes for many paths or with the highest resistance%5C). The ecological sense and practical usefulness of the results depend of the kind and accuracy of the input map%22]

Number of results: 0