Map for route and distance planning between destinations: Create and visualize an updatable network which shows destinations and their distance with their neighborhoods according to their latitude and longitude position. The program should have the following features:
a. Identification of a direct route between two destinations: Users can identify whether two destinations are connected with a direct route or not. If there is a direct route between two destinations, the length of the route is calculated directly from their global positions.
b. Possible route plans between departure and arrival destinations: The program should list the possible routes between selected departure and arrival destinations from the shortest to the longest path.
The programming language is Python.