Introduces weighting by edge dissolves
This release primarily reintroduces the option of weighting centralities by node weights.
This is to facilitate the new nx_weight_by_dissolved_edges
method, which weights nodes to control for centrality calculations on messy networks. This works by buffering adjacent edges to look for overlaps with other nearby edges, and then weighting the node by a fraction of the total edge lengths in nearby proximity. This helps to control for OSM networks where busways, cycleways, highways, and pedestrian ways are often indicated in close proximity for the same transportation corridor, or where very detailed pedestrian routes are drawn for parks, etc. This method is intended to remove the need for aggressive network cleaning.
Note that this version also introduces some refactoring, where several functions have been moved from graphs
into io
.