Answer:
- Begin
- find the residual graph of the graph G(V,E) using ford Fulkerson
- For each edge u, v in the residual graph such that u, v is not in the residual graph and also not in G
- Apply DFS to see if u has no path to v
- then return edge (u,v)
- else
- nothing
- end
Step-by-step explanation:
(-2 ,-15)
(-1, -7)
(0,1)
(1, -7)
(2, - 15)
Answer:
16/25
Step-by-step explanation:
got it on calculator
