Convert a key to an igraph directed graph

Unlike toNewick() and toDataTree(), which use a spanning tree, this keeps the key's true structure: a couplet reached from several leads has several incoming edges. Each edge carries the lead's label and Character text; vertices are couplets and taxa.

Usage

toIgraph(key)

Arguments

key

A dimoose key.

Value

An igraph::igraph directed graph.

Examples

if (FALSE) { # \dontrun{
g <- toIgraph(arachnidaKey())
igraph::vcount(g)
} # }