I am trying to implement Prim's algorithm but instead of finding the minimum cost path I need to find the maximum cost path. There is a good implementation of the algorithm which I currently like in:
http://www.geeksforgeeks.org/greedy-algorithms-set-5-prims-mst-for-adjacency-list-representation/
I am trying to modify the algorithm (it should just be a couple of changes in some comparison operations) but until know it hasn't been successful.
I need help to adapt it.