Adds experimental visual graph analysis / isovists

Adds a new metrics.visibility module with visibility graph and isovist / viewshed functions.

Adds back improved closeness

Adds back improved closeness.

Primal edge vis

Adds a method nx_generate_vis_lines for generating line string representations for nodes - this is intended for visualisation purposes. Bumps documents.

Version bump

Version bump wrapping several minor changes related to tweaking graph cleaning settings and updating the io method for OS Open Roads loading (due to changes to the downloadable file structure).

Shortens name for generic_edges_geopandas_from_nx

Shortens name for generic_edges_geopandas_from_nx to geopandas_from_nx

Adds generic_edges_geopandas_from_nx

Adds generic_edges_geopandas_from_nx which allows exports of edge geometry from cityseer compatible networkX graphs.

Exposes nearest distances for accessibilities

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 notebook for an example.

Re-exposes graph cleaning options for downloading OSM

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

Updates to graph cleaning

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

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.