Habitat networks

conn.centrality#

The centralities of every node (Makurhini's MK_RMCentrality): degree (or strength), eigenvector, closeness, betweenness (igraph's) and cluster, on the links shorter than the distance, or on probabilities. A row per node and distance.

Input	Type	What it is
graphrequired	habitat_graph	a habitat graph of distances

Output	Type	What it is
table	table	the centralities

Setting	Type	What it is
distance	any	the link distance, or several (default: Makurhini's median of the distances)
probability	number	the probability at that distance: centralities on probabilities
binary	bool	links (default true), else probabilities exp(-d / distance)

conn.components#

The component (1, 2...) of every node: the groups of nodes joined by links at the distance.

Input	Type	What it is
graphrequired	habitat_graph	a habitat graph

Output	Type	What it is
table	table	id and component

Setting	Type	What it is
distance	number	the link distance (default: Makurhini's median of the distances)

conn.connectivity_grid#

Connectivity per cell of a grid over a region (Makurhini's MK_Connect_grid, landschaft's connectivity_grid): ProtConn's indicators of the protected areas in each cell, or the PC of their dissolved parts (Protected_surface, LA, ECA, ECA_Normalized, PC).

Input	Type	What it is
protectedrequired	vector	the protected areas (polygons)
regionrequired	vector	the region
grid	vector	the cells (else made with cell_area)

Output	Type	What it is
grid	vector	the cells with the indicators

Setting	Type	What it is
cell_area	number	the cells' area, in the region's units squared
hexagonal	bool	hexagons (default) or squares
distancerequired	number	the median dispersal distance
protconn_index	bool	ProtConn's indicators (default true), else PC
probability	number	the probability at that distance (default 0.5)
transboundary	number	the distance of the transboundary nodes
area_unit	text	m2 (default), km2, ha...
pij_min	number	probabilities below it make no edge

conn.distances#

The distances between the patches of a raster or between features (landschaft's distance_table, Makurhini's distancefile): between their centroids (R's means of the cells' centres; the features' largest part's, or GEOS's point on the surface when it falls outside), their edges (the gap between their closest cells; GEOS's distance), least-cost over a resistance (gdistance's) or commute times, from centroid to centroid as Makurhini's; the straight distance for the pairs the resistance does not join.

Input	Type	What it is
map	map	the patches: a patch id per cell, or classes with habitat
vector	vector	or the nodes as features (polygons)
resistance	map	the resistance of least-cost and commute-time distances

Output	Type	What it is
table	table	from, to and distance

Setting	Type	What it is
habitat	any	the habitat classes (a number or several): their patches are the nodes
directions	integer	the patches' neighbours with habitat: 8 (default) or 4
id	text	the features' id column (default 1, 2...)
distance	text	centroid (default), edge, least-cost (gdistance's, over the resistance) or commute-time; the least-cost and commute-time distances join the patches' centroids, as Makurhini's
max_distance	number	the pairs up to it (default all)
distance_unit	text	of centroid and edge distances: m (default), km, inch, foot, yard or mile
cost_directions	integer	of the costs: 8 (default) or 4
cost_function	text	the conductance between cells: makurhini (default, 1 / the destination's resistance) or mean
unreachable	text	pairs the resistance does not join: euclidean (default, the straight distance) or drop

conn.eca_change#

The change of the equivalent connected area (ECA) from graph to graph, e.g. the habitat of several years (Makurhini's MK_dECA): per distance and graph the habitat's area, ECA (of PC or IIC), ECA against the landscape's area and the habitat's, the changes of area and ECA (%; the first against the landscape's area) and their ratio, and how they compare (dECA < dA < 0: connectivity loss...).

Input	Type	What it is
graphsrequired	any	habitat graphs in time order (a series), or one

Output	Type	What it is
table	table	time (1, 2...), LA, area, distance, ECA, ECA_LA, ECA_area, dA, dECA, rECA
readings	any	per row, the comparison and its reading

Setting	Type	What it is
landscape_arearequired	number	the landscape's area
metric	text	PC (default) or IIC
distance	any	the link distance, or several (default: Makurhini's median of the distances)
probability	number	the probability at that distance (default 0.5)
pij_min	number	probabilities below it make no edge

conn.eca_change_grid#

The change of ECA per cell of a grid between consecutive times (Makurhini's MK_dECA_grid, landschaft's eca_change_grid): the habitat of each time clipped to the cell, its graph (areas, centroid distances), ECA of IIC or PC, their change and how it reads.

Input	Type	What it is
timesrequired	any	the habitat at two or more times (a series of vectors)
regionrequired	vector	the region
grid	vector	the cells (else made with cell_area)

Output	Type	What it is
grid	vector	a cell per pair of times, with the changes

Setting	Type	What it is
cell_area	number	the cells' area, in the region's units squared
hexagonal	bool	hexagons (default) or squares
distancerequired	number	the link distance
metric	text	IIC (default) or PC
probability	number	the probability at that distance (PC: 0.5)
pij_min	number	probabilities below it make no edge
names	any	the times' names (default T1, T2...)
area_unit	text	m2 (default), km2, ha...

conn.focal_nodes#

The importance of every node in its neighbourhood (Makurhini's MK_Focal_nodes, landschaft's focal_nodes): the graph of the nodes within a search buffer of it (their points on the surface, the landscape their bounding box) and, in it, EC and IIC or PC, the node's dI and its fractions, and IComp (the index times dI). A row per node and distance.

Input	Type	What it is
vectorrequired	vector	the nodes as features (polygons)

Output	Type	What it is
table	table	the focal importances

Setting	Type	What it is
distancerequired	any	the link distance (the distance of probability), or several
search_bufferrequired	any	the buffer around each node, or one per distance
metric	text	IIC (default) or PC
probability	number	the probability at that distance (PC: 0.5)
pij_min	number	probabilities below it make no edge (default 0.01)
id	text	the features' id column (default 1, 2...)
attribute	any	a numeric column or a value per node (default: area)
area_unit	text	ha (default), m2, km2, Dam2, inch2, foot2, yard2 or mile2
threshold	number	nodes farther apart are not joined

conn.graph#

A habitat graph (landschaft's HabitatGraph): nodes with an attribute (an area, a quality) and the distances, probabilities or links between pairs of them, from a table of nodes and a table of pairs (from, to, value) or an n x n matrix.

Input	Type	What it is
nodesrequired	table	a row per node: its id and attribute
pairsrequired	table	(from, to, value) rows, or an n x n matrix

Output	Type	What it is
graph	habitat_graph	the habitat graph

Setting	Type	What it is
kind	text	what the pairs' values are: distance (default), probability or link (0/1)
convention	text	makurhini (default) or conefor: the rules of the indices
landscape_area	number	the landscape's area, for LCP, IIC and PC (Conefor's default 1; Makurhini's none)
id	text	the nodes' id column (default id; else 1, 2...)
attribute	text	the nodes' attribute column (default attribute)
restoration	text	a column of 1 (existing node) or 0 (node to add): the importances of nodes to restore
from	text	the pairs' columns (default from, to, value)
to	text	the pairs' second node column
value	text	the pairs' value column

conn.graph_from_raster#

A habitat graph of the patches of a raster (landschaft's HabitatGraph.from_raster): the nodes' attributes and the distances between them (conn.nodes and conn.distances); its values map back onto the patches (conn.to_map).

Input	Type	What it is
map	map	the patches: a patch id per cell, or classes with habitat
vector	vector	or the nodes as features (polygons)
resistance	map	the resistance of least-cost and commute-time distances

Output	Type	What it is
graph	habitat_graph	the habitat graph

Setting	Type	What it is
habitat	any	the habitat classes (a number or several): their patches are the nodes
directions	integer	the patches' neighbours with habitat: 8 (default) or 4
id	text	the features' id column (default 1, 2...)
attribute	any	a value per patch, in the order of their ids (default: area)
weighted	bool	the attribute times the area (default false)
area_unit	text	m2 (default), km2, ha, Dam2, inch2, foot2, yard2 or mile2
distance	text	centroid (default), edge, least-cost (gdistance's, over the resistance) or commute-time; the least-cost and commute-time distances join the patches' centroids, as Makurhini's
max_distance	number	the pairs up to it (default all)
distance_unit	text	of centroid and edge distances: m (default), km, inch, foot, yard or mile
cost_directions	integer	of the costs: 8 (default) or 4
cost_function	text	the conductance between cells: makurhini (default, 1 / the destination's resistance) or mean
unreachable	text	pairs the resistance does not join: euclidean (default, the straight distance) or drop
kind	text	what the pairs' values are: distance (default), probability or link (0/1)
convention	text	makurhini (default) or conefor: the rules of the indices
landscape_area	number	the landscape's area, for LCP, IIC and PC (Conefor's default 1; Makurhini's none)
restoration	any	per patch, in the order of their ids, 1 (existing) or 0 (to add)

conn.graph_from_samc#

A habitat graph of settlement probabilities (landschaft's HabitatGraph.from_samc, Makurhini's MK_dPCIIC with samc): the nodes' attributes and, between them, the probability that a walker leaving one settles in the other (conn.settlement_probabilities).

Input	Type	What it is
vectorrequired	vector	the nodes (polygons)
resistancerequired	map	the resistance
absorption	map	every cell's absorption, 0 to 1

Output	Type	What it is
graph	habitat_graph	a graph of probabilities

Setting	Type	What it is
attribute	any	a value per patch, in the order of their ids (default: area)
weighted	bool	the attribute times the area (default false)
area_unit	text	m2 (default), km2, ha, Dam2, inch2, foot2, yard2 or mile2
kind	text	what the pairs' values are: distance (default), probability or link (0/1)
convention	text	makurhini (default) or conefor: the rules of the indices
landscape_area	number	the landscape's area, for LCP, IIC and PC (Conefor's default 1; Makurhini's none)
dispersal_distance	number	else the absorption from it
directions	integer	4 or 8 (default)
cost_function	text	mean (default) or makurhini
vertices	integer	boundary vertices per node (default 10)
vertex_fraction	number	or their share of the node's vertices
settle	text	sum (default) or mean over the cells
id	text	the features' id column (default 1, 2...)

conn.graph_from_vector#

A habitat graph of vector features (landschaft's HabitatGraph.from_vector): the nodes' attributes and the distances between them (conn.nodes and conn.distances on the features); its values join back onto the features (conn.to_vector).

Input	Type	What it is
vector	vector	or the nodes as features (polygons)
resistance	map	the resistance of least-cost and commute-time distances

Output	Type	What it is
graph	habitat_graph	the habitat graph

Setting	Type	What it is
id	text	the features' id column (default 1, 2...)
attribute	any	a value per patch, in the order of their ids (default: area)
weighted	bool	the attribute times the area (default false)
area_unit	text	m2 (default), km2, ha, Dam2, inch2, foot2, yard2 or mile2
distance	text	centroid (default), edge, least-cost (gdistance's, over the resistance) or commute-time; the least-cost and commute-time distances join the patches' centroids, as Makurhini's
max_distance	number	the pairs up to it (default all)
distance_unit	text	of centroid and edge distances: m (default), km, inch, foot, yard or mile
cost_directions	integer	of the costs: 8 (default) or 4
cost_function	text	the conductance between cells: makurhini (default, 1 / the destination's resistance) or mean
unreachable	text	pairs the resistance does not join: euclidean (default, the straight distance) or drop
kind	text	what the pairs' values are: distance (default), probability or link (0/1)
convention	text	makurhini (default) or conefor: the rules of the indices
landscape_area	number	the landscape's area, for LCP, IIC and PC (Conefor's default 1; Makurhini's none)
restoration	any	per feature, 1 (existing) or 0 (to add)

conn.link_change#

The change of IIC or PC when pairs change (Conefor's link change): new links or lost ones, distances or probabilities raised or lowered; negative for a gain.

Input	Type	What it is
changesrequired	table	(from, to, new value) rows, or the new n x n matrix
graphrequired	habitat_graph	a habitat graph

Output	Type	What it is
table	table	from, to, distance and the change (%)

Setting	Type	What it is
distance	any	the link distance (the distance of probability; default: Makurhini's median of the distances)
probability	number	the probability at that distance (default 0.5)
pij_min	number	probabilities below it make no edge (default 0.01 Makurhini, 0 Conefor)
metric	text	IIC or PC (default)

conn.link_importance#

Every link's importance (Conefor's link removal): the share of IIC or PC lost without it.

Input	Type	What it is
graphrequired	habitat_graph	a habitat graph

Output	Type	What it is
table	table	from, to, distance and the share lost

Setting	Type	What it is
distance	any	the link distance (the distance of probability; default: Makurhini's median of the distances)
probability	number	the probability at that distance (default 0.5)
pij_min	number	probabilities below it make no edge (default 0.01 Makurhini, 0 Conefor)
metric	text	IIC or PC (default)

conn.make_grid#

A grid of hexagons (sf's st_make_grid) or squares of a given area over a region (Makurhini's make_grid): the cells that meet the region, clipped to it or only those wholly inside.

Input	Type	What it is
regionrequired	vector	the region

Output	Type	What it is
grid	vector	the cells, OBJECTID 1, 2...

Setting	Type	What it is
cell_area	number	the cells' area, in the region's units squared
hexagonal	bool	hexagons (default) or squares
clip	bool	the cells clipped to the region (default false)
grid_boundary	bool	only the cells wholly inside the region

conn.metapopulation#

A metapopulation in a network of habitat patches over time, Hanski's incidence function model as R's MetaLandSim (spom) simulates it, the same run for a seed: every step, each patch's connectivity to the occupied patches (a kernel of the distance times their areas), an empty patch colonised with a probability that grows with it, an occupied one lost with a probability that falls with its area (and with the rescue effect, with its colonisation). Every patch's final occupancy and incidence (the share of steps occupied), and the patches occupied at every step.

Input	Type	What it is
patchesrequired	any	the patches: a table (x, y, area, occupied) or points

Output	Type	What it is
patches	table	per patch: patch, x, y, area, occupied (at the end), incidence (the share of steps occupied)
table	table	per step (0 the start): step, occupied, occupied_area, colonised, extinct

Setting	Type	What it is
steps	integer	the steps (default 100)
alpharequired	number	the kernel's α: 1 / the mean dispersal distance
xrequired	number	extinction's scaling with area (x)
yrequired	number	colonisation's y
erequired	number	extinction's e: the probability of a patch of area 1
b	number	the sources' areas' exponent in the connectivity (default 1)
kernel	text	exponential (default) or power: 1 / (1 + α d^beta)
beta	number	the power kernel's beta (default 1)
connectivity	text	plain (default) or area: times the patch's area^c1
c1	number	with area connectivity: the exponent
colonisation	text	logistic (default, S²/(S²+y²)), exponential (1 - exp(-y S)) or power (S^z/(S^z + 1/c2))
c2	number	with power colonisation: c2
z	number	with power colonisation: z
extinction	text	area (default, min(1, e/A^x)), exponential (1 - exp(-e/A^x)) or rescue (e/A^x (1 - C)^r)
r	number	with the rescue effect: its exponent
area	text	the patches' area column or attribute (default area)
occupied	text	the occupancy column or attribute (default occupied)
seed	integer	R's set.seed (default 1)

conn.node_importance#

Every node's importance (Conefor's dI, Makurhini's MK_dPCIIC): the share of each index lost without it and the intra, flux and connector fractions of dIIC and dPC; the betweenness BC, BC(IIC) and BC(PC) when asked for. On a graph with nodes to restore, the gain of adding each (Makurhini's dIICres and dPCres, or Conefor's d*add). A row per node and distance. As in Conefor and Makurhini, a node is taken out of the graph as it is: the distances between the others are not measured again, so with least-cost distances the detours it forces are missed.

Input	Type	What it is
graphrequired	habitat_graph	a habitat graph

Output	Type	What it is
table	table	the importances

Setting	Type	What it is
distance	any	the link distance (the distance of probability), or several: a row each (default: Makurhini's median of the distances; Conefor needs one)
probability	number	the probability at that distance (default 0.5)
pij_min	number	probabilities below it make no edge (default 0.01 Makurhini, 0 Conefor)
metrics	any	of A, NC, NL, H, CCP, LCP, IIC, F, AWF, PC, BC, BCIIC, BCPC (default all but the betweenness)

conn.nodes#

The nodes of a habitat graph from a raster of patches or from features (landschaft's node_table, Makurhini's nodesfile): each patch's id and attribute, its area by default (GDAL's area of the polygons).

Input	Type	What it is
map	map	the patches: a patch id per cell, or classes with habitat
vector	vector	or the nodes as features (polygons)

Output	Type	What it is
table	table	id and attribute

Setting	Type	What it is
habitat	any	the habitat classes (a number or several): their patches are the nodes
directions	integer	the patches' neighbours with habitat: 8 (default) or 4
id	text	the features' id column (default 1, 2...)
attribute	any	a value per patch, in the order of their ids (default: area)
weighted	bool	the attribute times the area (default false)
area_unit	text	m2 (default), km2, ha, Dam2, inch2, foot2, yard2 or mile2

conn.overall#

A habitat graph's connectivity (Conefor's indices, Makurhini's MK_dPCIIC overall): A, NC (components), NL (links), H (Harary), CCP, LCP, IIC and its equivalent connectivity and fractions, F, AWF, PC and its equivalent connectivity and fractions; a row per distance.

Input	Type	What it is
graphrequired	habitat_graph	a habitat graph

Output	Type	What it is
table	table	the indices

Setting	Type	What it is
distance	any	the link distance (the distance of probability), or several: a row each (default: Makurhini's median of the distances; Conefor needs one)
probability	number	the probability at that distance (default 0.5)
pij_min	number	probabilities below it make no edge (default 0.01 Makurhini, 0 Conefor)
metrics	any	of A, NC, NL, H, CCP, LCP, IIC, F, AWF, PC (default all; no probabilities on links)

conn.protconn#

Saura's ProtConn (Makurhini's MK_ProtConn, landschaft's protconn): the share of a region protected and connected. The protected areas clipped to the region and dissolved are the nodes (and the transboundary ones within a distance of it; the region's parts with bound); PC's numerator over the most probable paths between them gives ECA, PC, Prot, ProtConn, ProtUnconn, RelConn and ProtConn's fractions. With delta, every protected area's importance.

Input	Type	What it is
regionrequired	vector	the region (its features dissolved)
protectedrequired	vector	the protected areas (polygons)
resistance	map	the resistance of least-cost distances

Output	Type	What it is
delta	vector	with delta: the clipped protected areas, their dProt, dProtConn and varProtConn per distance
table	table	the indicators per distance

Setting	Type	What it is
delta	bool	every protected area's importance too (default false)
distancerequired	any	the median dispersal distance, or several
probability	number	the probability at that distance (default 0.5; null: exp(-1))
transboundary	number	the distance of the transboundary nodes
transboundary_type	text	around the nodes (default) or around the region
bound	bool	the region's parts as nodes (ProtConn_Bound)
area_unit	text	m2 (default), km2, ha, Dam2, inch2, foot2, yard2 or mile2
distance_type	text	edge (default) or least-cost
transboundary_weight	number	the weight of transboundary pairs (1)
cost_directions	integer	of least-cost: 8 (default) or 4
cost_function	text	makurhini (default) or mean
preselect	bool	keep only the protected areas near the region (true)
pij_min	number	probabilities below it make no edge (default 0)

conn.protconn_raster#

ProtConn of a raster of protected areas (landschaft's protconn_raster): its patches inside the region (the region's features rasterized on its grid, or a raster of the region) are the nodes, at their centroids; transboundary patches within a distance of them or of the region, and the region's parts with bound.

Input	Type	What it is
protectedrequired	map	the protected areas: a patch id per cell
region	vector	the region as features
region_map	map	or as a raster (its cells with a value)

Output	Type	What it is
table	table	the indicators per distance

Setting	Type	What it is
distancerequired	any	the median dispersal distance, or several
probability	number	the probability at that distance (default 0.5; null: exp(-1))
transboundary	number	the distance of the transboundary nodes
transboundary_type	text	around the nodes (default) or the region
bound	bool	the region's parts as nodes
area_unit	text	m2 (default), km2, ha...
pij_min	number	probabilities below it make no edge (default 0)

conn.protconn_regions#

ProtConn for every region of several (landschaft's protconn_regions): conn.protconn's indicators with a row per region and distance.

Input	Type	What it is
regionsrequired	vector	the regions, one feature each
protectedrequired	vector	the protected areas (polygons)
resistance	map	the resistance of least-cost distances

Output	Type	What it is
table	table	the indicators per distance

Setting	Type	What it is
id	text	the regions' id column (default 1, 2...)
distancerequired	any	the median dispersal distance, or several
probability	number	the probability at that distance (default 0.5; null: exp(-1))
transboundary	number	the distance of the transboundary nodes
transboundary_type	text	around the nodes (default) or around the region
bound	bool	the region's parts as nodes (ProtConn_Bound)
area_unit	text	m2 (default), km2, ha, Dam2, inch2, foot2, yard2 or mile2
distance_type	text	edge (default) or least-cost
transboundary_weight	number	the weight of transboundary pairs (1)
cost_directions	integer	of least-cost: 8 (default) or 4
cost_function	text	makurhini (default) or mean
preselect	bool	keep only the protected areas near the region (true)
pij_min	number	probabilities below it make no edge (default 0)

conn.read_conefor#

A habitat graph from Conefor Sensinode's files: the node file (an id and an attribute per line) and the connection file (id id value lines, or an n x n matrix).

Output	Type	What it is
graph	habitat_graph	the habitat graph

Setting	Type	What it is
kind	text	what the pairs' values are: distance (default), probability or link (0/1)
convention	text	makurhini (default) or conefor: the rules of the indices
landscape_area	number	the landscape's area, for LCP, IIC and PC (Conefor's default 1; Makurhini's none)
nodesrequired	text	the node file
connectionsrequired	text	the connection file

conn.settlement_probabilities#

The probabilities of settling between habitat nodes (landschaft's settlement_probabilities, the samc package's model): a random walk over a resistance (to a neighbour with the probability of its conductance, 1 / the mean resistance by default), absorbed at each cell with a probability (an absorption raster, or none inside the nodes and exp(-1.247 - 1.788 log(dispersal distance / cell)) elsewhere); the probability that a walker leaving one node settles in another, over the cells of their boundary vertices.

Input	Type	What it is
vectorrequired	vector	the nodes (polygons)
resistancerequired	map	the resistance
absorption	map	every cell's absorption, 0 to 1

Output	Type	What it is
table	table	id and a column per node: the probabilities (1 on the diagonal)

Setting	Type	What it is
dispersal_distance	number	else the absorption from it
directions	integer	4 or 8 (default)
cost_function	text	mean (default) or makurhini
vertices	integer	boundary vertices per node (default 10)
vertex_fraction	number	or their share of the node's vertices
settle	text	sum (default) or mean over the cells
id	text	the features' id column (default 1, 2...)

conn.to_map#

Per-node values on the patches of a graph made from a raster (landschaft's HabitatGraph.to_raster): every cell of a node the value of its id in the table; missing elsewhere.

Input	Type	What it is
graphrequired	habitat_graph	a graph from conn.graph_from_raster
tablerequired	table	a row per node: its id and values (conn.node_importance...)

Output	Type	What it is
map	map	the values on the patches

Setting	Type	What it is
columnrequired	text	the column of the values
id	text	the column of the ids (default id)

conn.to_vector#

A table of nodes joined onto the features of a graph made from them (landschaft's HabitatGraph.to_geodataframe): a feature per row of the table (its id's), with the table's columns.

Input	Type	What it is
graphrequired	habitat_graph	a graph from conn.graph_from_vector
tablerequired	table	a row per node and distance: its id and values

Output	Type	What it is
vector	vector	the features with the table's columns

Setting	Type	What it is
id	text	the column of the ids (default id)

conn.write_conefor#

A habitat graph written as Conefor Sensinode's node and connection files (the pairs with a value).

Input	Type	What it is
graphrequired	habitat_graph	a habitat graph

Output	Type	What it is
nodes	text	the node file written
connections	text	the connection file written

Setting	Type	What it is
nodesrequired	text	the node file
connectionsrequired	text	the connection file

networks.conefor#

The habitat network of an MSPA map as Conefor Sensinode's inputs, as GuidosToolbox's nw_cs22 (landschaft's conefor_inputs): the cores as nodes (negative ids, their area) and the bridges (positive ids, area 0), a link from every bridge to every core it touches at distance 1.

Input	Type	What it is
maprequired	map	the MSPA map (landscape.mspa)

Output	Type	What it is
nodes	table	id and pixels per node
links	table	link, node and distance per link
nodes_txt	text	Conefor's nodes file
links_txt	text	Conefor's links file

networks.gtn_components#

The components of the habitat network of an MSPA map, as GuidosToolbox's nw_components (landschaft's gtn_components): cores (nodes) and bridges (links) grouped into 8-connected components, only the cores habitat; the equivalent connected area ECA = sqrt(sum of the components' core areas squared), ECA_max (all one component) and the coherence ECA / ECA_max.

Input	Type	What it is
maprequired	map	the MSPA map (landscape.mspa)

Output	Type	What it is
map	map	GTB's colours: the networks by component, isolated cores, missing
components	map	the component of every core and bridge cell (0 elsewhere)
stats	table	per component: its core and bridge cells, all, whether it has a bridge (1), and in hectares
summary	table	components, networks, isolated cores, nodes, links, ECA (ha or cells), ECA in cells, ECA_max, ECA_max in cells, coherence (%)
report	text	GTB's log

Setting	Type	What it is
pixel_size	any	a cell's size in metres, for hectares (default the grid's)

networks.gtn_importance#

The importance of every link (bridge) and stepping-stone node (core with two links or more) of the habitat network of an MSPA map, as GuidosToolbox's nw_importance (landschaft's gtn_importance): the loss of connectivity (dPC, the drop of PC's numerator, %) without it; links positive and nodes negative on the maps; in GTB's colours, those within 1, 5 and 10 % of the most important (at least 99, 95 and 90 % of its dPC).

Input	Type	What it is
maprequired	map	the MSPA map (landscape.mspa)

Output	Type	What it is
map	map	GTB's colours: cores, bridges, links and nodes within 1, 5, 10 % of the most important
importance	map	dPC of every link (positive) and node (negative) on its cells
ids	map	the link (positive) or node (negative) of every cell
links	table	per link: its component, cells, dPC, the nodes it joins, its importance normalized to the largest (%)
nodes	table	per stepping-stone node: its component, cells, dPC, links (degree), normalized importance (%)
report	text	GTB's report (_cs.txt)

Setting	Type	What it is
title	text	the report's first line