WEEK 04 LECTURE 02

UNIFORM COST SEARCH

RECALL THE GRAPH ALGORITHM
 Find the path using BFS
FINDING PATH FROM CHICAGO TO SAULT STE MARLE
 Is the path found through BFS is Shorttest ?
 How can we find the shortest path ?
 Try to write down an algorithm.
 Change the fringe with Priority Queue.
RECALL THE GRAPH ALGORITHM

Initialize frontier with priority queue

FINDING PATH FROM CHICAGO TO SAULT STE MARLE
 Give Dry Run