Javascript project to take in Openstreetmap data and show routes between two places using two different algorithms to compare the routes showed by both the algorithms
Budget: $30 – $250 USD
I am looking to develop a Javascript project that will take data from OpenStreetMap files and use two different algorithms to show the best routes between two places and compare the results.
The source of data for this project will be OpenStreetMap files. The two algorithms I want to use are Dijkstra's algorithm and BFS (Breadth First Search). I need a comparison between the results to see which route is better for the user.
The source of data for this project will be OpenStreetMap files. The two algorithms I want to use are Dijkstra's algorithm and BFS (Breadth First Search). I need a comparison between the results to see which route is better for the user.