The words contained in this file might help you see if this file matches what you are looking for:
...Example u s t allow negative edges cycles shortest paths from a vertex are well define iff there no reachable then it suffices to consider simple and is finite number of these our problem g iven directed weighted graph source if does not have cycle for every compute otherwise report that we also want...