DESP_MST_MaxDegreeRoot: MST computation

Description Usage Arguments Value Author(s) References See Also

View source: R/DESP_MST_MaxDegreeRoot.R

Description

This function computes the minimum spanning trees, choosing the root of each tree as the node of maximal degree of the connected component.

Usage

1

Arguments

Graph

The considered graph.

Value

DESP_MST_MaxDegreeRoot returns a list with components:

penult

The vector containing the preceding node on the spanning tree for each node of the graph. The root of a spanning tree is considered to be preceded by itself.

cc

The list of the connected components of the given graph.

Author(s)

Arnak Dalalyan and Samuel Balmand.

References

Kruskal, J. B. Jr. (1956): On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc., 7, 48–50.

See Also

connComp, mstree.kruskal


DESP documentation built on May 29, 2017, 9:27 p.m.