Distance calculation has incredibly evolved to be a pivotal anchor and a huge relief for commuters, data transmission settings, packet delivery and those seeking optimal paths to save time and resources. The main concern has driven from latency, resource consumption to optimized completeness in real-time bearing in mind edges and vertices configuration; whether negative or non-negative. When applied in air routing, it increases efficiency and productivity in the aviation sector and as well, improves the overall performance. When applied in data routing network – frames and packet transmission are relayed in wholeness with packet set priorities. When applied in unclassified network graph, there is need to increase the turnaround time for node-to-node traversals with mixed edge and vertices. This research paper is focused on integrating the two foremost traditional shortest path algorithms: Modified Dijkstra and Bellman-Ford. The former is fundamental in finding an optimal route in a non-negative network using complex and multiple parameters led by Comparison-Addition Model (CAM) while the later is a robust and highly efficient shortest path algorithm with full optimization in negative graphs led by Relaxation Principle (RP). The implementationality and applicability of the algorithms, and its approaches for shortest path computation bearing mind its unique characteristics, configuration and structures. Shortest path calculations from single source to multiple destinations in a digraph network involve a designated route through the edges and vertices which are meant to be linked to the entire nodes in the network. CAM and RP are methodologies used to further analyze and compare the algorithms and routing patterns called traversals.  From the source to destination nodes. The process ensured reduction in the number of iterations; quick and optimal route discovery were enhanced, and the entire network model experienced a minimized latency power. Using CAM and RP in network routing will in no doubt improve data route movement, transmission and packet delivery regardless of the network graph configurations, structures and density.