What's the difference between uniform-cost search and Dijkstra's algorithm?

Question

I was wondering what\'s the difference between uniform-cost search and Dijkstra\'s algorithm. They seem to be the same algorithm.

Answer 1

The main difference is that Dijkstra's algorithm is defined when numbers of vertices is finite. It says to put all the vertices in a queue. But we can not put all the vertices in a queue when numbers of vertices tend to infinite. Uniform Cost Search is defined in a situation like this, where numbers of vertices are unknown.