Create a ring graph — graph.ring • igraph

graph.ring() was renamed to make_ring() to create a more consistent API.

Usage

graph.ring(n, directed = FALSE, mutual = FALSE, circular = TRUE)

Arguments

n: Number of vertices.
directed: Whether the graph is directed.
mutual: Whether directed edges are mutual. It is ignored in undirected graphs.
circular: Whether to create a circular ring. A non-circular ring is essentially a “line”: a tree where every non-leaf vertex has one child.