Consider the following network where the numbers represent actual distances between corresponding nodes. 4 O 3 6 A B 4 3

Post by **answerhappygod** » Fri Jul 01, 2022 9:06 am

: Consider The Following Network Where The Numbers Represent Actual Distances Between Corresponding Nodes 4 O 3 6 A B 4 3 1 (16.7 KiB) Viewed 60 times

a) Use Dijkstra’s algorithm to find all shortest paths fromO to T.
b) Use the algorithm for the minimum spanning tree problemto determine the minimum spanning tree(s).
c) Assume that the numbers on the arcs represent unitshipping costs and there is a source supplying 10 units at node Oand a sink requiring 7 units at node T, while all other nodes aretransshipment nodes. Write the flow balance equations for node O,C, and T of the corresponding minimum cost network flow problem.Assume that the arcs incident to node O are directed away from thenode while the arcs incident to node T are directed toward T, e.g.arcs OA and GT exist but AO and TG do not exist. Also assume thatthe arcs incident to node C are directed: AC, OC, BC, CD, CE andCF.
Consider the following network where the numbers represent actual distances between corresponding nodes. 4 O 3 6 A B 4 3 55 160 5 D 5 E 1 3 F 6 5 3 2 G 3 T