Consider that T is a given spanning tree of an undirected graph G which contains n vertices and m edges. A shortest-path tree of graph G is a rooted spanning tree of G such that, from the root to any vertex, the path going along only tree edges is a shortest path. In this paper, an O(m + n&time algorithm is proposed to determine whether T is a shortest-path… (More)