Re: negative edge weights in case of Bellman-Ford algorithm

On Mar 22, 8:18 am, "kris" <raghavakrishn...@xxxxxxxxx> wrote:
How can we have negative edge weights in case of weighted graphs.
what are the negative cost cycles in the graph? How can we have
negative cost cycles in a graph?

That depends on the application. For most applications, negative
edge weights and negative cycles don't make physical sense but
for some applications they do. For the min-cost (max) flow
problem, each iteration of the classic "cycle-canceling" algorithm
involves finding a negative cost cycle in the residual graph; and
there are *lots* of applications of min-cost flow.

.