graph-data-science icon indicating copy to clipboard operation
graph-data-science copied to clipboard

Published 20 hours ago • verified publisher icon neo4j

Support connectivity algorithms (related to Ford-Fulkerson's algorithm)

Open lavkan opened this issue 3 years ago • 1 comments
trafficstars

Edge and vertex connectivity between two sets of vertices will have use cases to do with number of vertex or edge disjoint paths between the two sets (Menger's theorem).

https://reference.wolfram.com/language/ref/VertexConnectivity.html https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm

https://www.cse.msu.edu/~cse835/Papers/Graph_connectivity_revised.pdf https://www.cse.msu.edu/~cse835/Papers/Graph_connectivity_revised.pdf

Looking forward to see some algos related to connectivity.

Thanks, Lavanya

lavkan avatar May 09 '22 02:05 lavkan

Hi Lavanya,

It was great to meet you last week at GraphConnect!

We've captured your request and we'll consider it for future release candidates. However, this will not be a 2.2 candidate.

We have also seen your other previous requests too for Menger's theorem https://github.com/neo4j/graph-data-science/issues/198

Thanks, LG

laeg avatar Jun 13 '22 13:06 laeg