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(...)
Value
An igraph graph
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.