Skip to content

In this we can make a effective trip planning by choosing the Least Distance Path.

Notifications You must be signed in to change notification settings

Santhosh-M31/TripPlaner

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

TripPlaner

In this, I have coded to calculate the distance to travel to all entered cities and find optimal travel path by assuming the first city entered as the starting point. I have used the haversine formula to calculate the distance between cities. Also, it will generate an interactive map in which we can pan, zoom around places to visualize.

Haversine formula

The haversine formula determines the great-circle distance between two points on a sphere given their longitudes and latitudes. Important in navigation, it is a special case of a more general formula in spherical trigonometry, the law of haversines, that relates the sides and angles of spherical triangles.

To View the interactive Map, Download the code and run in local machine/ Colab.

About

In this we can make a effective trip planning by choosing the Least Distance Path.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published