Cycle graphs#
 path_graph[vert_type](size: int) undirected_network[vert_type] #

template<integer_network_vertex VertT>
undirected_network<VertT> cycle_graph(VertT size)#
Generates a cycle graph of size size
: A 2regular graph where each vertex
is connected to the one before and after it.