Spatial Morphology Group

This analysis defines the part of the network that is reachable from each line of the network within a given radius. Depending on the settings, the analysis can output the number of reachable lines, the total length of all reachable lines, or the reachable area.

This analysis calculates how many turns have to be made from each line to reach all other lines in the network, using shortest paths. This measure thus shows, for each and every line, how many steps (measured topologically) this line is away from all other lines in the network. 

This analysis calculates the Angular distance between one line and every other line in the network, using shortest paths. Angular distance is defined as the accumulated angular turns needed to get from line A to line B in the network, through the shortest path.

This analysis calculates how often a line falls on the shortest path between all pairs of lines in a network, or how many shortest paths pass through it. 

Angular choice is very similar to Network Betweennes when the chosen distance mode is Angular, but every path is counted twice, one for every direction (i.e. directed graph). 

This analysis calculates the minimum distances from each object of a set of origins, through a network, to the closest object of a set of destinations.

Attraction Reach calculates, for each object in a set of origin objects, the sum of all attractions from a set of attraction objects that can be reached via the network within a by the user defined radius.

​​Attraction Betweenness re-uses the functionality of the Network Betweenness analysis, but adds functionality for assigning weights to the lines from a table with attractions.