Connectivity Analysis Toolkit License Version history Getting Started Overview of Methods Three Methods for Connectivity Analysis Subset Centrality: Mapping Linkages All-pairs Centrality: Mapping Landscape Connectivity Network Flow Analysis of Time Series Input files Output files Running the Toolkit from the GUI Hexmap Tab Graphs Tab Connectivity Tab Output Tab Running the Toolkit from the Command Prompt Flowchart of analysis process Examples Example 1: Shortest-path betweenness centrality (BC) Example 2: Shortest-path betweenness subset centrality Example 3: Comparison of subset and all-pairs current flow BC Example 4: Comparison of shortest-path and current flow BC Tutorial Exercise 1 - Mapping linkages with min-cost-max-flow subset centrality Exercise 2 - Mapping linkages with shortest-path subset centrality Exercise 3 - Mapping landscape connectivity with all-pairs centrality Exercise 4 - Mapping connectivity under climate change: analysis of time series Troubleshooting Related Resources System requirements Contacts & Credits
< Previous page | Print version | Next page >
# Flowchart of analysis process The following table shows the different types of input and output files associated with the different methods.
METHOD | MAIN INPUT | AUXILIARY INPUT | GRAPH FORMAT FILE
Shortest-path betweenness centrality (BC) | Habitat (1 hxn file) | None | Edgelist textfile (distance)
Shortest-path BC subset | Habitat (1 hxn file) | Source/target file(s) | Edgelist textfile (distance)
Current-flow BC | Habitat (1 hxn file) | None | Edgelist textfile (conductance)
Current-flow BC subset | Habitat (1 hxn file) | Source/target file(s) | Edgelist textfile (conductance)
Minimum cost flow | Capacity and cost (2 hxn files) | Optional: Source/target file(s) | LGF file
Time series minimum cost flow | Capacity and cost for n time steps (n * 2 hxn files) | None | LGF file
The online help was made with Dr.Explain