Assignment 4 (Informed Search)

QUESTION
Implement Greedy Best First Search and A* for the submitted weighted A-Z graph and heuristics. Print the expansion order, actual start-to-goal path, and total path cost. Explain h(n) versus g(n)+h(n).

SOURCE NOTE
Condensed from the Lab 4 document and submitted notebook. The revised greedy code reconstructs the parent path rather than treating expansion order as a path.
