# momepy.cyclomatic#

Calculates cyclomatic complexity for subgraph around each node if radius is set, or for whole graph, if radius=None.

Subgraph is generated around each node within set radius. If distance=None, radius will define topological distance, otherwise it uses values in distance attribute.

$\alpha=e-v+1$

where $$e$$ is the number of edges in subgraph and $$v$$ is the number of nodes in subgraph.

Parameters
graphnetworkx.Graph

Graph representing street network. Ideally generated from GeoDataFrame using momepy.gdf_to_nx()

Include all neighbors of distance <= radius from n

namestr, optional

calculated attribute name

distancestr, optional

Use specified edge data key as distance. For example, setting distance=’weight’ will use the edge weight to measure the distance from the node n.

verbosebool (default True)

if True, shows progress bars in loops and indication of steps

Returns
Graph

cyclomatic complexity for graph if radius=None
>>> network_graph = mm.cyclomatic(network_graph, radius=3)