getNumberOfSpanningTrees: Compute number of spanning trees of a graph
In mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem
View source: R/getNumberOfSpanningTrees.R
getNumberOfSpanningTrees R Documentation
Compute number of spanning trees of a graph
Description
Makes use of Kirchhoff's matrix tree theorem to compute the
number of spanning trees of a given graph in polynomial time.
Usage
getNumberOfSpanningTrees(graph)
Arguments
graph
[grapherator]
Graph.
Value
[integer(1)]
Examples
# generate complete graph
g = genRandomMCGP(10)
# this is equal to 10^8 (Cayley's theorem)
getNumberOfSpanningTrees(g)
mcMST documentation built on April 1, 2023, 12:19 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/getNumberOfSpanningTrees.R
| getNumberOfSpanningTrees | R Documentation |
Compute number of spanning trees of a graph
Description
Makes use of Kirchhoff's matrix tree theorem to compute the number of spanning trees of a given graph in polynomial time.
Usage
getNumberOfSpanningTrees(graph)
Arguments
graph |
[ |
Value
[integer(1)]
Examples
# generate complete graph
g = genRandomMCGP(10)
# this is equal to 10^8 (Cayley's theorem)
getNumberOfSpanningTrees(g)
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.