Cycle graphs

Python

cycle_graph[vert_type](size: int) → undirected_network[vert_type]

C++

template<integer_network_vertex VertT>
undirected_network<VertT> cycle_graph(VertT size)

Generates a cycle graph of size size: A 2-regular graph where each vertex is connected to the one before and after it.

>>> import reticula as ret
>>> ret.cycle_graph[ret.int64](size=128)
<undirected_network[int64] with 128 verts and 128 edges>