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, whileundirected
creates an undirected graph.- ...
Passed to
make_tree()
orsample_tree()
.
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)
#> IGRAPH bd9f11e D--- 10 9 -- Tree
#> + attr: name (g/c), children (g/n), mode (g/c)
#> + edges from bd9f11e:
#> [1] 1-> 2 1-> 3 2-> 4 2-> 5 3-> 6 3-> 7 4-> 8 4-> 9 5->10
make_tree(10, 3, mode = "undirected")
#> IGRAPH 7c51b21 U--- 10 9 -- Tree
#> + attr: name (g/c), children (g/n), mode (g/c)
#> + edges from 7c51b21:
#> [1] 1-- 2 1-- 3 1-- 4 2-- 5 2-- 6 2-- 7 3-- 8 3-- 9 3--10