genRandomSpanningTree: Generate a random spanning tree.
In jakobbossek/mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem
View source: R/genRandomSpanningTrees.R
genRandomSpanningTree R Documentation
Generate a random spanning tree.
Description
Generate a random spanning tree of a graph
given the number of nodes of the problem instance.
Usage
genRandomSpanningTree(n, type = "pruefer")
Arguments
n
[integer]
Number of nodes of the problem.
type
[character(1)]
String representing the desired format of the generated
spanning tree. Possible values are “pruefer” (Pruefer-code),
“edgelist” and “charvec” (characteristic vector).
Default is “pruefer”.
Value
[integer | matrix(2, n)] Return type depends on type.
Examples
genRandomSpanningTree(10)
genRandomSpanningTree(10, type = "edgelist")
jakobbossek/mcMST documentation built on March 14, 2023, 4:28 p.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/genRandomSpanningTrees.R
| genRandomSpanningTree | R Documentation |
Generate a random spanning tree.
Description
Generate a random spanning tree of a graph given the number of nodes of the problem instance.
Usage
genRandomSpanningTree(n, type = "pruefer")
Arguments
n |
[ |
type |
[ |
Value
[integer | matrix(2, n)] Return type depends on type.
Examples
genRandomSpanningTree(10) genRandomSpanningTree(10, type = "edgelist")
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.