This function selects the maximum weighted tree among all shortest path trees, for each connected components of the given graph.

1 | ```
DESP_SPT_MaxWeight(Graph)
``` |

`Graph` |
The considered graph. |

`DESP_SPT_MaxWeight`

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 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.

Dijkstra, E. W. (1959): A note on two problems in connexion with graphs, *Numer. Math.*, **1**, 269–271.

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.