This past week we worked on framing problems for search. Now you will implement some basic search...

Question

This past week we worked on framing problems for search. Now you will implement some basic search algorithms in Python. Attached below is a text file that describes a set of cities and the roads between them. A visual for the map is shown below.Your task is to write a Python module that:

Loads the cities file into memory to define a search space.
Applies breadth-first search, uniform-cost search, and A* search to find paths between cities.

Your code should be called as follows:

  python SearchCities.py

As your code runs it should print the cities that it is expanding and, when complete it should print out the final result in a clear readable format. A formula for a straight-line lat/long heuristic function is shown at the top of the cities file.

cities-d5unlroj.docx mypythonassignment2-5qw1dzo1.png

Rajashekar · Accepted Answer

albanyNY,        42.66,  73.78
atlanta,         33.76,  84.40
austin,          30.30,  97.75
boston,          42.32,  71.09
buffalo,         42.90,  78.85
calgary,         51.00, 114.00
charlotte,       35.21,  80.83
chicago,         41.84,  87.68
cleveland,       41.48,  81.67
dallas,          32.80,  96.79
dayton,          39.76,  84.20
denver,          39.73, 104.97
desMoines,       41.59,  93.62
elPaso,          31.79, 106.42
europe,          48.87,  -2.33
ftWorth,         32.74,  97.33
houston,         29.76,  95.38
indianapolis,    39.79,  86.15
jacksonville,    30.32,  81.66
japan,

This past week we worked on framing problems for search. Now you will implement some basic search algorithms in Python. Attached below is a text file that describes a set of cities and the roads...

Solution

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment