Support computations of vertex (and edge) connectivity of graph along with the vertex-(edge-) disjoint paths (Menger's theorem))

[lavkan]

Is your feature request related to a problem? Please describe.
For a given pair of nodes (or node sets), I am trying to find the largest number of node disjoint paths between them. This is equal to the size of the min cut size that separates the two node (sets) - Menger's theorem https://en.wikipedia.org/wiki/Menger%27s_theorem

Describe the solution you would like

[adamnsch]

Hi @lavkan,
Thank you for this feature request. We have added it to our roadmap. We don't know when we'll be able to pick it up, but we'll keep you posted.
Adam

[lavkan]

Hi @adamnsch, Thanks for the response. I posted this feature request here to see if anyone has attempted these algorithms either in GDS or with PregelAPI.