cityseer.tools.graphs

A collection of convenience functions for the preparation and conversion of NetworkX graphs to and from cityseer data structures. Note that the cityseer network data structures can be created and manipulated directly, if so desired.

nX_simple_geoms

nX_simple_geoms(networkX_multigraph)
-> nx.MultiGraph


Generates straight-line geometries for each edge based on the the x and y coordinates of the adjacent nodes. The edge geometry will be stored to the edge geom attribute.

Parameters
networkX_multigraph
nx.MultiGraph

A networkXMultiGraph with x and y node attributes.

Returns
nx.MultiGraph

A networkXMultiGraph with shapelyLinestring geometries assigned to the edge geom attributes.

nX_from_osm

nX_from_osm(osm_json)
-> nx.MultiGraph


Generates a NetworkXMultiGraph from Open Street Map data.

Parameters
osm_json
str

A json string response from the OSM overpass API, consisting of nodes and ways.

Returns
nx.MultiGraph

A NetworkXMultiGraph with x and y attributes in WGS84lng, lat geographic coordinates.

nX_wgs_to_utm

nX_wgs_to_utm(networkX_multigraph,
force_zone_number=None)
-> nx.MultiGraph


Converts x and y node attributes from WGS84lng, lat geographic coordinates to the local UTM projected coordinate system. If edge geom attributes are found, the associated LineString geometries will also be converted. The UTM zone derived from the first processed node will be used for the conversion of all other nodes and geometries contained in the graph. This ensures consistent behaviour in cases where a graph spans a UTM boundary.

Parameters
networkX_multigraph
nx.MultiGraph

A networkXMultiGraph with x and y node attributes in the WGS84 coordinate system. Optional geom edge attributes containing LineString geoms to be converted.

force_zone_number
int

An optional UTM zone number for coercing all conversions to an explicit UTM zone. Use with caution: mismatched UTM zones may introduce substantial distortions in the results. Defaults to None.

Returns
nx.MultiGraph

A networkXMultiGraph with x and y node attributes converted to the local UTM coordinate system. If edge geom attributes are present, these will also be converted.

nX_remove_dangling_nodes

nX_remove_dangling_nodes(networkX_multigraph,
despine=None,
remove_disconnected=True)
-> nx.MultiGraph


Optionally removes short dead-ends or disconnected graph components, which may be prevalent on poor quality network datasets.

Parameters
networkX_multigraph
nx.MultiGraph

A networkXMultiGraph in a projected coordinate system, containing x and y node attributes, and geom edge attributes containing LineString geoms.

despine
float

The maximum cutoff distance for removal of dead-ends. Use None or 0 where no despining should occur. Defaults to None.

remove_disconnected
bool

Whether to remove disconnected components. If set to True, only the largest connected component will be returned. Defaults to True.

Returns
nx.MultiGraph

A networkXMultiGraph with disconnected components optionally removed, and dead-ends removed where less than the despine parameter distance.

nX_remove_filler_nodes

nX_remove_filler_nodes(networkX_multigraph)
-> nx.MultiGraph


Removes nodes of degree=2: such nodes represent no route-choices other than traversal to the next edge. The edges on either side of the deleted nodes will be removed and replaced with a new spliced edge.

Comment

Filler nodes may be prevalent in poor quality datasets, or in situations where curved roadways have been represented through the addition of nodes to describe arced geometries. cityseer uses shapelyLinestrings to describe arbitrary road geometries without the need for filler nodes. Filler nodes can therefore be removed, thus reducing side-effects as a function of varied node intensities when computing network centralities.

Parameters
networkX_multigraph
nx.MultiGraph

A networkXMultiGraph in a projected coordinate system, containing x and y node attributes, and geom edge attributes containing LineString geoms.

Returns
nx.MultiGraph

A networkXMultiGraph with nodes of degree=2 removed. Adjacent edges will be combined into a unified new edge with associated geom attributes spliced together.

nX_consolidate_nodes

nX_consolidate_nodes(networkX_multigraph,
buffer_dist=5,
min_node_group=2,
min_node_degree=1,
min_cumulative_degree=None,
max_cumulative_degree=None,
neighbour_policy=None,
crawl=True,
cent_min_degree=3,
cent_min_len_factor=None,
merge_edges_by_midline=True,
multi_edge_len_factor=1.25,
multi_edge_min_len=100)
-> nx.MultiGraph


Consolidates nodes if they are within a buffer distance of each other. Several parameters provide more control over the conditions used for deciding whether or not to merge nodes. The algorithm proceeds in two steps:

