Using Djikstras Algorithm as the idea behind this code I was able to create a python program that gets geoJSON data (for an app challenge) and finds the nearest points between certain coordinates. It's pretty simple and I'm not Newton as math so the internet helped a lot.

Current Features:

• Get nearest coords
• Get user input

To be Added:

• Recognize for points with crosswalks and connect those two endpoints together if found.

For more info check: https://www.geeksforgeeks.org/dsa/dijkstras-shortest-path-algorithm-greedy-algo-7/ https://www.w3schools.com/dsa/dsa_algo_graphs_dijkstra.php