How would you explain a uniform cost search algorithm?

In a uniform cost search method, you start with the starting state and work your way to the neighbouring states until you find the one that is the cheapest. Then, among the unvisited neighbouring states and the visited states, choose the next least expensive state. In this approach, you’d keep seeking the target state, and even if you found it, you’d keep exploring alternative possibilities. A uniform cost search algorithm would be created if every iteration of a breadth-first search algorithm had the same cost.