# Ford's algorithm: why does number of iterations depend on max cost?

I recently learned Ford's algorithm to find the shortest paths in a digraph without any cost-negative cycles. To estimate its efficiency, we learned that it has at most $$C \cdot n^2$$ steps with $$C := 1 + 2 \cdot \text{max}\{|c_{(a,b)}| : (a,b) \in A\}$$ where $$n$$ is the number of vertices, $$A$$ are the edges and $$c$$ are the associated costs which are all integers.

I really struggle with understanding why the highest cost is relevant for how many iterations are needed. Can anyone explain this to me?

The proof of convergence of the algorithm shows that the cost decreases after each iteration, and since it can decrease by as little as one unit, it stands to reason that the number of iteration is bounded by $$C$$ times cost of the iteration.