We encounter problems when the graphs include negative cycles.
Shortest Path from s to d can become arbitrarily short (there is no shortest path).