• Nodes within the buffer distance of each other are merged. A new centroid will be determined and all existing edge endpoints will be updated accordingly. The new centroid for the merged nodes can be based on:
• The centroid of the node group;
• Else, all nodes of degree greater or equal to cent_min_degree;
• Else, all nodes with aggregate adjacent edge lengths greater than a factor of cent_min_len_factor of the node with the greatest aggregate length for adjacent edges.
• The merging of nodes creates parallel edges which may start and end at a shared node on either side. These edges are replaced by a single new edge, with the new geometry selected from either:
• An imaginary centreline of the combined edges if merge_edges_by_midline is set to True;
• Else, the shortest edge, with longer edges discarded;
• Note that substantially longer parallel edges are retained, instead of discarded, if they exceed multi_edge_len_factor and are longer than multi_edge_min_len.
Parameters
networkX_multigraph
nx.MultiGraph

A networkXMultiGraph in a projected coordinate system, containing x and y node attributes, and geom edge attributes containing LineString geoms.

buffer_dist
float

The buffer distance to be used for consolidating nearby nodes. Defaults to 5.

min_node_group
int

The minimum number of nodes to consider a valid group for consolidation. Defaults to 2.

min_node_degree
int

The least number of edges a node should have in order to be considered for consolidation. Defaults to 1.

min_cumulative_degree
int

An optional minimum cumulative degree to consider a valid node group for consolidation. Defaults to None.

max_cumulative_degree
int

An optional maximum cumulative degree to consider a valid node group for consolidation. Defaults to None.

neighbour_policy
str

Whether all nodes within the buffer distance are merged, or only “direct” or “indirect” neighbours. Defaults to None.

crawl
bool

Whether the algorithm will recursively explore neighbours of neighbours if those neighbours are within the buffer distance from the prior node. Defaults to True.

cent_min_degree
int

The minimum node degree for a node to be considered when calculating the new centroid for the merged node cluster. Defaults to 3.

cent_min_len_factor
float

The minimum aggregate adjacent edge lengths an existing node should have to be considered when calculating the centroid for the new node cluster. Expressed as a factor of the node with the greatest aggregate adjacent edge lengths. Defaults to None.

merge_edges_by_midline
bool

Whether to merge parallel edges by an imaginary centreline. If set to False, then the shortest edge will be retained as the new geometry and the longer edges will be discarded. Defaults to True.

multi_edge_len_factor
float

In cases where one line is significantly longer than another (e.g. crescent streets) then the longer edge is retained as separate if exceeding the multi_edge_len_factor as a factor of the shortest length but with the exception that (longer) edges still shorter than multi_edge_min_len are removed regardless. Defaults to 1.5.

multi_edge_min_len
float

See multi_edge_len_factor. Defaults to 100.

Returns
nx.MultiGraph

A networkXMultiGraph with consolidated nodes.

Notes

See the guide on graph cleaning for more information.

The pre-consolidation OSM street network for Soho, London. © OpenStreetMap contributors.

The consolidated OSM street network for Soho, London. © OpenStreetMap contributors.

nX_split_opposing_geoms

nX_split_opposing_geoms(networkX_multigraph,
buffer_dist=10,
merge_edges_by_midline=True,
multi_edge_len_factor=1.25,
multi_edge_min_len=100)
-> nx.MultiGraph


Projects nodes to pierce opposing edges within a buffer distance. The pierced nodes facilitate subsequent merging for scenarios such as divided boulevards.

Parameters
networkX_multigraph
nx.MultiGraph

A networkXMultiGraph in a projected coordinate system, containing x and y node attributes, and geom edge attributes containing LineString geoms.

buffer_dist
float

The buffer distance to be used for splitting nearby nodes. Defaults to 5.

merge_edges_by_midline
bool

Whether to merge parallel edges by an imaginary centreline. If set to False, then the shortest edge will be retained as the new geometry and the longer edges will be discarded. Defaults to True.

multi_edge_len_factor
float

In cases where one line is significantly longer than another (e.g. crescent streets) then the longer edge is retained as separate if exceeding the multi_edge_len_factor as a factor of the shortest length but with the exception that (longer) edges still shorter than multi_edge_min_len are removed regardless. Defaults to 1.5.

multi_edge_min_len
float

See multi_edge_len_factor. Defaults to 100.

Returns
nx.MultiGraph

A networkXMultiGraph with consolidated nodes.

nX_decompose

nX_decompose(networkX_multigraph,
decompose_max)
-> nx.MultiGraph


Decomposes a graph so that no edge is longer than a set maximum. Decomposition provides a more granular representation of potential variations along street lengths, while reducing network centrality side-effects that arise as a consequence of varied node densities.

