# CS4800 - Mini Pacman Bar Hopping

# Input: Cities to visit

# Output: Route to the highest rated bar in each city

import json, requests # for making request to Google Maps

import urllib2, sys, time

import yelp

import tsp_solver

SEARCH_LIMIT = 1

#Get the coordinates of the origin

def get_origin(oAddress):

return(returnDict)

# ------

# STEP 1 - Get top restaurants

# ------

# coordinates of locations

locations = []

# User-friendly Addresses

prettyLocations = []

while True:

# Get origin address

origin = raw_input('Enter starting address (Ex: 300 Huntington Avenue, Boston): ')

originInfo = get_origin(origin)

if originInfo:

break

print("Not a searchable address! Please input a correct address")

time.sleep(1)

print(originInfo)

locations.append(originInfo["coordinates"])

cities = [originInfo["city"]]

#originCoordinates = get_origin(origin)

#locations.append(originCoordinates)

prettyLocations.append(['origin',origin])

# Get cities

extra_cities = raw_input('Enter cities (Ex: Boston,Cambridge,LA,Philadelphia): ').split(',')

if len(extra_cities) > 0 and extra_cities[0] != '':

cities += extra_cities

print(cities)

if len(cities) == 1:

SEARCH_LIMIT = int(raw_input("Enter the number of bars to visit: "))

print('-' * 50)

counter = 0

# Get list of top restaurants in each city

for city in cities:

try:

print('')

response = yelp.query_api('bars', city, SEARCH_LIMIT)

#pprint.pprint(response)

for item in response:

locations.append(str(item.get('location').get('coordinate').get('latitude')) + ',' +

str(item.get('location').get('coordinate').get('longitude')))

# change to use coordinates to be more accurate

# Print out restaurant name and address

prettyName = ""

print("\n" + city + ':')

print(item.get('name'))

if len(item.get('location').get('display_address')) > 0:

prettyName += item.get('location').get('display_address')[0]

print(item.get('location').get('display_address')[0])

if len(item.get('location').get('display_address')) > 1:

prettyName += ", "+item.get('location').get('display_address')[1]

print(item.get('location').get('display_address')[1])

if len(item.get('location').get('display_address')) > 2:

prettyName += ", "+item.get('location').get('display_address')[2]

print(item.get('location').get('display_address')[2])

prettyLocations.append([item.get('name'),prettyName])

except urllib2.HTTPError as error:

sys.exit('Encountered HTTP error {0}. Abort program.'.format(error.code))

print('\n' + ('-' * 50))

# ------

# STEP 2 - Get distances between each restaurant

# ------

#print('Getting distances...')

# Generate list of locations to visit in order

url = 'http://maps.googleapis.com/maps/api/directions/json'

# Create 2D array to keep track of pairs of locations - USE NUMPY LATER

pairs = [[0]*len(locations) for x in xrange(len(locations))]

distances_matrix = [[0]*len(locations) for x in xrange(len(locations))]

# Numbers to indicate progress

lookupNum = 0

for i in range(len(locations) - 1):

lookupNum += (i+1)

counter = 0

for i in range(0, len(locations)):

for j in range(0, len(locations)):

# Skip over duplicate pairs of locations to reduce requests

if pairs[i][j] != 1 and i != j:

# Set parameters

params = dict(

origin=locations[i],

destination=locations[j]

)

# Set to 1 to skip later

pairs[i][j] = 1

pairs[j][i] = 1

# Send request to Google Maps

time.sleep(0.5)

resp = requests.get(url=url, params=params)

data = json.loads(resp.text)

# Storing distances in matrix for tsp_solver

distances_matrix[i][j] = data.get('routes')[0].get('legs')[0].get('distance').get('value')

distances_matrix[j][i] = data.get('routes')[0].get('legs')[0].get('distance').get('value')

counter += 1

sys.stdout.write("\rGetting Distances...%d%%" % int((float(counter)/lookupNum) * 100))

sys.stdout.flush()

print('\n' + ('-' * 50))

# ------

# STEP 3 - Algorithm to find shortest path

# ------

print('Calculating shortest route...')

# Returns route cycle

cities_index = tsp_solver.solve_tsp(distances_matrix, 3)

# Start and end cycle at start location

print('\nRoute:')

route_distance = 0

previous = 0

for index, city in enumerate(cities_index):

route_distance += distances_matrix[previous][city]

print("%d miles driven - %s\n%s\n" % (int(route_distance*0.00062137), prettyLocations[city][0], prettyLocations[city][1]))

previous = city

route_distance += distances_matrix[cities_index[-1]][0]

print("%d miles driven - %s\n%s\n" % (int(route_distance*0.00062137), prettyLocations[0][0], prettyLocations[0][1]))

print("Total Distance Traveled: %d miles" % int(route_distance*0.00062137))

print('\nDone!')