Is it possible to modify Dijkstras algorithm in order to get the longest path from $s$ to $t$ ?.My intuition says that Ill need a different algorithm entirely. Finding the longest path is the same as finding the shortest path on a graph with negative weights. However, Dijkstras algorithm requires that the weights are positive, so it cannot be modified to calculate the longest path. A better algorithm to use could be: http://en.wikipedia.org/wiki/Longest_path_problemAny idea of how to modify it?
Is it possible to modify dijkstra algorithm in order to get the longest path?
algorithms;graph theory;algorithm analysis;graphs