Defined in <
template<typename GraphView> GraphView make_cycle_chain(size_t cycle_count,size_t cycle_size,bool bidirectional)
Generates a graph containing many linked cycles.
The graph will contain cycle_count cycles, each of which has cycle_size vertices. The largest vertex of each cycle is connected to the smallest vertex of the next cycle.
Results in cycle_count SCCs and one weakly-connected component in a directed graph. Results in a single CC in an undirected graph.
The returned view owns its underlying container.
- cycle_count: Number of cycles in the generated graph.
- cycle_size: Number of vertices in each cycle.
- bidirectional: True to add back-edges in a directed graph, false for forward edges only.
A view over the generated graph.