The Dijkstra algorithm is a common method used when solving shortest path problems. It is a graph-based method that compares node distances, selects the shortest subsequent node, and generates an ideal path. However, it is seen that the method struggles with memory utilization, particularly when working with substantial amounts of data or graphs. The purpose of this research work is to improve the algorithm to tackle the current problem. The enhancement is accomplished by providing an approach in which the two closest nodes are combined in each iteration. With this, the conclusion of the study is that the enhanced Dijkstra algorithm, with the application of node combination, was able to reduce the memory usage in comparison to the existing Dijkstra algorithm.