
Home

Computational Ecology and Software, 2018, 8(2): 57-61
[XML] [EndNote] [RefManager] [BibTex] [

Full PDF (85K)] [Supplementary Material (188K)] [Comment/Review Article]

Article

Finding maximum flow in the network: A Matlab program and application

WenJun Zhang
School of Life Sciences, Sun Yat-sen University, Guangzhou 510275, China; International Academy of Ecology and Environmental Sciences, Hong Kong

Received 9 August 2016;Accepted 6 October 2017;Published 1 June 2018
IAEES

Abstract
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.

Keywords network;Ford-Fulkerson algorithm;maximum flow;Matlab.

International Academy of Ecology and Environmental Sciences. E-mail: office@iaees.org
Copyright © 2009-2024 International Academy of Ecology and Environmental Sciences. All rights reserved.
Web administrator: office@iaees.org, website@iaees.org; Last modified: 2024/4/24

Translate page to: