Unit – 1 – Problem Solving
Uninformed Searching Strategies-Uniform Cost Search
Use a priority queue instead of a simple queue
Insert nodes in the increasing order of the cost of the path so far
Guaranteed to find an optimal solution!
This algorithm is called uniform-cost search

Enqueue nodes by path cost.
That is, let g(n) = cost of the path from the start node to the current node n.
Sort nodes by increasing value of g.

Expanded node Nodes list
{ S0 }
S0 { B1, A3, C8 }
B1 { A3, C8, G21 }
A3 { D6, C8, E10, G18, G21 }
D6 { C8, E10, G18, G21 }
C8 { E10, G13, G18, G21 }
E10 { G13, G18, G21 }
G13 { G18, G21 }
Solution path found is S C G, cost 13
Number of nodes expanded (including goal node) = 7

Subscribe this channel, comment and share with your friends.
For Syllabus, Text Books, Materials and Previous University Question Papers and important questions
Follow me on
Blog : https://dsumathi.blogspot.com/
Facebook Page : https://www.facebook.com/profile.php?...
Instagram :   / dsumathiphd