How can the output of floyd warshall algorithm be used to detect the presence of negative wrights?
Answers
Answered by
0
Answer:
We are given a directed graph. We need compute whether the graph has negative cycle or not. A negative cycle is one in which the overall sum of the cycle comes negative.
Negative weights are found in various applications of graphs. For example, instead of paying cost for a path, we may get some advantage if we follow the path.
Similar questions