Maximum weighted tree among all shortest path trees computation

Share:

Description

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

Usage

1

Arguments

Graph

The considered graph.

Value

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.

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

dijkstra.sp