Cityseer

Currently, accessibility computations will return a count and distance weighted count of accessible locations within a given distance threshold. This update also exposes the nearest distance to a given landuse from a given node.

See the [london_centralities](https://github.com/benchmark-urbanism/cityseer-examples/blob/main/notebooks/london_centralities.ipynb) notebook for an example.

Re-exposes graph cleaning options for downloading OSM; minor fixes to GeoPandas import workflows

Updates to graph cleaning

Some general updates to the graph cleaning workflows.

- The `graph.nx_remove_dangling_nodes` method's despine parameter is now an integer type and is active by default. Set to `0` if no despining is to occur.
- The `graph.nx_iron_edges` method is now more aggressive.
- The `graphs.nx_consolidate_nodes` method has been simplified with a new `centroid_by_itx` parameter taking the place of previous methods. This is set to `True` by default.
- The `io.osm_graph_from_poly` has been simplified with parameters removed. If custom control is needed then the individual methods can be called manually against a graph derived with `simplify=False`. Non simplified graphs are now returned with simple geoms generated and any filler nodes removed.
- Adds the `util.measure_max_angle` method.
- Adds tests
- Minor tweaks to simplification default params

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`.

Minor release with package bumps, minor fixes and tweaks, and fixes for jitter parameter.

Chains through primal node and edge id information to dual graphs and derivative node / edge GDFs.

This helps when merging primal edges into dual node data frames for visualisation purposes.