Finding maximum flow in the network: A Matlab program and application
oleh: WenJun Zhang
| Format: | Article |
|---|---|
| Diterbitkan: | International Academy of Ecology and Environmental Sciences 2018-06-01 |
Deskripsi
Maximum flow problems are expected occurring in some biological networks. As early as in 1950s, Ford and Fulkcerson proposed an algorithm to find maximum flow in a network. In this study I presented the full codes of Ford-Fulkcerson algorithm and given an application example.