(a) Consider the network G: (i) [1 Mark] Give an example of a cycle in G....

Transcribed Image Text:

(a) Consider the network G: (i) [1 Mark] Give an example of a cycle in G. (ii) [1 Mark] Give an example of a path in G that consists of four nodes but is not a cycle. (iii) [1 Mark] Give an example of a chain in G that consists of four nodes but is not a path. (iv) [2 Marks] Does the network G have a possible source and sink? If it does, what are they? Explain your answer. (b) [5 Marks] A network flow model is depicted below with capacities shown. Use the Ford- Fulkerson algorithm to find the maximal flow from A to B. 3 A 3 B (a) Consider the network G: (i) [1 Mark] Give an example of a cycle in G. (ii) [1 Mark] Give an example of a path in G that consists of four nodes but is not a cycle. (iii) [1 Mark] Give an example of a chain in G that consists of four nodes but is not a path. (iv) [2 Marks] Does the network G have a possible source and sink? If it does, what are they? Explain your answer. (b) [5 Marks] A network flow model is depicted below with capacities shown. Use the Ford- Fulkerson algorithm to find the maximal flow from A to B. 3 A 3 B