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