DESP_SPT_MaxDegreeRoot2: SPT - of maximum height equal to 1 - computation choosing...
In DESP: Estimation of Diagonal Elements of Sparse Precision-Matrices
Description
Usage
Arguments
Value
Author(s)
References
See Also
View source: R/DESP_SPT_MaxDegreeRoot2.R
Description
This function computes iteratively the shortest path trees of maximum height equal to 1 and choosing the root a priori as the node of maximal degree, for each connected component.
Usage
1
DESP_SPT_MaxDegreeRoot2(Graph)
Arguments
Graph
The undirected weighted graph.
Value
DESP_SPT_MaxDegreeRoot2 returns a list of lists with components (shortest path trees):
root
The undirected weighted graph.
penult
The vector containing the preceding node on the shortest path tree for each node of the graph. The root of a tree is considered to be preceded by itself.
nodes
The set of nodes that actually belong to the tree.
Author(s)
Arnak Dalalyan and Samuel Balmand.
References
Dijkstra, E. W. (1959): A note on two problems in connexion with graphs, Numer. Math., 1, 269–271.
See Also
DESP documentation built on May 29, 2017, 9:27 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.
Description Usage Arguments Value Author(s) References See Also
View source: R/DESP_SPT_MaxDegreeRoot2.R
Description
This function computes iteratively the shortest path trees of maximum height equal to 1 and choosing the root a priori as the node of maximal degree, for each connected component.
Usage
1 | DESP_SPT_MaxDegreeRoot2(Graph)
|
Arguments
Graph |
The undirected weighted graph. |
Value
DESP_SPT_MaxDegreeRoot2 returns a list of lists with components (shortest path trees):
root |
The undirected weighted graph. |
penult |
The vector containing the preceding node on the shortest path tree for each node of the graph. The root of a tree is considered to be preceded by itself. |
nodes |
The set of nodes that actually belong to the tree. |
Author(s)
Arnak Dalalyan and Samuel Balmand.
References
Dijkstra, E. W. (1959): A note on two problems in connexion with graphs, Numer. Math., 1, 269–271.
See Also
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.