How do I find a survivable shortest-path tree in a directed graph where each directed edge is positively weighted?
The tree may not include all the nodes of the graph and "shortest-path" means the maximal distance from the source to any destination is minimized; and "survivable" means that for the pruned graph by the removal of the directed edges of the tree, another tree can be found.