search

sknetwork-team / scikit-network

Graph Algorithms
Other
602 stars 67 forks source link

Single commodity flow feature #526

Closed hcars closed 2 years ago

hcars commented 2 years ago

Description

This is a feature request. I would be interested in adding this to the library if the other contributors like it. The single commodity flow problem centers on finding the maximum flow from a set of source node to a set of target nodes with edge capacity constraints. We could implement a maximum flow method by wrapping (https://docs.scipy.org/doc/scipy/reference/generated/scipy.sparse.csgraph.maximum_flow.html).

tbonald commented 2 years ago

I'm moving this thread to the Discussions page as this is not an issue. Thanks.