- momepy.cyclomatic(graph, radius=5, name='cyclomatic', distance=None, verbose=True)#
Calculates cyclomatic complexity for subgraph around each node if radius is set, or for whole graph, if
radius=None. A subgraph is generated around each node within set radius. If
distance=None, radius will define topological distance, otherwise it uses values in
where \(e\) is the number of edges in subgraph and \(v\) is the number of nodes in subgraph.
Adapted from [Bourdic et al., 2012].
A Graph representing a street network. Ideally generated from GeoDataFrame using
- radius: int
Include all neighbors of distance <= radius from
- namestr, optional
The calculated attribute name.
- distancestr, optional
Use specified edge data key as distance. For example, setting
distance=’weight’will use the edge
weightto measure the distance from the node
- verbosebool (default True)
True, shows progress bars in loops and indication of steps.
A networkx.Graph object if
The cyclomatic complexity for the graph if
>>> network_graph = mm.cyclomatic(network_graph, radius=3)