The present research evaluates graph theory, particularly game theory, to address computer network and transportation system routing issues. It examines the significance of shortest-path algorithms in reducing expenses and maximizing performance. The study compares the benefits and drawbacks of several approaches, including Dijkstra’s algorithm, for particular use scenarios. These algorithms are easier to understand when presented in a graphical format. A graph theory-based methodology for determining the best routing options is provided. The study evaluates algorithm performances, taking accuracy and temporal complexity into account, and criticizes the inefficiencies of the available commercial solutions. Its goal is to enhance routing performance and efficiency while thoroughly explaining theoretical ideals and real-world implementations.