Description Usage Arguments Value Author(s) References See Also
View source: R/DESP_SPT_MaxDegreeRoot.R
This function computes the shortest path tree of each connected component choosing root a priori as the node of maximal degree.
1 | DESP_SPT_MaxDegreeRoot(Graph)
|
Graph |
The undirected weighted graph. |
DESP_SPT_MaxDegreeRoot
returns a list with components:
penult |
The vector containing the preceding node on the shortest path tree for each node of the graph. The root of a shortest path tree is considered to be preceded by itself. |
cc |
The list of the connected components of the given graph. |
Arnak Dalalyan and Samuel Balmand.
Dijkstra, E. W. (1959): A note on two problems in connexion with graphs, Numer. Math., 1, 269–271.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.