
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: atlas
,
graph.atlas
,
graph_from_atlas
;
chordal_ring
,
graph.extended.chordal.ring
,
make_chordal_ring
;
directed_graph
, graph
,
graph.famous
,
make_directed_graph
,
make_graph
,
make_undirected_graph
,
undirected_graph
;
empty_graph
, graph.empty
,
make_empty_graph
;
from_edgelist
,
graph.edgelist
,
graph_from_edgelist
;
from_literal
, graph.formula
,
graph_from_literal
;
full_citation_graph
,
graph.full.citation
,
make_full_citation_graph
;
full_graph
, graph.full
,
make_full_graph
;
graph.lattice
, lattice
,
make_lattice
; graph.star
,
make_star
, star
;
graph.tree
, make_tree
,
tree
# NOT RUN {
str(make_ring(10))
str(make_ring(10, directed = TRUE, mutual = TRUE))
# }
Run the code above in your browser using DataLab