This requires the igraph package to be installed. Also, this requires the names of the Nodes to be unique within the data.tree structure.

as.igraph.Node(
  x,
  vertexAttributes = character(),
  edgeAttributes = character(),
  directed = FALSE,
  direction = c("climb", "descend"),
  ...
)

Arguments

x

The root Node to convert

vertexAttributes

A vector of strings, representing the attributes in the data.tree structure to add as attributes to the vertices of the igraph

edgeAttributes

A vector of strings, representing the attributes in the data.tree structure to add as edge attributes of the igraph

directed

Logical scalar, whether or not to create a directed graph.

direction

when converting to a network, should the edges point from root to children ("climb") or from child to parent ("descend")?

...

Currently unused.

Value

an igraph object

See also

AreNamesUnique

Examples

data(acme)
library(igraph)
#> 
#> Attaching package: ‘igraph’
#> The following object is masked from ‘package:modeltools’:
#> 
#>     clusters
#> The following objects are masked from ‘package:ape’:
#> 
#>     degree, edges, mst, ring
#> The following objects are masked from ‘package:stats’:
#> 
#>     decompose, spectrum
#> The following object is masked from ‘package:base’:
#> 
#>     union
ig <- as.igraph(acme, "p", c("level", "isLeaf"))
plot(ig)