Character constant, defines the conversion algorithm. For
as.directed it can be mutual or arbitrary. For
as.undirected it can be each or collapse. See
details below.
Value
A new graph object.
concept
Directed graph
Undirected graph
code
as.undirected
itemize
each
item
collapse
Details
Conversion algorithms for as.directed:
arbitrary
{The number of
edges in the graph stays the same, an arbitrarily directed edge is
created for each undirected edge.}
mutual{Two directed edges are created for each undirected
edge, one in each direction.}
See Also
simplify for removing multiple and/or loop edges
from a graph.