Shortest Path Trajectory System Based on Dijkstra Algorithm

In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. Everybody can travel by different routes to reach a different destination point. This can be time consuming if they do not travel trough the best route. This project aims to determine locations of the node that reflect all the items in the list, build the route by connecting nodes and evaluate the proposed algorithm for the single source shortest path problem. This project includes the modification of main algorithm which has been implemented in the prototype development. This study discussed the emphasis on the single source shortest path at the location of specific studies. The study will produce a decision-makers prototype.