Sorting is done in increasing cost of the path to a node. It always expands the least cost node. It is identical to Breadth First search if each transition has the same cost.
It explores paths in the increasing order of cost.
Disadvantage: There can be multiple long paths with the cost ≤ C*. Uniform Cost search must explore them all.
Latest posts by FreelancingGig (see all)
- Freelancers, Crypto Payments, and Taxes: An Ultimate Guide - March 17, 2023
- Freelance Environmental Consultant for Corporations: 4 FAQs About the Role Answered - February 11, 2023
- The Benefits of Taking Your Business Online With Print on Demand - January 20, 2023