Question

I have a directed graph whose vertices have costs. I would like to find the path with maximum cost between two vertices, but I have only found algorithms to solve the path with minimum cost.

Also, I’m using Java.

Answer 1

1. Normalize all costs so that the minimum cost is greater than 0.
2. Change all costs to (1/cost).
3. Run minimum cost algorithm.

The resulting path is the maximum cost path on the original graph.