graph - 统一成本搜索和 Dijkstra 算法有什么区别？

Question

我想知道统一成本搜索和Dijkstra算法之间有什么区别。它们似乎是相同的算法。

Answer 1

Dijkstra's algorithm, which is perhaps better-known, can be regarded as a variant of uniform-cost search, where there is no goal state and processing continues until all nodes have been removed from the priority queue, i.e. until shortest paths to all nodes (not just a goal node) have been determined

http://en.wikipedia.org/wiki/Uniform-cost_search#Relationship_to_other_algorithms