How would you explain a uniform cost search algorithm?

In a uniform cost search algorithm, you start from the initial state and go to the neighbouring states to choose the ‘least costly’ state. From there, you’ll select the next least costly state from the unvisited neighbouring states and the visited states. You’d keep looking for the goal state in this manner, and even if you do, you’ll look for other potential states. If every iteration of a breadth-first search algorithm had the same cost, it would become a uniform cost search algorithm.