powered by
data.tree
This requires the igraph package to be installed. Also, this requires the names of the Nodes to be unique within the data.tree structure.
Nodes
as.igraph.Node( x, vertexAttributes = character(), edgeAttributes = character(), directed = FALSE, direction = c("climb", "descend"), ... )
an igraph object
igraph
The root Node to convert
Node
A vector of strings, representing the attributes in the data.tree structure to add as attributes to the vertices of the igraph
A vector of strings, representing the attributes in the data.tree structure to add as edge attributes of the igraph
Logical scalar, whether or not to create a directed graph.
when converting to a network, should the edges point from root to children ("climb") or from child to parent ("descend")?
Currently unused.
AreNamesUnique
data(acme) library(igraph) ig <- as.igraph(acme, "p", c("level", "isLeaf")) plot(ig)
Run the code above in your browser using DataLab