please post the whole code at once not like parts please include the screenshot of input and output

Q: Writea cprogram for agiven a graph which repreuns a flow netwolk nohere every edge uar a chpaety. Ilso given two verticess owe and sink t' in the graple, find the maximumporsibie flow flom s to f with gocoowing conspants caparity of the edge. - Invoming flowis eqnal to ouryoing flow for every vertex excep + sand't The maximum possible flowin the a bovegrap Is 23 Out put fomat is given beeow pleare fouow that Anuvde sueen ghotof input and output Output: Number of Vertices : 6 Edges:10 A:0 B : 1 Capacity: 16 A:0 B B 2 Capacity: 13 A : 1 B:2 Capacity: 10 A :2 B:1 Capacity: 4 A :3B:2 Capacity: 9 A:1 B B 13 Capacity: 12 A:2 B 2:4 Capacity: 14 A : B:3 Capacity: 7 A: 3 B : 5 Capacity: 20 A:4 B B 5 Capacity: 4 Please enter source(S) and sink(t):25 Max flow : 15 Q: Writea cprogram for agiven a graph which repreuns a flow netwolk nohere every edge uar a chpaety. Ilso given two verticess owe and sink t' in the graple, find the maximumporsibie flow flom s to f with gocoowing conspants caparity of the edge. - Invoming flowis eqnal to ouryoing flow for every vertex excep + sand't The maximum possible flowin the a bovegrap Is 23 Out put fomat is given beeow pleare fouow that Anuvde sueen ghotof input and output Output: Number of Vertices : 6 Edges:10 A:0 B : 1 Capacity: 16 A:0 B B 2 Capacity: 13 A : 1 B:2 Capacity: 10 A :2 B:1 Capacity: 4 A :3B:2 Capacity: 9 A:1 B B 13 Capacity: 12 A:2 B 2:4 Capacity: 14 A : B:3 Capacity: 7 A: 3 B : 5 Capacity: 20 A:4 B B 5 Capacity: 4 Please enter source(S) and sink(t):25 Max flow : 15