is_simplicial: Identify a simplicial node
In kelvinyangli/wrsgraph:
View source: R/is_simplicial.R
Description
This function tests if a given node is a simplicial node in a graph. A simplicial node is a node, whose
neighbours form a clique. The output of the function is a boolean variable with a value 0 or 1.
Usage
1
is_simplicial(graph, node)
Arguments
graph
A graph that is stored in an adjacency matrix.
node
A node that is expressed in text, e.g. "V1" or "X1".
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/is_simplicial.R
Description
This function tests if a given node is a simplicial node in a graph. A simplicial node is a node, whose neighbours form a clique. The output of the function is a boolean variable with a value 0 or 1.
Usage
1 | is_simplicial(graph, node)
|
Arguments
graph |
A graph that is stored in an adjacency matrix. |
node |
A node that is expressed in text, e.g. "V1" or "X1". |
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.