Given a digraph D $=($V$,$A;l$)$ with non$-$negative edge lengths, and a spanning $($directed$)$ tree T rooted as s in D$,$ describe a linear$-$time algorithm which tests whether T is a shortest$-$path tree from s$.$