SPT - of maximum height equal to 1 - computation choosing root a priori as the node of maximal degree

Share:

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

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

dijkstra.sp