min_deg_triangulation: Minimum degree triangulation
In kelvinyangli/wrsgraph:
View source: R/min_deg_triangulation.R
Description
This function turns a graph to a triangulated graph by fill in the deficiency
of each node. A node with the minimum degree is selected at each step.
The elimination process removes a simplicial node at a time.
The output of the function is a triangulated graph.
Usage
1
min_deg_triangulation(graph)
Arguments
graph
A graph that is stored in an adjacency matrix.
kelvinyangli/wrsgraph documentation built on Sept. 6, 2019, 10 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
View source: R/min_deg_triangulation.R
Description
This function turns a graph to a triangulated graph by fill in the deficiency of each node. A node with the minimum degree is selected at each step. The elimination process removes a simplicial node at a time. The output of the function is a triangulated graph.
Usage
1 | min_deg_triangulation(graph)
|
Arguments
graph |
A graph that is stored in an adjacency matrix. |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.