Path graphs#
 path_graph[vert_type](size: int, periodic: bool = False) undirected_network[vert_type] #

template<integer_vertex VertT>
undirected_network<VertT> path_graph(VertT size, bool periodic = false)#
Generates a chain of size
vertices, each connected consecutively to each
other. If the periodic parameter is set to true
, then the first and the
last vertices are also connected, making it into a cycle graph equivalent to
what is generated through cycle_graph()
.