genRandomSpanningTrees: Generate a set of random spanning trees.

In mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem

Generate a set of random spanning trees.

Description

Generate a set of random spanning trees of a graph given the number of nodes of the problem instance.

Usage

genRandomSpanningTrees(m, n, type = "pruefer", simplify = TRUE)

Arguments

m	[integer(1)] Number of random spanning trees to be generated.
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”.
simplify	[logical(1)] Should the result be simplified to a matrix if appropriate? Only relevant if type is either “pruefer” or “charvec”. Default is TRUE.

Value

[list | matrix] Result type depends on simplify and type.

Examples

genRandomSpanningTrees(3, 10)
genRandomSpanningTrees(3, 10, simplify = FALSE)

genRandomSpanningTrees(3, 10, type = "edgelist")

mcMST documentation built on April 1, 2023, 12:19 a.m.