Prims Algorithm on MST
A* Search Uses evaluation function f (n)= g(n) + h(n) where n is a node. – g is a cost function Total cost incurred so far from initial state at node n.
Properties of Heuristics that Guarantee A* Finds Optimal Paths Robert Holte this talk: holte/CMPUT651/admissibility.ppt.
A* Search
