In a graph with negative cycles reachable from the starting point, the notion of a shortest path breaks down, since you can make the distance to any node as negative ... case of minimum-cost flow, so ...