Hi,
Is there any R implementation of the well-known algorithm from the Operations
Research
literature, the Ford-Fulkerson algorithm of maximum flow in networks with
capacities.
Thanks.
[[alternative HTML version deleted]]
On Sep 22, 2009, at 9:37 PM, shuva gupta wrote:> Hi, > Is there any R implementation of the well-known algorithm from the > Operations Research > literature, the Ford-Fulkerson algorithm of maximum flow in networks > with capacities. > Thanks. >http://lmgtfy.com/?q=%22Ford-Fulkerson%22+%22r-project%22 -- David Winsemius, MD Heritage Laboratories West Hartford, CT
Hi, with a different (faster) algorithm, but maximum flows are implemented in package igraph, although for some networks only calculating the flow value is supported, giving the flow itself is not. Best, Gabor On Wed, Sep 23, 2009 at 3:37 AM, shuva gupta <shuvagupta at yahoo.com> wrote:> Hi, > Is there any R implementation of the well-known algorithm from the Operations Research > literature, the Ford-Fulkerson algorithm of maximum flow in networks with capacities. > Thanks. > > > > > ? ? ? ?[[alternative HTML version deleted]] > > ______________________________________________ > R-help at r-project.org mailing list > https://stat.ethz.ch/mailman/listinfo/r-help > PLEASE do read the posting guide http://www.R-project.org/posting-guide.html > and provide commented, minimal, self-contained, reproducible code. >-- Gabor Csardi <Gabor.Csardi at unil.ch> UNIL DGM
one implementation is in the optmatch package as far as I remember stefano On 23/set/09, at 03:37, shuva gupta wrote:> Hi, > Is there any R implementation of the well-known algorithm from the > Operations Research > literature, the Ford-Fulkerson algorithm of maximum flow in networks > with capacities. > Thanks. > > > > > [[alternative HTML version deleted]] > > ______________________________________________ > R-help at r-project.org mailing list > https://stat.ethz.ch/mailman/listinfo/r-help > PLEASE do read the posting guide http://www.R-project.org/posting-guide.html > and provide commented, minimal, self-contained, reproducible code.