Uniform Cost Search

Uniform Cost Search expands the node n with the lowest path cost g(n). It is optimal for weighted graphs with non-negative edge weights.

Category:Uninformed Search

•

Difficulty:Intermediate

•

Time complexity:O(E + V log V)

•

Space complexity:O(V)

Interactive visualizationUCS Visualizer

Edit mode: Click/drag to draw walls, drag Start (S) or Goal (G)

Start / Goal Wall Visited Frontier Path

0 / 0

Speed:

Nodes Explored0

Frontier Size0

Path Cost g(n)—

Total Steps0

No step trace active. Click "Visualize A*" to begin algorithm execution.