getRandomSpanningTree: Generate random spanning tree.
In jakobbossek/rmoco: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem
View source: R/getRandomSpanningTree.R
getRandomSpanningTree R Documentation
Generate random spanning tree.
Description
Given a grapherator object this function
returns a random spanning tree. The tree generation process is a simple heuristic:
A random weight from a U(0, 1)-distribution is assigned to each edge of the
graph. Next, a spanning tree is computed by spantree.
Usage
getRandomSpanningTree(graph)
Arguments
graph
[grapherator]
Graph.
Value
[matrix] Edge list of spanning tree edges.
Note
Most likely this heuristic does not produce each spanning tree with equal
probability.
Examples
g = genRandomMCGP(10L)
stree = getRandomSpanningTree(g)
jakobbossek/rmoco documentation built on March 21, 2023, 9:09 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/getRandomSpanningTree.R
| getRandomSpanningTree | R Documentation |
Generate random spanning tree.
Description
Given a grapherator object this function
returns a random spanning tree. The tree generation process is a simple heuristic:
A random weight from a U(0, 1)-distribution is assigned to each edge of the
graph. Next, a spanning tree is computed by spantree.
Usage
getRandomSpanningTree(graph)
Arguments
graph |
[ |
Value
[matrix] Edge list of spanning tree edges.
Note
Most likely this heuristic does not produce each spanning tree with equal probability.
Examples
g = genRandomMCGP(10L)
stree = getRandomSpanningTree(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.