search

takemaru / graphillion

Fast, lightweight graphset operation library
Other
466 stars 40 forks source link

Feature request: minimum cut function #44

Closed MrRaghav closed 4 years ago

MrRaghav commented 4 years ago

Hello, I know that NetworkX has a direct function to implement min cut max flow algorithm (minimum_cut()). It works well with small graphs but fails for large graphs.

I checked Graphillion and found that it can use graphs from NetworkX but I couldn't find a direct minimum_cut() function.

This is a feature request to add this functionality in Graphillion.

takemaru commented 4 years ago

Thank you for using Graphillion.

Graphillion is mainly designed for dealing with complex graph constraints, but not for scalability of graph size. In terms of scalability, Graphillion cannot outperform NetworkX due to the design principle. Min cut is a simple constraint, solvable in a poly time, so I recommend you to use NetworkX for that.

Best regards,

MrRaghav commented 4 years ago

Thank you. I am closing this issue.