Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 5
The Shortest path problem
From To On route Distance Nodes Netflow
O A 1 2 O 1 = O B 0 5 A 0 = O C 0 4 B 0 = A B 1 2 C 0 = A D 0 7 D 0 = B A 0 2 E 0 = B C 0 1 T -1 = B D 1 4 B E 0 3 C B 0 1 C E 0 4 D B 0 4 D E 0 1 D T 1 5 E B 0 3 E D 0 1 E T 0 7
Total Distance 13
FROM TO DISTANCE ON ROUTE NODES NETFLOW SUPPLY/DEMAND
O A 30 0O 1= 1 O T 100 0A 0= 0 A B 10 0B 0= 0 A C 60 0C 0= 0 B C 50 0T -1 = -1 B T 15 0 TOTAL DISTANCE 0 Supply/Demand 1 0 0 0 0 0 -1