Optimal Path: Maximum flow
Not what you're looking for?
A maximum flow problem to find the maximum amount of water to flow from city 1 to city 10.
Purchase this Solution
Solution Summary
This is a 7 page long step by step explanation and demonstration, through a numerical example and the use of 12 graphs, of the maximum flow problem with the use of the Ford-Fulkerson algorithm.
Solution Preview
I attached a word file with a detailed step-by-step explanation of the method and results, including 10 diagrams on how we can solve this algorithm by hand instead of a computer software. Thank-you for using BrainMass.
Preview:
This is a maximum flow problem as we need the maximum amount of water to flow from city 1 to city 10. The Ford-Fulkerson algorithm determines the maximum flow of the network. The Ford and Fulkerson algorithm states that in such problems exist two notable vertices. The first, the source, has intake 0 (in this case city 1) and the second, the sink, (in this case city 10) has outtake 0. Therefore all flow has to get from the source to the sink through possible paths in the system.
The capacity of paths in the network (i,j) is ...
Purchase this Solution
Free BrainMass Quizzes
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Graphs and Functions
This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.
Know Your Linear Equations
Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
Geometry - Real Life Application Problems
Understanding of how geometry applies to in real-world contexts