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 >
# Version history Version 1.0 August 10, 2010 Initial release Version 1.1 October 14, 2010 Major enhancement: Implementation of time-series min-cost-max-flow. Several minor bugfixes: e.g., GUI now passes correct alpha value to PageRank. Version 1.12 October 18, 2010 Fixed configuration issue between the python libraries py2exe and elementtree that caused python-based functions (betweenness centrality, etc.) to fail with ImportError message. Version 1.2 October 24, 2011 Approximate shortest-path betweenness centrality allows faster computation of this metric Approximate current flow betweenness centrality allows faster computation of this metric; function also uses sparse matrices for lower RAM requirements Network flow functions updated to LEMON version 1.2.2 Updates to manual and tutorial dataset Version 1.2.1 April 2, 2012 Updated python and python packages, including NetworkX to version 1.6. Current flow betweenness centrality subset also now uses sparse matrices for lower RAM requirements. (Note that there is no approximate function for current flow betweenness centrality subset, so it is still slow for large datasets). Planned future enhancements Better support for multi-threaded implementation of of network flow due to release of LEMON 1.3.
Made with help of DrExplain