Question

Suppose that you want to find the shortest path between node 1 and node N in a network. Discuss how the network flow model can be applied to solve this problem.Suppose that you want to find the shortest path between node 1 and node N in a network. Discuss how the network flow model can be applied to solve this problem.

Answer 1

Though network model is use to find the lowest cost ( transportation problem),minimum spannin tree and mutiple other things which also include shortest path.To find the shortest path between two nodes from 1 to node N we have to follow the below steps.

Step 1: - We try and find the distance from all the neighbouring nodes from thh starting point and write it down at that nodal point

Step 2:- For all the neighbouring node we will repeat the exercse for their neighbouring node except the starting node. In case of common node we will write the shortest path from the begining node for that node

Step 3:- we will repeat the steps till we reach the final node and this will provide us with the shortest path.

Step 4:- Trace back to begining to find the shortest path