Ford and Fulkerson's Max-Flow Algorithm - Maple Application Center
Application Center Applications Ford and Fulkerson's Max-Flow Algorithm

Ford and Fulkerson's Max-Flow Algorithm

Author
: Jorge Alberto Calvillo
Engineering software solutions from Maplesoft
This Application runs in Maple. Don't have Maple? No problem!
 Try Maple free for 15 days!
The Ford-Fulkerson algorithm is a method to solve the maximum flow problem in a connected weighted network. Proposes to look for routes in a network in which the flow can be increased, until the flow is reached maximum flow. The idea is to find a route of penetration with a net positive flow that links the origin and destination nodes.
This work is part of a project in the master's degree in financial optimization destined to be used as didactic material in courses related to graph theory.

Application Details

Publish Date: November 30, 2018
Created In: Maple 17
Language: English

More Like This

Game of Thrones and Graph Theory
A Song of Ice and Fire and Graph Theory
Classroom Tips and Techniques: Bivariate Limits - Then and Now
Classroom Tips and Techniques: Plotting a Slice of a Vector Field
Internet Page Ranking Algorithms
Classroom Tips and Techniques: Introduction to Maple's GraphTheory Package
Classroom Tips and Techniques: Context-Menu Plotting
Classroom Tips and Techniques: Nonlinear Curve Fitting