Consider a directed graph and a source vertex with the following properties: edges that leave the source vertex have arbitrary $($possibly negative$)$ lengths; all other edge lengths are nonnegative; and there are no edges from any other vertex to the source $.$

Does Dijkstra's shortest$-$path algorithm correctly compute shortest$-$path distances $($from $)$ in this graph?