4 edited tags
| link
3 deleted 5 characters in body; edited title
source | link

What is the significance of negative weight edges in a graph?

I was doing the dynamic programming exerciseexercises and found FLOYDthe Floyd-WARSHALLWarshall algorithm and it says that. Apparently it finds all pair-pairs shortest paths for a graph which can have negative weight edges as well, but no negative cycles.

So, I wonder what iswhat's the real world significance of negative weight edges  ? plain englishA plain English explanation would be much helpful.

What is significance of negative weight edges in graph?

I was doing the dynamic programming exercise and found FLOYD-WARSHALL algorithm and it says that it finds all pair shortest for graph which can have negative weight edges as well but no negative cycles.

So, I wonder what is real world significance of negative weight edges  ? plain english explanation would be much helpful.

What is the significance of negative weight edges in a graph?

I was doing dynamic programming exercises and found the Floyd-Warshall algorithm. Apparently it finds all-pairs shortest paths for a graph which can have negative weight edges, but no negative cycles.

So, I wonder what's the real world significance of negative weight edges? A plain English explanation would be helpful.

    Tweeted twitter.com/#!/StackCompSci/status/377586676631371776
2 edited tags
| link
1
source | link