Uniform-cost search is an algorithm used in pathfinding and graph traversal that expands the least costly node first. It guarantees finding the optimal solution in terms of the lowest path cost, making it particularly effective for weighted graphs. This algorithm is closely related to both breadth-first search and Dijkstra's algorithm, as it uses a priority queue to keep track of the nodes to be explored based on their cumulative cost from the starting node.
congrats on reading the definition of uniform-cost search. now let's actually learn it.