Create a ring graph

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(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.

Value

An igraph graph.

Related documentation in the C library

ring()

See also

Other deterministic constructors: graph_from_atlas(), graph_from_edgelist(), graph_from_literal(), make_(), make_chordal_ring(), make_circulant(), make_empty_graph(), make_full_citation_graph(), make_full_graph(), make_full_multipartite(), make_graph(), make_lattice(), make_star(), make_tree(), make_turan(), make_wheel()

Examples

print_all(make_ring(10))
#> ── <igraph> Ring graph ────────────────────────────────────────────── 3fd87ec ──
#> ℹ undirected
#> ℹ 10 vertices · 10 edges
#> 
#> ── Attributes ──────────────────────────────────────────────────────────────────
#> → graph:  name <chr>, mutual <lgl>, circular <lgl>
#> 
#> ── Graph attributes ────────────────────────────────────────────────────────────
#> name:
#>   [1] "Ring graph"
#> mutual:
#>   [1] FALSE
#> circular:
#>   [1] TRUE
#> 
#> ── Edges ───────────────────────────────────────────────────────────────────────
#>  [1] 1 ─ 2   2 ─ 3   3 ─ 4   4 ─ 5   5 ─ 6   6 ─ 7   7 ─ 8   8 ─ 9   9 ─ 10 
#> [10] 1 ─ 10 
print_all(make_ring(10, directed = TRUE, mutual = TRUE))
#> ── <igraph> Ring graph ────────────────────────────────────────────── ec9f427 ──
#> ℹ directed
#> ℹ 10 vertices · 20 edges
#> 
#> ── Attributes ──────────────────────────────────────────────────────────────────
#> → graph:  name <chr>, mutual <lgl>, circular <lgl>
#> 
#> ── Graph attributes ────────────────────────────────────────────────────────────
#> name:
#>   [1] "Ring graph"
#> mutual:
#>   [1] TRUE
#> circular:
#>   [1] TRUE
#> 
#> ── Edges ───────────────────────────────────────────────────────────────────────
#>  [1] 1 → 2   2 → 1   2 → 3   3 → 2   3 → 4   4 → 3   4 → 5   5 → 4   5 → 6  
#> [10] 6 → 5   6 → 7   7 → 6   7 → 8   8 → 7   8 → 9   9 → 8   9 → 10  10 → 9 
#> [19] 10 → 1  1 → 10