Description Usage Arguments Details Value Author(s) References See Also Examples
For a directed graph the underlying graph is the graph that is
constructed where all edge orientation is ignored. This function
carries out such a transformation on graphNEL
instances.
1 | ugraph(graph)
|
graph |
a |
If graph
is already undirected then it is simply
returned.
If graph
is a multi-graph (has multiple edges) an error is
thrown as it is unclear how to compute the underlying graph in that
context.
The method will work for any graph
subclass for which an
edgeMatrix
method exists.
An instance of graphNEL
with the same nodes as the input but
which is undirected
.
R. Gentleman
Graph Theory and its Applications, J. Gross and J. Yellen.
1 2 3 4 5 6 7 8 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.