Useful functions#
ensae_projects.challenge.city_tour.haversine_distance
(lat1, lng1, lat2, lng2)
Computes Haversine formula.
ensae_projects.challenge.city_tour.bellman_distances
(edges, distances, fLOG = None)
Computes shortest distances between all vertices. It assumes edges are symmetric.