Comment

Setting the decompose parameter too small in relation to the size of the graph may increase the computation time unnecessarily for subsequent analysis. For larger-scale urban analysis, it is generally not necessary to go smaller 20m, and 50m may already be sufficient for the majority of cases.

Parameters
networkX_multigraph
nx.MultiGraph

A networkXMultiGraph in a projected coordinate system, containing x and y node attributes, and geom edge attributes containing LineString geoms.

decompose_max
float

The maximum length threshold for decomposed edges.

Returns
nx.MultiGraph

A decomposed networkX graph with no edge longer than the decompose_max parameter. If live node attributes were provided, then the live attribute for child-nodes will be set to True if either or both parent nodes were live. Otherwise, all nodes wil be set to live=True. The length and impedance edge attributes will be set to match the lengths of the new edges.

Notes
from cityseer.tools import mock, graphs, plot

G = mock.mock_graph()
G_simple = graphs.nX_simple_geoms(G)
G_decomposed = graphs.nX_decompose(G_simple, 100)
plot.plot_nX(G_decomposed)

Example graph prior to decomposition.

Example graph after decomposition.

nX_to_dual

nX_to_dual(networkX_multigraph)
-> nx.MultiGraph


Converts a primal graph representation, where intersections are represented as nodes and streets as edges, to the dual representation. So doing, edges are converted to nodes and intersections become edges. Primal edge geom attributes will be welded to adjacent edges and split into the new dual edge geom attributes.

Comment

Note that a MultiGraph is useful for primal but not for dual, so the output MultiGraph will have single edges. e.g. a crescent street that spans the same intersections as parallel straight street requires multiple edges in primal. The same type of situation does not arise in the dual because the nodes map to distinct edges regardless.

Parameters
networkX_multigraph
nx.MultiGraph

A networkXMultiGraph in a projected coordinate system, containing x and y node attributes, and geom edge attributes containing LineString geoms.

Returns
nx.MultiGraph

A dual representation networkX graph. The new dual nodes will have x and y node attributes corresponding to the mid-points of the original primal edges. If live node attributes were provided, then the live attribute for the new dual nodes will be set to True if either or both of the adjacent primal nodes were set to live=True. Otherwise, all dual nodes wil be set to live=True. The primal geom edge attributes will be split and welded to form the new dual geom edge attributes. A parent_primal_node edge attribute will be added, corresponding to the node identifier of the primal graph.

Notes
from cityseer.tools import graphs, mock, plot

G = mock.mock_graph()
G_simple = graphs.nX_simple_geoms(G)
G_dual = graphs.nX_to_dual(G_simple)
plot.plot_nX_primal_or_dual(G_simple,
G_dual,
plot_geoms=False)

Dual graph (blue) overlaid on the source primal graph (red).

graph_maps_from_nX

graph_maps_from_nX(networkX_multigraph)
-> Tuple[tuple, np.ndarray, np.ndarray, Dict]


Transposes a networkXMultiGraph into numpy arrays for use by NetworkLayer classes. Calculates length and angle attributes, as well as in and out bearings and stores these in the returned data maps.

Comment

It is generally not necessary to use this function directly. This function will be called internally when invoking NetworkLayerFromNX

Parameters
networkX_multigraph
nx.MultiGraph

A networkXMultiGraph in a projected coordinate system, containing x and y node attributes, and geom edge attributes containing LineString geoms.

Returns
node_uids

A tuple of node uids corresponding to the node identifiers in the source networkX graph.

node_data

A 2d numpy array representing the graph’s nodes. The indices of the second dimension correspond as follows:

idxproperty
0x coordinate
1y coordinate
2bool describing whether the node is live. Metrics are only computed for live nodes.
edge_data

A 2d numpy array representing the graph’s edges. Each edge will be described separately for each direction of travel. The indices of the second dimension correspond as follows:

idxproperty
0start node idx
1end node idx
2the segment length in metres
3the sum of segment’s angular change
4an ‘impedance factor’ which can be applied to magnify or reduce the effect of the edge’s impedance on shortest-path calculations. e.g. for gradients or other such considerations. Use with caution.
5the edge’s entry angular bearing
6the edge’s exit angular bearing

All edge attributes will be generated automatically, however, the impedance factor parameter can be over-ridden by supplying a imp_factor attribute on the input graph’s edges.

node_edge_map

A numbaDict with node_data indices as keys and numbaList types as values containing the out-edge indices for each node.

nX_from_graph_maps

