find vertices with negative infinity as the smallest distance in bell man ford
Answers
Answer:
Step-by-step explanation:
You want to find the length of shortest paths from vertex v to every other vertex. ... of the shortest path must be equal to minus infinity); however, this algorithm can be ... Unlike many other graph algorithms, for Bellman-Ford algorithm, it is more .... at least one more relaxation, then the graph contains a negative weight cycle
Negative weight edges might seem useless at first but they can explain a lot of phenomena like cashflow, heat released/absorbed in a chemical reaction etc.
For instance, if there are different ways to reach from one chemical A to another chemical B, each method will have sub-reactions involving both heat dissipation and absorption.
If we want to find the set of reactions where minimum energy is required, then we will need to be able to factor in the heat absorption as negative weights and heat dissipation as positive weights.