A* is a heuristic based graph traversal algorithm to find the best shortest path between two points. It is commonly used in GPS and navigation systems.

Program Name: A_Star.py

Authors: Tyler Hanks and John Adams

Command to execute: python3 A_Star.py

The program will prompt the user for input. The program catches invalid input and requires the user to re-enter.

Modules:

 Map.py - 
	contains the Map class to store and operate on maps
	contains the implementation of the A* algorithm

PriorityQueue.py -
	contains the PriorityQueue class to implement a priority queue
	based on python's built in heapq
	The A* algorithm uses this priority queue implementation
 A_Star.py -
	contains all the user input prompts necessary to set up an A* search
	prints the path generated by the A* algorithm from the Map class