Currently the implementation uses a min-heap and so always finds the least expensive path. In some cases it is possible to find the most expensive path by pre-processing the input and negating values, but this is not always feasible. It would be good to allow finding the most expensive path through the use of a max-heap.
Currently the implementation uses a min-heap and so always finds the least expensive path. In some cases it is possible to find the most expensive path by pre-processing the input and negating values, but this is not always feasible. It would be good to allow finding the most expensive path through the use of a max-heap.