Algorithm like Bellman-Ford, only for multiple start, single destination?
algorithm, bellman-ford, graph, graph-algorithm, path-finding
Solution
Just reverse all the edges, and treated destination as start node. Problem solved.
Problem
Algorithms like the Bellman-Ford algorithm and Dijkstra's algorithm exist to find the shortest path from a single starting vertex on a graph to every other vertex. However, in the program I'm writing, the starting vertex changes a lot more often than the destination vertex does. What algorithm is there that does the reverse--that is, given a single destination vertex, to find the shortest path from every starting vertex?