Skip to contents

A ring is a one-dimensional lattice and this function is a special case of make_lattice().

Usage

make_ring(n, directed = FALSE, mutual = FALSE, circular = TRUE)

ring(...)

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.

...

Passed to make_ring().

Value

An igraph graph.

Examples

print_all(make_ring(10))
#> IGRAPH 68f915c U--- 10 10 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
#> + graph attributes:
#> | + name:
#> |   [1] "Ring graph"
#> | + mutual:
#> |   [1] FALSE
#> | + circular:
#> |   [1] TRUE
#> + edges from 68f915c:
#>  [1] 1-- 2 2-- 3 3-- 4 4-- 5 5-- 6 6-- 7 7-- 8 8-- 9 9--10 1--10
print_all(make_ring(10, directed = TRUE, mutual = TRUE))
#> IGRAPH b89c41b D--- 10 20 -- Ring graph
#> + attr: name (g/c), mutual (g/l), circular (g/l)
#> + graph attributes:
#> | + name:
#> |   [1] "Ring graph"
#> | + mutual:
#> |   [1] TRUE
#> | + circular:
#> |   [1] TRUE
#> + edges from b89c41b:
#>  [1]  1-> 2  1->10  2-> 3  2-> 1  3-> 4  3-> 2  4-> 5  4-> 3  5-> 6  5-> 4
#> [11]  6-> 7  6-> 5  7-> 8  7-> 6  8-> 9  8-> 7  9->10  9-> 8 10-> 1 10-> 9