The problem of maximum flow a particular case of the flow problem at minimum cost. It consists of finding a way to transport a product from nodes in the origin known as sources to the nodes in the destination known as sink. From each arc its maximum capacity is known. It is assumed that the origin of the node from which the shipment is intended is the origin of the first arc of the data that is entered. Likewise, the destination node to which the last possible flow can be reached is the destination node of the last arc that appears in the database.
This application has been developed from the application skeleton for didactic purposes. The skeleton application has been developed so that the creation of applications like this one does not require knowledge of shiny or html.
A free course is available on request, which explains in detail how to do this process.
To start: select an action, input values for parameters, and press "Go". Select the tab to show. You can enter new values and the results will be updated automatically.
Developed using shiny by M. Muñoz-Márquez under GNU-GPL licence inside R-UCA Project.