Last chance! 50% off unlimited learning
Sale ends in
A ring is a one-dimensional lattice and this function is a special case
of make_lattice.
make_ring(n, directed = FALSE, mutual = FALSE, circular = TRUE)ring(...)
Number of vertices.
Whether the graph is directed.
Whether directed edges are mutual. It is ignored in undirected graphs.
Whether to create a circular ring. A non-circular ring is essentially a “line”: a tree where every non-leaf vertex has one child.
Passed to make_ring.
An igraph graph.
Other determimistic constructors: graph_from_atlas,
graph_from_edgelist,
graph_from_literal,
make_chordal_ring,
make_empty_graph,
make_full_citation_graph,
make_full_graph, make_graph,
make_lattice, make_star,
make_tree
# NOT RUN {
print_all(make_ring(10))
print_all(make_ring(10, directed = TRUE, mutual = TRUE))
# }
Run the code above in your browser using DataLab