graph
package,
it is another way to represent graphs. These functions are provided to
convert between the igraph and the graphNEL objects.igraph.from.graphNEL(graphNEL, name = TRUE, weight = TRUE,
unlist.attrs = TRUE)
igraph.to.graphNEL(graph)
name
weight
TRUE
(the default) these will be converted to atomic vectors,
whenever possible, before adding them to the igraigraph.from.graphNEL
returns an igraph graph object. igraph.to.graphNEL
returns a graphNEL graph object.
igraph.from.graphNEL
takes a graphNEL graph and converts it to
an igraph graph. It handles all graph/vertex/edge attributes. If the
graphNEL graph has a vertex attribute called name
name
Because graphNEL graphs poorly support multiple edges, the edge
attributes of the multiple edges are lost: they are all replaced by
the attributes of the first of the multiple edges.
igraph.to.graphNEL
converts and igraph graph to a graphNEL
graph. It converts all graph/vertex/edge attributes. If the igraph
graph has a vertex attribute name
get.adjacency
, graph.adjacency
,
get.adjlist
and graph.adjlist
.g <- graph.ring(10)
V(g)$name <- letters[1:10]
GNEL <- igraph.to.graphNEL(g)
g2 <- igraph.from.graphNEL(GNEL)
g2
Run the code above in your browser using DataCamp Workspace