make_tree: Create tree graphs

In igraph: Network Analysis and Visualization

Create tree graphs

Description

Create a k-ary tree graph, where almost all vertices other than the leaves have the same number of children.

Usage

make_tree(n, children = 2, mode = c("out", "in", "undirected"))

tree(...)

Arguments

n	Number of vertices.
children	Integer scalar, the number of children of a vertex (except for leafs)
mode	Defines the direction of the edges. out indicates that the edges point from the parent to the children, ⁠in⁠ indicates that they point from the children to their parents, while undirected creates an undirected graph.
...	Passed to make_tree() or sample_tree().

Value

An igraph graph

See Also

Other deterministic 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_ring(), make_star()

Examples

make_tree(10, 2)
make_tree(10, 3, mode = "undirected")

igraph documentation built on Aug. 10, 2023, 9:08 a.m.