Chapter 10 Network Routing Application
Shaharuddin Salleh, Zuraida Abal Abas · 2016
In a weighted graph, a pair of nodes can be linked in one or more unique paths. The objective here is to find the path with the minimum sum of the weights along its path. The shortest path SP between two nodes, the source, and its destination in a graph G(V, E) is defined as follows: Given a weighted and connected graph G(V, E) with n nodes, find the minimal cost linking a pair of nodes in the graph.