Implement the classic Dijkstra’s shortest path algorithm and optimize it for map

Implement the classic Dijkstra’s shortest path algorithm and optimize it for maps.
Such algorithms are widely used in geographic information systems (GIS) including
MapQuest and GPS-based car navigation systems.
1) I need the answer in “JAVA” programming.
2) go through zip file https://drive.google.com/file/d/1wMBL_wDoxAUKSg8gy… that the code needs to be optimized.
3) please follow the deliverables that needed to be uploaded.
4) Also provide me a video of explanation, how to run the code, explaining the results and code optimization(the modifications made from the
original code). So, that it’ll be very helpful to me.