Largest possible cost of a shortest path in which every edge's length is either -1, 0, or 1
a shortest path between any two nodes has at most n - 1 edges


This is only true for simple paths (paths with no repeat nodes). If there is a negative-cost cycle, you can take the cycle multiple times to get a shorter path.