Write code that finds a maximum flow in a directed graph, using the Ford-Fulkers

Question

Write code that finds a maximum flow in a directed graph, using the Ford-Fulkerson
algorithm on capacities given as matrix
void maximum flow(int n, int s, int t, int *capacity, int *flow)
Your function has the following arguments:
- n: the number of vertices of the graph,
- s: the start vertex,
- t: the target vertex
- capacity: the matrix of edge capacities.
- flow: the matrix used to return the maximum ?ow.
The vertices are numbered from 0 to n-1, so s and t are numbers in that range. ca-
pacity, flow are a pointers to n

Explanation / Answer

the start vertex

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.