Description Usage Arguments Value Author(s) References See Also
View source: R/DESP_MST_MaxDegreeRoot.R
This function computes the minimum spanning trees, choosing the root of each tree as the node of maximal degree of the connected component.
1 | DESP_MST_MaxDegreeRoot(Graph)
|
Graph |
The considered graph. |
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. |
Arnak Dalalyan and Samuel Balmand.
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.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.