Uniform Cost Search

Last updated Nov 8, 2022 Edit Source

Take the full path cost to the node as g(n)

Terminate when a goal node is found.

Optimality: True for graph with nonnegative weights

Similar implementation to Dijkstra’s Algorithm but without computing shortest path for all nodes.

Assuming ties are handled in alphabetical order

Expansion Order: A > B > D > E > F > G Final Path: A > B > D > E > F > G