Maximum weighted tree among all shortest path trees computation
This function selects the maximum weighted tree among all shortest path trees, for each connected components of the given graph.
The considered graph.
DESP_SPT_MaxWeight returns a list with components:
The vector containing the preceding node on the shortest path tree for each node of the graph. The root of a spanning tree is considered to be preceded by itself.
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.
Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.