d_wrs: Definite-WRS for maximum degree 3 graphs
In kelvinyangli/wrsgraph:
Description
This function is a polynomial time algorithm for checking the morality of
undirected graphs with maximum degree 3. The algorithm has been proved to be
correct. It finds a simplicial clique (i.e., a simplicial node
and its neighbours), and removes the entire clique.
Usage
1
Arguments
G
A given undirected graph stored in an adjacency matrix format.
debug
A boolean argument to show steps of the backtracking algorithm.
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.
Description
This function is a polynomial time algorithm for checking the morality of undirected graphs with maximum degree 3. The algorithm has been proved to be correct. It finds a simplicial clique (i.e., a simplicial node and its neighbours), and removes the entire clique.
Usage
1 |
Arguments
G |
A given undirected graph stored in an adjacency matrix format. |
debug |
A boolean argument to show steps of the backtracking algorithm. |
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.