[Networkit] Plans of including min-cost flow algorithms?
henning.meyerhenke at kit.edu
Mon Dec 19 15:33:18 CET 2016
Having some connection to network analysis has usually been the
necessary bar for inclusion. NetworKit is not aiming for every possible
graph algorithm -- that would overburden us. On the other hand, flows
are used in network analysis as part of cut-based algorithms -- which is
why Edmonds-Karp is available to have some very basic functionality
there. Thus, if you come up with a solid argument why your algorithm
could be used in a network analysis workflow, we would certainly
consider a pull request.
Am 19.12.16 um 14:39 schrieb Lukas Barth:
> Hi everyone,
> I find myself (for the second time now) in the situation that I'm
> looking for a Python framework that offers to compute min-cost flows on
> graphs. Now I would love to use our "in-house Python toolkit"; however,
> there are no flow algorithms in NetworKit (and thus I will probably
> again turn to networkx).
> My question is: Is NetworKit lacking these algorithms (and many others)
> because you intentionally decided that NetworKit should be a network
> analysis only framework and thus not include "general graph algorithms",
> or is it just because no one bothered to implement them yet? In other
> words: If I started to cook up a pull request containing a min-cost flow
> algorithm, would it stand a chance of being merged?
> NetworKit mailing list
> NetworKit at ira.uni-karlsruhe.de
Karlsruhe Institute of Technology (KIT)
Institute of Theoretical Informatics (ITI)
Prof. Dr. Henning Meyerhenke
Theoret. Informatics / Parallel Computing
KIT - The Research University in the Helmholtz Association
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 5399 bytes
Desc: S/MIME Cryptographic Signature
More information about the NetworKit