A more generalized version of this algorithm uses an admissible heuristic function that can result in a faster run time but requires more memory, and is known as A star.  Unlike the Bellman-Ford algorithm that finds the same solution, this algorithm does not work with negative-weight edges. Its worst case run time of big O of n2 when using ordinary linked lists can be improved in sparse cases by the use of various heaps as a priority queue when r
A more generalized version of this algorithm uses an admissible heuristic function that can result in a faster run time but requires more memory, and is known as A star.  Unlike the Bellman-Ford algorithm that finds the same solution, this algorithm does not work with negative-weight edges. Its worst case run time of big O of n2 when using ordinary linked lists can be improved in sparse cases by the use of various heaps as a priority queue when running its central extract-min function. For 10 points, name this greedy algorithm that finds the shortest path tree for a given graph, named for its Dutch developer.
A more generalized version of this algorithm uses an admissible heuristic function that can result in a faster run time but requires more memory, and is known as A star.  
Dijkstra's Algorithm