Bellman–Ford negative path meaning
In the context of network routing, negative-weight edges are meaningless.

Bellman&ndash;Ford is just an algorithm for finding lowest-cost paths in a weighted graph. The algorithm itself doesn't know or care what the vertices, edges and weights mean: it just finds paths. Interpreting those paths is for the user.