Quiz Question - 08-06-2023 - Network Flow
Consider a directed graph with 7 vertices (A, B, C, D, E, F, G), representing a system of pipes. The edges (pipes) have capacities (maximum flows) as described below:
- A to B: 15 units
- A to C: 10 units
- B to D: 15 units
- B to E: 5 units
- C to F: 10 units
- C to G: 15 units
- D to E: 10 units
- E to F: 15 units
- F to G: 25 units
- D to G: 20 units
If we want to move the maximum possible flow from A to G, what would this maximum flow be, according to the Ford-Fulkerson algorithm?
- 30 units
- 35 units
- 40 units
- 45 units
- None of the above
Original Idea: Yuri Souza Pada
Comentários
Postar um comentário