negative edge weights in case of Bellman-Ford algorithm

From: "kris" <raghavakrishna.j@xxxxxxxxx>
Date: 22 Mar 2007 05:18:34 -0700

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?

.

Follow-Ups:
- Re: negative edge weights in case of Bellman-Ford algorithm
  - From: GCRhoads

Prev by Date: Re: "compilation" and "semantics" difference between RPC and ordinary procedure call
Next by Date: Two challenging problems
Previous by thread: Re: history of generative grammars
Next by thread: Re: negative edge weights in case of Bellman-Ford algorithm
Index(es):
- Date
- Thread