A proposed network of irrigation canals is described in the accompanying diagram. At peak demand, the...

Transcribed Image Text:

A proposed network of irrigation canals is described in the accompanying diagram. At peak demand, the flows at interchanges A, B, C, and D are as shown. - fi 20 B 3 55 A f2 f4 D 20 fs 0 15 1. Find the possible flows using MATLAB. Assume f = 5. 2. Represent the network of irrigation canals as an adjacency matrix and plot in MATLAB. 3. Suppose the capacity of the canals are C = 10, C2 = 5, C3 = 10, C = 20, C5 = 10. Find the maximum possible flow from A to C and plot graph with flows. 4. Carry out a breadth first search in MATLAB and display the traversal order. 5. Carry out a depth first search in MATLAB and display the traversal order. A proposed network of irrigation canals is described in the accompanying diagram. At peak demand, the flows at interchanges A, B, C, and D are as shown. - fi 20 B 3 55 A f2 f4 D 20 fs 0 15 1. Find the possible flows using MATLAB. Assume f = 5. 2. Represent the network of irrigation canals as an adjacency matrix and plot in MATLAB. 3. Suppose the capacity of the canals are C = 10, C2 = 5, C3 = 10, C = 20, C5 = 10. Find the maximum possible flow from A to C and plot graph with flows. 4. Carry out a breadth first search in MATLAB and display the traversal order. 5. Carry out a depth first search in MATLAB and display the traversal order.