nX_from_graph_maps(node_uids,
node_data,
edge_data,
node_edge_map,
networkX_multigraph=None,
metrics_dict=None)
-> nx.MultiGraph


Writes cityseer data graph maps back to a MultiGraph. Can write back to an existing MultiGraph if an existing graph is provided as an argument to the networkX_multigraph parameter.

Comment

It is generally not necessary to use this function directly. This function will be called internally when invoking NetworkLayer.to_networkX

Parameters
node_uids
Union[tuple, list]

A tuple of node ids corresponding to the node identifiers for the target networkX graph.

node_data
np.ndarray

A 2d numpy array representing the graph’s nodes. The indices of the second dimension should correspond as follows:

idxproperty
0x coordinate
1y coordinate
2bool describing whether the node is live
edge_data
np.ndarray

A 2d numpy array representing the graph’s directional edges. The indices of the second dimension should correspond as follows:

idxproperty
0start node idx
1end node idx
2the segment length in metres
3the sum of segment’s angular change
4‘impedance factor’ applied to magnify or reduce the edge impedance.
5the edge’s entry angular bearing
6the edge’s exit angular bearing
node_edge_map
Dict

A numbaDict with node_data indices as keys and numbaList types as values containing the out-edge indices for each node.

networkX_multigraph
nx.MultiGraph

An optional networkX graph to use as a backbone for unpacking the data. The number of nodes and edges should correspond to the cityseer data maps and the node identifiers should correspond to the node_uids. If not provided, then a new networkX graph will be returned. This function is intended to be used for situations where cityseer data is being transposed back to a source networkX graph. Defaults to None.

metrics_dict
dict

An optional dictionary with keys corresponding to the identifiers in node_uids. The dictionary’s values will be unpacked to the corresponding nodes in the networkX graph. Defaults to None.

Returns
nx.MultiGraph

A networkX graph. If a backbone graph was provided, a copy of the same graph will be returned with the data overridden as described below. If no graph was provided, then a new graph will be generated. x, y, live, ghosted node attributes will be copied from node_data to the graph nodes. length, angle_sum, imp_factor, start_bearing, and end_bearing attributes will be copied from the edge_data to the graph edges. If a metrics_dict is provided, all data will be copied to the graph nodes based on matching node identifiers.

nX_from_OSMnx

nX_from_OSMnx(networkX_multidigraph,
node_attributes=None,
edge_attributes=None,
tolerance=checks.tolerance)
-> nx.MultiGraph


Copies an OSMnx directed MultiDiGraph to an undirected cityseer compatible MultiGraph. See the OSMnx section of the guide for a more general discussion (and example) on workflows combining OSMnx with cityseer.

x and y node attributes will be copied directly and geometry edge attributes will be copied to a geom edge attribute. The conversion process will snap the shapelyLineString endpoints to the corresponding start and end node coordinates.

Note that OSMnxgeometry attributes only exist for simplified edges: if a geometry edge attribute is not found, then a simple (straight) shapelyLineString geometry will be inferred from the respective start and end nodes.

Other attributes will be ignored to avoid potential downstream misinterpretations of the attributes as a consequence of subsequent steps of graph manipulation, i.e. to avoid situations where attributes may fall out of lock-step with the state of the graph. If particular attributes need to be copied across, and assuming cognisance of downstream implications, then these can be manually specified by providing a list of node attributes keys per the node_attributes parameter or edge attribute keys per the edge_attributes parameter.

Parameters
networkX_multidigraph
nx.MultiDiGraph

A OSMnx derived networkXMultiDiGraph containing x and y node attributes, with optional geometry edge attributes containing LineString geoms (for simplified edges).

node_attributes
Union[list, tuple]

Optional node attributes to copy to the new MultiGraph. (In addition to the default x and y attributes.)

edge_attributes
Union[list, tuple]

Optional edge attributes to copy to the new MultiGraph. (In addition to the optional geometry attribute.)

tolerance
float

Tolerance at which to raise errors for mismatched geometry end-points vis-a-vis corresponding node coordinates. Prior to conversion, this method will check edge geometry end-points for alignment with the corresponding end-point nodes. Where these don’t align within the given tolerance an exception will be raised. Otherwise, if within the tolerance, the conversion function will snap the geometry end-points to the corresponding node coordinates so that downstream exceptions are not subsequently raised. It is preferable to minimise graph manipulation prior to conversion to a cityseer compatible MultiGraph otherwise particularly large tolerances may be required, and this may lead to some unexpected or undesirable effects due to aggressive snapping.

Returns
nx.MultiGraph

A cityseer compatible networkX graph with x and y node attributes and geom edge attribute.