A Novel Optimized Travel Planner

In 1959, Dijkstra announced a method for determining the shortest path between two nodes in a network. This algorithm has received much attention because it can deal with various real-life problems. The algorithm is a greedy type. Other types of algorithms are also created and compared. Application-related changes are made to the original algorithm. The time complexity of the algorithm increases at the expense of space complexity. Space is more complex with modern hardware, so that you can implement such an algorithm