Learn R Programming

DESP (version 0.2-2)

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

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

DESP_SPT_MaxDegreeRoot2(Graph)

Arguments

Graph
The undirected weighted graph.

Value

DESP_SPT_MaxDegreeRoot2 returns a list of lists with components (shortest path trees):

References

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

See Also

dijkstra.sp