Let G=(V,E) be a directed, weighted graph with arbitrary wei…

Let G=(V,E) be a directed, weighted graph with arbitrary weights (this is, weights can be negative). You are further told there is exactly one edge e=(s, v) with negative weight. True or False: there is an algorithm to find the length of the shortest path from s to all other vertices in time O((m+n) log n).